/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:20:31,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:31,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:20:31,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:31,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:31,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:31,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:31,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:31,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:31,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:31,888 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:31,888 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:31,888 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:31,888 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:31,888 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:31,888 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:31,888 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:31,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:31,888 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:31,888 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:31,888 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:31,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:31,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:31,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:31,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:31,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:31,889 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:31,889 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:31,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:31,889 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:31,889 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:31,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:31,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:31,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:31,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:31,890 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:31,890 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:32,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:32,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:32,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:32,161 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:32,162 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:32,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl [2025-04-26 16:20:32,165 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl' [2025-04-26 16:20:32,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:32,179 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:32,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:32,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:32,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:32,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:32" (1/1) ... [2025-04-26 16:20:32,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:32" (1/1) ... [2025-04-26 16:20:32,213 INFO L138 Inliner]: procedures = 2, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:20:32,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:32,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:32,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:32,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:32,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:32" (1/1) ... [2025-04-26 16:20:32,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:32" (1/1) ... [2025-04-26 16:20:32,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:32" (1/1) ... [2025-04-26 16:20:32,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:32" (1/1) ... [2025-04-26 16:20:32,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:32" (1/1) ... [2025-04-26 16:20:32,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:32" (1/1) ... [2025-04-26 16:20:32,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:32" (1/1) ... [2025-04-26 16:20:32,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:32" (1/1) ... [2025-04-26 16:20:32,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:32" (1/1) ... [2025-04-26 16:20:32,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:32,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:32,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:32,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:32,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:32" (1/1) ... [2025-04-26 16:20:32,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:32,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:32,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:32,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:20:32,284 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2025-04-26 16:20:32,285 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2025-04-26 16:20:32,285 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2025-04-26 16:20:32,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:32,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:32,286 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:20:32,319 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:32,321 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:32,376 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:32,376 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:32,383 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:32,383 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:20:32,383 INFO L201 PluginConnector]: Adding new model fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:32 BoogieIcfgContainer [2025-04-26 16:20:32,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:32,384 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:32,384 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:32,388 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:32,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:32,388 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:32" (1/2) ... [2025-04-26 16:20:32,389 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14ea4f72 and model type fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:20:32, skipping insertion in model container [2025-04-26 16:20:32,389 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:32,389 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:32" (2/2) ... [2025-04-26 16:20:32,390 INFO L376 chiAutomizerObserver]: Analyzing ICFG fork_in_loop.bpl [2025-04-26 16:20:32,418 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:20:32,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 80 flow [2025-04-26 16:20:32,469 INFO L116 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-04-26 16:20:32,470 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:20:32,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-26 16:20:32,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 80 flow [2025-04-26 16:20:32,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 20 transitions, 54 flow [2025-04-26 16:20:32,476 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 23 places, 20 transitions, 54 flow [2025-04-26 16:20:32,485 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:32,485 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:32,485 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:32,485 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:32,486 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:32,486 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:32,486 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:32,486 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:32,488 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:32,508 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2025-04-26 16:20:32,509 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:32,509 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:32,512 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2025-04-26 16:20:32,512 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:20:32,512 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:32,513 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 41 states, but on-demand construction may add more states [2025-04-26 16:20:32,517 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2025-04-26 16:20:32,517 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:32,517 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:32,518 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2025-04-26 16:20:32,518 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:20:32,521 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L22-1: Formula: (= 1 v_ULTIMATE.start_x_1) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[28] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[53] L23-->$Ultimate##0: Formula: (and (= v_fooThread1of1ForFork1_thidvar0_2 v_ULTIMATE.start_x_16) (= v_fooThread1of1ForFork1_i_2 v_ULTIMATE.start_x_16)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_16} OutVars{fooThread1of1ForFork1_y=v_fooThread1of1ForFork1_y_4, fooThread1of1ForFork1_i=v_fooThread1of1ForFork1_i_2, fooThread1of1ForFork1_thidvar0=v_fooThread1of1ForFork1_thidvar0_2, ULTIMATE.start_x=v_ULTIMATE.start_x_16} AuxVars[] AssignedVars[fooThread1of1ForFork1_y, fooThread1of1ForFork1_i, fooThread1of1ForFork1_thidvar0]" "[35] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[28] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[51] L23-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:32,522 INFO L754 eck$LassoCheckResult]: Loop: "[52] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:32,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2088770937, now seen corresponding path program 1 times [2025-04-26 16:20:32,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:32,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152737889] [2025-04-26 16:20:32,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:32,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:32,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:32,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:32,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:32,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:32,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:32,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152737889] [2025-04-26 16:20:32,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152737889] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:32,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:32,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:20:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898704934] [2025-04-26 16:20:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:32,641 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:32,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times [2025-04-26 16:20:32,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:32,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264816013] [2025-04-26 16:20:32,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:32,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:32,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:32,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:32,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:32,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:32,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:32,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:32,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:32,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:32,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:32,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:32,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:32,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:20:32,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:20:32,680 INFO L87 Difference]: Start difference. First operand currently 41 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:32,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:32,723 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2025-04-26 16:20:32,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 52 transitions. [2025-04-26 16:20:32,725 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 16:20:32,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 29 states and 43 transitions. [2025-04-26 16:20:32,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-04-26 16:20:32,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-04-26 16:20:32,733 INFO L74 IsDeterministic]: Start isDeterministic. Operand 29 states and 43 transitions. [2025-04-26 16:20:32,733 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:32,733 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2025-04-26 16:20:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 43 transitions. [2025-04-26 16:20:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-26 16:20:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (in total 43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2025-04-26 16:20:32,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2025-04-26 16:20:32,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:20:32,777 INFO L438 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2025-04-26 16:20:32,777 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:32,777 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2025-04-26 16:20:32,778 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 16:20:32,778 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:32,778 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:32,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:32,778 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:20:32,779 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L22-1: Formula: (= 1 v_ULTIMATE.start_x_1) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[28] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[53] L23-->$Ultimate##0: Formula: (and (= v_fooThread1of1ForFork1_thidvar0_2 v_ULTIMATE.start_x_16) (= v_fooThread1of1ForFork1_i_2 v_ULTIMATE.start_x_16)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_16} OutVars{fooThread1of1ForFork1_y=v_fooThread1of1ForFork1_y_4, fooThread1of1ForFork1_i=v_fooThread1of1ForFork1_i_2, fooThread1of1ForFork1_thidvar0=v_fooThread1of1ForFork1_thidvar0_2, ULTIMATE.start_x=v_ULTIMATE.start_x_16} AuxVars[] AssignedVars[fooThread1of1ForFork1_y, fooThread1of1ForFork1_i, fooThread1of1ForFork1_thidvar0]" "[35] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[27] L22-1-->L26: Formula: (<= 2 v_ULTIMATE.start_x_5) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_5} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_5} AuxVars[] AssignedVars[]" "[34] L26-->L27: Formula: (= 1 v_ULTIMATE.start_x_6) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_6} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[44] $Ultimate##0-->fooFINAL: Formula: (= v_fooThread1of1ForFork1_y_1 4) InVars {} OutVars{fooThread1of1ForFork1_y=v_fooThread1of1ForFork1_y_1} AuxVars[] AssignedVars[fooThread1of1ForFork1_y]" "[45] fooFINAL-->fooEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[54] fooEXIT-->L28: Formula: (= v_fooThread1of1ForFork1_thidvar0_4 v_ULTIMATE.start_x_18) InVars {fooThread1of1ForFork1_thidvar0=v_fooThread1of1ForFork1_thidvar0_4, ULTIMATE.start_x=v_ULTIMATE.start_x_18} OutVars{fooThread1of1ForFork1_thidvar0=v_fooThread1of1ForFork1_thidvar0_4, ULTIMATE.start_x=v_ULTIMATE.start_x_18} AuxVars[] AssignedVars[]" "[40] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[]" "[50] L29-->$Ultimate##0: Formula: (and (= v_fooThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_x_13) (= v_fooThread1of1ForFork0_i_2 v_ULTIMATE.start_x_13)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_13} OutVars{fooThread1of1ForFork0_thidvar0=v_fooThread1of1ForFork0_thidvar0_2, fooThread1of1ForFork0_y=v_fooThread1of1ForFork0_y_4, fooThread1of1ForFork0_i=v_fooThread1of1ForFork0_i_2, ULTIMATE.start_x=v_ULTIMATE.start_x_13} AuxVars[] AssignedVars[fooThread1of1ForFork0_thidvar0, fooThread1of1ForFork0_y, fooThread1of1ForFork0_i]" "[32] L29-1-->L28: Formula: (= (+ 1 v_ULTIMATE.start_x_9) v_ULTIMATE.start_x_8) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_9} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_8} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[40] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[]" "[48] L29-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:32,779 INFO L754 eck$LassoCheckResult]: Loop: "[49] ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:32,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1976337806, now seen corresponding path program 1 times [2025-04-26 16:20:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:32,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438118959] [2025-04-26 16:20:32,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:32,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:32,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:20:32,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:20:32,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:32,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:32,797 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:32,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:20:32,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:20:32,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:32,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:32,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:32,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:32,812 INFO L85 PathProgramCache]: Analyzing trace with hash 80, now seen corresponding path program 1 times [2025-04-26 16:20:32,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:32,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49036090] [2025-04-26 16:20:32,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:32,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:32,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:32,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:32,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:32,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:32,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:32,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:32,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:32,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:32,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:32,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:32,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:32,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1136929793, now seen corresponding path program 1 times [2025-04-26 16:20:32,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:32,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328908911] [2025-04-26 16:20:32,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:32,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:32,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:20:32,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:20:32,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:32,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:32,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:32,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:20:32,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:20:32,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:32,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:32,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:33,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:20:33,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:20:33,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:33,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:33,024 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:33,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:20:33,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:20:33,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:33,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:33,057 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:20:33,076 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-04-26 16:20:33,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 39 transitions, 134 flow [2025-04-26 16:20:33,103 INFO L116 PetriNetUnfolderBase]: 18/115 cut-off events. [2025-04-26 16:20:33,103 INFO L117 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-04-26 16:20:33,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 115 events. 18/115 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 411 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 84. Up to 15 conditions per place. [2025-04-26 16:20:33,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 39 transitions, 134 flow [2025-04-26 16:20:33,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 37 transitions, 124 flow [2025-04-26 16:20:33,105 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 37 places, 37 transitions, 124 flow [2025-04-26 16:20:33,105 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:33,106 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:33,106 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:33,106 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:33,106 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:33,106 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:33,106 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:33,106 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:33,106 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:33,180 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 72 [2025-04-26 16:20:33,181 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:33,181 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:33,181 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1] [2025-04-26 16:20:33,181 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:20:33,181 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:33,181 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 603 states, but on-demand construction may add more states [2025-04-26 16:20:33,200 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 72 [2025-04-26 16:20:33,200 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:33,200 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:33,200 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1] [2025-04-26 16:20:33,200 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:20:33,201 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L22-1: Formula: (= 1 v_ULTIMATE.start_x_1) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[62] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[92] L23-->$Ultimate##0: Formula: (and (= v_fooThread1of2ForFork1_i_2 v_ULTIMATE.start_x_33) (= v_ULTIMATE.start_x_33 v_fooThread1of2ForFork1_thidvar0_2)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_33} OutVars{fooThread1of2ForFork1_y=v_fooThread1of2ForFork1_y_4, fooThread1of2ForFork1_i=v_fooThread1of2ForFork1_i_2, ULTIMATE.start_x=v_ULTIMATE.start_x_33, fooThread1of2ForFork1_thidvar0=v_fooThread1of2ForFork1_thidvar0_2} AuxVars[] AssignedVars[fooThread1of2ForFork1_y, fooThread1of2ForFork1_i, fooThread1of2ForFork1_thidvar0]" "[69] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[62] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[93] L23-->$Ultimate##0: Formula: (and (= v_fooThread2of2ForFork1_thidvar0_2 v_ULTIMATE.start_x_36) (= v_fooThread2of2ForFork1_i_2 v_ULTIMATE.start_x_36)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_36} OutVars{fooThread2of2ForFork1_thidvar0=v_fooThread2of2ForFork1_thidvar0_2, ULTIMATE.start_x=v_ULTIMATE.start_x_36, fooThread2of2ForFork1_y=v_fooThread2of2ForFork1_y_4, fooThread2of2ForFork1_i=v_fooThread2of2ForFork1_i_2} AuxVars[] AssignedVars[fooThread2of2ForFork1_thidvar0, fooThread2of2ForFork1_y, fooThread2of2ForFork1_i]" "[69] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[62] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[90] L23-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:33,201 INFO L754 eck$LassoCheckResult]: Loop: "[91] ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:33,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:33,202 INFO L85 PathProgramCache]: Analyzing trace with hash 149914949, now seen corresponding path program 1 times [2025-04-26 16:20:33,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:33,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506091592] [2025-04-26 16:20:33,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:33,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:33,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:33,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:33,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:33,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:33,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:33,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506091592] [2025-04-26 16:20:33,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506091592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:33,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:33,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:20:33,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67341374] [2025-04-26 16:20:33,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:33,231 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:33,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash 122, now seen corresponding path program 1 times [2025-04-26 16:20:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:33,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120756335] [2025-04-26 16:20:33,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:33,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:33,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:33,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:33,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:33,233 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:33,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:33,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:33,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:33,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:33,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:33,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:33,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:20:33,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:20:33,237 INFO L87 Difference]: Start difference. First operand currently 603 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:33,266 INFO L93 Difference]: Finished difference Result 86 states and 165 transitions. [2025-04-26 16:20:33,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 165 transitions. [2025-04-26 16:20:33,268 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2025-04-26 16:20:33,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 62 states and 122 transitions. [2025-04-26 16:20:33,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-04-26 16:20:33,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 16:20:33,271 INFO L74 IsDeterministic]: Start isDeterministic. Operand 62 states and 122 transitions. [2025-04-26 16:20:33,272 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:33,272 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 122 transitions. [2025-04-26 16:20:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 122 transitions. [2025-04-26 16:20:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-04-26 16:20:33,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.967741935483871) internal successors, (in total 122), 61 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 122 transitions. [2025-04-26 16:20:33,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 122 transitions. [2025-04-26 16:20:33,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:20:33,277 INFO L438 stractBuchiCegarLoop]: Abstraction has 62 states and 122 transitions. [2025-04-26 16:20:33,277 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:33,277 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 122 transitions. [2025-04-26 16:20:33,278 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2025-04-26 16:20:33,278 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:33,278 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:33,278 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:33,279 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:20:33,279 INFO L752 eck$LassoCheckResult]: Stem: "[75] $Ultimate##0-->L22-1: Formula: (= 1 v_ULTIMATE.start_x_1) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[62] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[92] L23-->$Ultimate##0: Formula: (and (= v_fooThread1of2ForFork1_i_2 v_ULTIMATE.start_x_33) (= v_ULTIMATE.start_x_33 v_fooThread1of2ForFork1_thidvar0_2)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_33} OutVars{fooThread1of2ForFork1_y=v_fooThread1of2ForFork1_y_4, fooThread1of2ForFork1_i=v_fooThread1of2ForFork1_i_2, ULTIMATE.start_x=v_ULTIMATE.start_x_33, fooThread1of2ForFork1_thidvar0=v_fooThread1of2ForFork1_thidvar0_2} AuxVars[] AssignedVars[fooThread1of2ForFork1_y, fooThread1of2ForFork1_i, fooThread1of2ForFork1_thidvar0]" "[69] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[61] L22-1-->L26: Formula: (<= 2 v_ULTIMATE.start_x_5) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_5} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_5} AuxVars[] AssignedVars[]" "[68] L26-->L27: Formula: (= 1 v_ULTIMATE.start_x_6) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_6} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[78] $Ultimate##0-->fooFINAL: Formula: (= v_fooThread1of2ForFork1_y_1 4) InVars {} OutVars{fooThread1of2ForFork1_y=v_fooThread1of2ForFork1_y_1} AuxVars[] AssignedVars[fooThread1of2ForFork1_y]" "[79] fooFINAL-->fooEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[96] fooEXIT-->L28: Formula: (= v_ULTIMATE.start_x_42 v_fooThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_42, fooThread1of2ForFork1_thidvar0=v_fooThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_42, fooThread1of2ForFork1_thidvar0=v_fooThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[]" "[74] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[]" "[88] L29-->$Ultimate##0: Formula: (and (= v_ULTIMATE.start_x_27 v_fooThread1of2ForFork0_thidvar0_2) (= v_fooThread1of2ForFork0_i_2 v_ULTIMATE.start_x_27)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_27} OutVars{fooThread1of2ForFork0_y=v_fooThread1of2ForFork0_y_4, fooThread1of2ForFork0_i=v_fooThread1of2ForFork0_i_2, ULTIMATE.start_x=v_ULTIMATE.start_x_27, fooThread1of2ForFork0_thidvar0=v_fooThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of2ForFork0_y, fooThread1of2ForFork0_i, fooThread1of2ForFork0_thidvar0]" "[66] L29-1-->L28: Formula: (= (+ 1 v_ULTIMATE.start_x_9) v_ULTIMATE.start_x_8) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_9} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_8} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[74] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[]" "[89] L29-->$Ultimate##0: Formula: (and (= v_fooThread2of2ForFork0_thidvar0_2 v_ULTIMATE.start_x_30) (= v_fooThread2of2ForFork0_i_2 v_ULTIMATE.start_x_30)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_30} OutVars{fooThread2of2ForFork0_thidvar0=v_fooThread2of2ForFork0_thidvar0_2, ULTIMATE.start_x=v_ULTIMATE.start_x_30, fooThread2of2ForFork0_y=v_fooThread2of2ForFork0_y_4, fooThread2of2ForFork0_i=v_fooThread2of2ForFork0_i_2} AuxVars[] AssignedVars[fooThread2of2ForFork0_thidvar0, fooThread2of2ForFork0_y, fooThread2of2ForFork0_i]" "[66] L29-1-->L28: Formula: (= (+ 1 v_ULTIMATE.start_x_9) v_ULTIMATE.start_x_8) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_9} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_8} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[74] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[]" "[86] L29-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:33,279 INFO L754 eck$LassoCheckResult]: Loop: "[87] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:20:33,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash 416094854, now seen corresponding path program 1 times [2025-04-26 16:20:33,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:33,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829786836] [2025-04-26 16:20:33,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:33,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:33,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:20:33,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:20:33,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:33,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:33,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:33,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829786836] [2025-04-26 16:20:33,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829786836] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:33,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:33,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:20:33,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653334166] [2025-04-26 16:20:33,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:33,359 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:33,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:33,359 INFO L85 PathProgramCache]: Analyzing trace with hash 118, now seen corresponding path program 1 times [2025-04-26 16:20:33,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:33,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708634704] [2025-04-26 16:20:33,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:33,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:33,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:33,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:33,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:33,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:33,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:33,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:20:33,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:20:33,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:33,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:33,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:33,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:33,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:20:33,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:20:33,370 INFO L87 Difference]: Start difference. First operand 62 states and 122 transitions. cyclomatic complexity: 69 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (in total 17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:33,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:33,410 INFO L93 Difference]: Finished difference Result 44 states and 71 transitions. [2025-04-26 16:20:33,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 71 transitions. [2025-04-26 16:20:33,410 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:20:33,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2025-04-26 16:20:33,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:20:33,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:20:33,410 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:20:33,410 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:33,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:33,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:33,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:20:33,411 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:33,411 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:20:33,411 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:20:33,411 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:20:33,411 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:20:33,413 INFO L201 PluginConnector]: Adding new model fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:20:33 BoogieIcfgContainer [2025-04-26 16:20:33,413 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:20:33,413 INFO L158 Benchmark]: Toolchain (without parser) took 1234.59ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 87.5MB in the beginning and 81.4MB in the end (delta: 6.1MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2025-04-26 16:20:33,414 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.84ms. Allocated memory is still 159.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:33,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.53ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 85.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:20:33,414 INFO L158 Benchmark]: Boogie Preprocessor took 22.00ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 84.6MB in the end (delta: 962.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:33,414 INFO L158 Benchmark]: RCFGBuilder took 145.19ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 76.1MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:20:33,418 INFO L158 Benchmark]: BuchiAutomizer took 1028.78ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.9MB in the beginning and 81.4MB in the end (delta: -5.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:33,419 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.84ms. Allocated memory is still 159.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.53ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 85.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.00ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 84.6MB in the end (delta: 962.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 145.19ms. Allocated memory is still 159.4MB. Free memory was 84.6MB in the beginning and 76.1MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1028.78ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.9MB in the beginning and 81.4MB in the end (delta: -5.5MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.5s and 2 iterations. TraceHistogramMax:2. Analysis of lassos took 0.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 12 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.3s and 3 iterations. TraceHistogramMax:3. Analysis of lassos took 0.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 31 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN2 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic). 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:20:33,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...