./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42e706fd1a5bd201d46dd2f3322f156b6d900789b8c9ace16cba5458f69fdc62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:54:09,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:54:09,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:54:09,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:54:09,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:54:09,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:54:09,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:54:09,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:54:09,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:54:09,697 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:54:09,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:54:09,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:54:09,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:54:09,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:54:09,699 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:54:09,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:54:09,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:54:09,699 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:54:09,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:54:09,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:54:09,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:54:09,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:54:09,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:54:09,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:54:09,700 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:54:09,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:54:09,700 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:54:09,700 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:54:09,700 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:54:09,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:54:09,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:54:09,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:54:09,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:54:09,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:54:09,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:54:09,701 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:54:09,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:54:09,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:54:09,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:54:09,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:54:09,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:54:09,701 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:54:09,701 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:54:09,702 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42e706fd1a5bd201d46dd2f3322f156b6d900789b8c9ace16cba5458f69fdc62 [2025-03-08 05:54:09,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:54:09,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:54:09,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:54:09,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:54:09,952 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:54:09,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.08.cil-1.c [2025-03-08 05:54:11,142 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2747eb1/09a6bc4491e240a0becf958c75dcedac/FLAGe66db06ac [2025-03-08 05:54:11,430 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:54:11,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-1.c [2025-03-08 05:54:11,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2747eb1/09a6bc4491e240a0becf958c75dcedac/FLAGe66db06ac [2025-03-08 05:54:11,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2747eb1/09a6bc4491e240a0becf958c75dcedac [2025-03-08 05:54:11,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:54:11,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:54:11,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:54:11,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:54:11,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:54:11,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:54:11" (1/1) ... [2025-03-08 05:54:11,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ef33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:11, skipping insertion in model container [2025-03-08 05:54:11,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:54:11" (1/1) ... [2025-03-08 05:54:11,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:54:11,880 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-1.c[671,684] [2025-03-08 05:54:11,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:54:12,006 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:54:12,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-1.c[671,684] [2025-03-08 05:54:12,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:54:12,073 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:54:12,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12 WrapperNode [2025-03-08 05:54:12,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:54:12,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:54:12,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:54:12,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:54:12,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12" (1/1) ... [2025-03-08 05:54:12,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12" (1/1) ... [2025-03-08 05:54:12,125 INFO L138 Inliner]: procedures = 44, calls = 55, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 606 [2025-03-08 05:54:12,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:54:12,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:54:12,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:54:12,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:54:12,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12" (1/1) ... [2025-03-08 05:54:12,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12" (1/1) ... [2025-03-08 05:54:12,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12" (1/1) ... [2025-03-08 05:54:12,148 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 05:54:12,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12" (1/1) ... [2025-03-08 05:54:12,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12" (1/1) ... [2025-03-08 05:54:12,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12" (1/1) ... [2025-03-08 05:54:12,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12" (1/1) ... [2025-03-08 05:54:12,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12" (1/1) ... [2025-03-08 05:54:12,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12" (1/1) ... [2025-03-08 05:54:12,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:54:12,165 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:54:12,165 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:54:12,165 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:54:12,166 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12" (1/1) ... [2025-03-08 05:54:12,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:54:12,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:54:12,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:54:12,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:54:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:54:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 05:54:12,227 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 05:54:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 05:54:12,227 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 05:54:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 05:54:12,227 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 05:54:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 05:54:12,227 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 05:54:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 05:54:12,227 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 05:54:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:54:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 05:54:12,227 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 05:54:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:54:12,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:54:12,313 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:54:12,315 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:54:12,961 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-03-08 05:54:12,962 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:54:12,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:54:12,977 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:54:12,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:54:12 BoogieIcfgContainer [2025-03-08 05:54:12,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:54:12,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:54:12,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:54:12,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:54:12,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:54:11" (1/3) ... [2025-03-08 05:54:12,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2827c4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:54:12, skipping insertion in model container [2025-03-08 05:54:12,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:54:12" (2/3) ... [2025-03-08 05:54:12,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2827c4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:54:12, skipping insertion in model container [2025-03-08 05:54:12,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:54:12" (3/3) ... [2025-03-08 05:54:12,987 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.08.cil-1.c [2025-03-08 05:54:13,000 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:54:13,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.08.cil-1.c that has 7 procedures, 280 locations, 1 initial locations, 11 loop locations, and 1 error locations. [2025-03-08 05:54:13,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:54:13,073 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f22a279, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:54:13,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:54:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 280 states, 251 states have (on average 1.6015936254980079) internal successors, (402), 252 states have internal predecessors, (402), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 05:54:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:54:13,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:13,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:13,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:13,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:13,101 INFO L85 PathProgramCache]: Analyzing trace with hash -168663170, now seen corresponding path program 1 times [2025-03-08 05:54:13,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:13,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650582419] [2025-03-08 05:54:13,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:13,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:13,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:54:13,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:54:13,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:13,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:13,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:13,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650582419] [2025-03-08 05:54:13,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650582419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:13,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:13,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:54:13,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571367773] [2025-03-08 05:54:13,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:13,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:54:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:13,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:54:13,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:54:13,720 INFO L87 Difference]: Start difference. First operand has 280 states, 251 states have (on average 1.6015936254980079) internal successors, (402), 252 states have internal predecessors, (402), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:14,295 INFO L93 Difference]: Finished difference Result 838 states and 1348 transitions. [2025-03-08 05:54:14,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:54:14,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2025-03-08 05:54:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:14,310 INFO L225 Difference]: With dead ends: 838 [2025-03-08 05:54:14,310 INFO L226 Difference]: Without dead ends: 566 [2025-03-08 05:54:14,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:14,346 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 814 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:14,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1198 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:54:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-08 05:54:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 545. [2025-03-08 05:54:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 492 states have (on average 1.5752032520325203) internal successors, (775), 494 states have internal predecessors, (775), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-08 05:54:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 854 transitions. [2025-03-08 05:54:14,432 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 854 transitions. Word has length 131 [2025-03-08 05:54:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:14,432 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 854 transitions. [2025-03-08 05:54:14,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 854 transitions. [2025-03-08 05:54:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:54:14,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:14,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:14,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:54:14,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:14,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash 272906560, now seen corresponding path program 1 times [2025-03-08 05:54:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:14,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017862471] [2025-03-08 05:54:14,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:14,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:54:14,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:54:14,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:14,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:14,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:14,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017862471] [2025-03-08 05:54:14,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017862471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:14,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:14,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:14,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29757319] [2025-03-08 05:54:14,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:14,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:14,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:14,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:14,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:14,704 INFO L87 Difference]: Start difference. First operand 545 states and 854 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:15,322 INFO L93 Difference]: Finished difference Result 1413 states and 2236 transitions. [2025-03-08 05:54:15,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:15,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2025-03-08 05:54:15,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:15,328 INFO L225 Difference]: With dead ends: 1413 [2025-03-08 05:54:15,328 INFO L226 Difference]: Without dead ends: 884 [2025-03-08 05:54:15,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:15,331 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 809 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:15,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2224 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:54:15,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-03-08 05:54:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 795. [2025-03-08 05:54:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 718 states have (on average 1.5668523676880224) internal successors, (1125), 721 states have internal predecessors, (1125), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-03-08 05:54:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1241 transitions. [2025-03-08 05:54:15,381 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1241 transitions. Word has length 131 [2025-03-08 05:54:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:15,383 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1241 transitions. [2025-03-08 05:54:15,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:15,383 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1241 transitions. [2025-03-08 05:54:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:54:15,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:15,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:15,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:54:15,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:15,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash -550774911, now seen corresponding path program 1 times [2025-03-08 05:54:15,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:15,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100526022] [2025-03-08 05:54:15,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:15,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:15,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:54:15,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:54:15,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:15,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:15,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:15,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100526022] [2025-03-08 05:54:15,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100526022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:15,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:15,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:15,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085325167] [2025-03-08 05:54:15,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:15,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:15,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:15,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:15,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:15,570 INFO L87 Difference]: Start difference. First operand 795 states and 1241 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:16,111 INFO L93 Difference]: Finished difference Result 2206 states and 3482 transitions. [2025-03-08 05:54:16,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:16,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2025-03-08 05:54:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:16,120 INFO L225 Difference]: With dead ends: 2206 [2025-03-08 05:54:16,120 INFO L226 Difference]: Without dead ends: 1427 [2025-03-08 05:54:16,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:16,125 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 804 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:16,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 2208 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-03-08 05:54:16,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1326. [2025-03-08 05:54:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1199 states have (on average 1.567973311092577) internal successors, (1880), 1206 states have internal predecessors, (1880), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-08 05:54:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 2076 transitions. [2025-03-08 05:54:16,218 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 2076 transitions. Word has length 131 [2025-03-08 05:54:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:16,219 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 2076 transitions. [2025-03-08 05:54:16,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2076 transitions. [2025-03-08 05:54:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:54:16,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:16,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:16,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:54:16,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:16,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:16,223 INFO L85 PathProgramCache]: Analyzing trace with hash 531033376, now seen corresponding path program 1 times [2025-03-08 05:54:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:16,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846734958] [2025-03-08 05:54:16,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:16,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:54:16,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:54:16,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:16,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:16,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:16,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846734958] [2025-03-08 05:54:16,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846734958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:16,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:16,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:16,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259128218] [2025-03-08 05:54:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:16,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:16,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:16,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:16,404 INFO L87 Difference]: Start difference. First operand 1326 states and 2076 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:16,935 INFO L93 Difference]: Finished difference Result 3911 states and 6215 transitions. [2025-03-08 05:54:16,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:16,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2025-03-08 05:54:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:16,945 INFO L225 Difference]: With dead ends: 3911 [2025-03-08 05:54:16,945 INFO L226 Difference]: Without dead ends: 2601 [2025-03-08 05:54:16,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:16,949 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 825 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:16,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1559 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2025-03-08 05:54:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2475. [2025-03-08 05:54:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2242 states have (on average 1.5807314897413025) internal successors, (3544), 2263 states have internal predecessors, (3544), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-03-08 05:54:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3924 transitions. [2025-03-08 05:54:17,043 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3924 transitions. Word has length 131 [2025-03-08 05:54:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:17,044 INFO L471 AbstractCegarLoop]: Abstraction has 2475 states and 3924 transitions. [2025-03-08 05:54:17,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3924 transitions. [2025-03-08 05:54:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:54:17,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:17,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:17,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:54:17,046 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:17,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash 11741089, now seen corresponding path program 1 times [2025-03-08 05:54:17,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:17,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538139106] [2025-03-08 05:54:17,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:17,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:17,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:54:17,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:54:17,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:17,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:17,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:17,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538139106] [2025-03-08 05:54:17,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538139106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:17,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:17,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:17,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906713173] [2025-03-08 05:54:17,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:17,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:17,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:17,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:17,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:17,204 INFO L87 Difference]: Start difference. First operand 2475 states and 3924 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:17,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:17,828 INFO L93 Difference]: Finished difference Result 7650 states and 12381 transitions. [2025-03-08 05:54:17,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:17,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2025-03-08 05:54:17,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:17,850 INFO L225 Difference]: With dead ends: 7650 [2025-03-08 05:54:17,850 INFO L226 Difference]: Without dead ends: 5191 [2025-03-08 05:54:17,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:17,857 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 794 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:17,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 2184 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:54:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5191 states. [2025-03-08 05:54:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5191 to 5016. [2025-03-08 05:54:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5016 states, 4553 states have (on average 1.6033384581594552) internal successors, (7300), 4620 states have internal predecessors, (7300), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-03-08 05:54:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5016 states to 5016 states and 8144 transitions. [2025-03-08 05:54:18,089 INFO L78 Accepts]: Start accepts. Automaton has 5016 states and 8144 transitions. Word has length 131 [2025-03-08 05:54:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:18,089 INFO L471 AbstractCegarLoop]: Abstraction has 5016 states and 8144 transitions. [2025-03-08 05:54:18,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 5016 states and 8144 transitions. [2025-03-08 05:54:18,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:54:18,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:18,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:18,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:54:18,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:18,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:18,097 INFO L85 PathProgramCache]: Analyzing trace with hash -974841600, now seen corresponding path program 1 times [2025-03-08 05:54:18,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:18,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200803034] [2025-03-08 05:54:18,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:18,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:18,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:54:18,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:54:18,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:18,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:18,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:18,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200803034] [2025-03-08 05:54:18,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200803034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:18,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:18,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:18,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413644815] [2025-03-08 05:54:18,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:18,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:18,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:18,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:18,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:18,210 INFO L87 Difference]: Start difference. First operand 5016 states and 8144 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:18,945 INFO L93 Difference]: Finished difference Result 16041 states and 26791 transitions. [2025-03-08 05:54:18,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:18,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2025-03-08 05:54:18,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:18,995 INFO L225 Difference]: With dead ends: 16041 [2025-03-08 05:54:18,995 INFO L226 Difference]: Without dead ends: 11041 [2025-03-08 05:54:19,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:19,011 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 789 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:19,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 2172 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11041 states. [2025-03-08 05:54:19,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11041 to 10773. [2025-03-08 05:54:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10773 states, 9796 states have (on average 1.6325030624744794) internal successors, (15992), 10009 states have internal predecessors, (15992), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-08 05:54:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10773 states to 10773 states and 18148 transitions. [2025-03-08 05:54:19,486 INFO L78 Accepts]: Start accepts. Automaton has 10773 states and 18148 transitions. Word has length 131 [2025-03-08 05:54:19,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:19,487 INFO L471 AbstractCegarLoop]: Abstraction has 10773 states and 18148 transitions. [2025-03-08 05:54:19,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 10773 states and 18148 transitions. [2025-03-08 05:54:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:54:19,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:19,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:19,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:54:19,496 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:19,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:19,496 INFO L85 PathProgramCache]: Analyzing trace with hash 101711809, now seen corresponding path program 1 times [2025-03-08 05:54:19,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:19,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745202991] [2025-03-08 05:54:19,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:19,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:19,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:54:19,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:54:19,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:19,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:19,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:19,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745202991] [2025-03-08 05:54:19,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745202991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:19,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:19,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:19,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716505962] [2025-03-08 05:54:19,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:19,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:19,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:19,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:19,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:19,620 INFO L87 Difference]: Start difference. First operand 10773 states and 18148 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:20,651 INFO L93 Difference]: Finished difference Result 35348 states and 61909 transitions. [2025-03-08 05:54:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:20,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2025-03-08 05:54:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:20,792 INFO L225 Difference]: With dead ends: 35348 [2025-03-08 05:54:20,792 INFO L226 Difference]: Without dead ends: 24591 [2025-03-08 05:54:20,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:20,841 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 784 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:20,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 2160 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:54:20,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24591 states. [2025-03-08 05:54:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24591 to 24150. [2025-03-08 05:54:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24150 states, 21983 states have (on average 1.6649228949642907) internal successors, (36600), 22650 states have internal predecessors, (36600), 1110 states have call successors, (1110), 390 states have call predecessors, (1110), 1056 states have return successors, (5206), 1173 states have call predecessors, (5206), 1110 states have call successors, (5206) [2025-03-08 05:54:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24150 states to 24150 states and 42916 transitions. [2025-03-08 05:54:22,018 INFO L78 Accepts]: Start accepts. Automaton has 24150 states and 42916 transitions. Word has length 131 [2025-03-08 05:54:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:22,018 INFO L471 AbstractCegarLoop]: Abstraction has 24150 states and 42916 transitions. [2025-03-08 05:54:22,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:22,019 INFO L276 IsEmpty]: Start isEmpty. Operand 24150 states and 42916 transitions. [2025-03-08 05:54:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:54:22,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:22,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:22,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:54:22,032 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:22,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1937554656, now seen corresponding path program 1 times [2025-03-08 05:54:22,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:22,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323816631] [2025-03-08 05:54:22,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:22,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:22,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:54:22,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:54:22,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:22,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:22,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:22,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323816631] [2025-03-08 05:54:22,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323816631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:22,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:22,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:22,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285926406] [2025-03-08 05:54:22,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:22,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:22,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:22,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:22,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:22,141 INFO L87 Difference]: Start difference. First operand 24150 states and 42916 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:23,814 INFO L93 Difference]: Finished difference Result 80899 states and 151707 transitions. [2025-03-08 05:54:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:23,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2025-03-08 05:54:23,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:24,077 INFO L225 Difference]: With dead ends: 80899 [2025-03-08 05:54:24,078 INFO L226 Difference]: Without dead ends: 56765 [2025-03-08 05:54:24,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:24,162 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 779 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:24,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 2148 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:54:24,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56765 states. [2025-03-08 05:54:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56765 to 56007. [2025-03-08 05:54:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56007 states, 50974 states have (on average 1.6975713108643622) internal successors, (86532), 53035 states have internal predecessors, (86532), 2198 states have call successors, (2198), 774 states have call predecessors, (2198), 2834 states have return successors, (18582), 2325 states have call predecessors, (18582), 2198 states have call successors, (18582) [2025-03-08 05:54:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56007 states to 56007 states and 107312 transitions. [2025-03-08 05:54:26,640 INFO L78 Accepts]: Start accepts. Automaton has 56007 states and 107312 transitions. Word has length 131 [2025-03-08 05:54:26,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:26,642 INFO L471 AbstractCegarLoop]: Abstraction has 56007 states and 107312 transitions. [2025-03-08 05:54:26,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:26,646 INFO L276 IsEmpty]: Start isEmpty. Operand 56007 states and 107312 transitions. [2025-03-08 05:54:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:54:26,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:26,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:26,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:54:26,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:26,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:26,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1996775393, now seen corresponding path program 1 times [2025-03-08 05:54:26,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:26,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465976666] [2025-03-08 05:54:26,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:26,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:26,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:54:26,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:54:26,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:26,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:26,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:26,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465976666] [2025-03-08 05:54:26,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465976666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:26,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:26,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:54:26,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591090743] [2025-03-08 05:54:26,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:26,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:54:26,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:26,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:54:26,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:54:26,778 INFO L87 Difference]: Start difference. First operand 56007 states and 107312 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:29,359 INFO L93 Difference]: Finished difference Result 131699 states and 264076 transitions. [2025-03-08 05:54:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:54:29,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2025-03-08 05:54:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:29,690 INFO L225 Difference]: With dead ends: 131699 [2025-03-08 05:54:29,690 INFO L226 Difference]: Without dead ends: 75708 [2025-03-08 05:54:29,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:29,804 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 565 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:29,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 792 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:54:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75708 states. [2025-03-08 05:54:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75708 to 56007. [2025-03-08 05:54:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56007 states, 50974 states have (on average 1.69504060893789) internal successors, (86403), 53035 states have internal predecessors, (86403), 2198 states have call successors, (2198), 774 states have call predecessors, (2198), 2834 states have return successors, (18582), 2325 states have call predecessors, (18582), 2198 states have call successors, (18582) [2025-03-08 05:54:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56007 states to 56007 states and 107183 transitions. [2025-03-08 05:54:33,172 INFO L78 Accepts]: Start accepts. Automaton has 56007 states and 107183 transitions. Word has length 131 [2025-03-08 05:54:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:33,172 INFO L471 AbstractCegarLoop]: Abstraction has 56007 states and 107183 transitions. [2025-03-08 05:54:33,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 56007 states and 107183 transitions. [2025-03-08 05:54:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:54:33,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:33,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:54:33,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:54:33,196 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:33,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:33,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1167405278, now seen corresponding path program 1 times [2025-03-08 05:54:33,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:33,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667492554] [2025-03-08 05:54:33,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:33,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:33,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:54:33,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:54:33,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:33,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:33,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:33,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667492554] [2025-03-08 05:54:33,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667492554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:33,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:33,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:33,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026862239] [2025-03-08 05:54:33,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:33,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:33,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:33,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:33,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:33,326 INFO L87 Difference]: Start difference. First operand 56007 states and 107183 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:38,211 INFO L93 Difference]: Finished difference Result 192274 states and 393567 transitions. [2025-03-08 05:54:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:38,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 131 [2025-03-08 05:54:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:39,063 INFO L225 Difference]: With dead ends: 192274 [2025-03-08 05:54:39,063 INFO L226 Difference]: Without dead ends: 136283 [2025-03-08 05:54:39,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:39,242 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 957 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:39,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 2090 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:54:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136283 states.