/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 --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/b4.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:34,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:34,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:48:34,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:34,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:34,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:34,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:34,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:34,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:34,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:34,370 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:34,370 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:34,370 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:34,370 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:34,370 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:34,370 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:34,370 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:34,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:34,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:34,370 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:34,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:34,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:34,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:34,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:34,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:34,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:34,371 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:34,371 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:34,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:34,371 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:34,371 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:34,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:34,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:34,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:34,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:34,371 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:34,372 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:48:34,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:34,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:34,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:34,598 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:34,598 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:34,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/b4.c.bpl [2025-02-17 22:48:34,599 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/b4.c.bpl' [2025-02-17 22:48:34,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:34,616 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:34,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:34,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:34,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:34,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,633 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:34,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:34,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:34,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:34,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:34,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,641 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:34,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:34,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:34,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:34,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/1) ... [2025-02-17 22:48:34,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:34,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:34,671 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-02-17 22:48:34,673 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-02-17 22:48:34,694 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:34,695 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:34,695 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:34,695 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:34,695 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:34,695 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:34,695 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:34,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:34,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:34,700 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:48:34,733 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:34,734 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:34,793 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:34,793 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:34,802 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:34,802 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:34,803 INFO L201 PluginConnector]: Adding new model b4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:34 BoogieIcfgContainer [2025-02-17 22:48:34,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:34,803 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:34,803 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:34,808 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:34,809 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:34,809 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "b4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:34" (1/2) ... [2025-02-17 22:48:34,811 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38dae299 and model type b4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:34, skipping insertion in model container [2025-02-17 22:48:34,811 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:34,811 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "b4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:34" (2/2) ... [2025-02-17 22:48:34,812 INFO L363 chiAutomizerObserver]: Analyzing ICFG b4.c.bpl [2025-02-17 22:48:34,867 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:48:34,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 52 flow [2025-02-17 22:48:34,936 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2025-02-17 22:48:34,939 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:48:34,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 15 events. 2/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 22 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-02-17 22:48:34,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 19 transitions, 52 flow [2025-02-17 22:48:34,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 15 transitions, 42 flow [2025-02-17 22:48:34,951 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:35,014 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:35,014 INFO L101 AmpleReduction]: Number of pruned transitions: 14, Number of non-trivial ample sets: 20 [2025-02-17 22:48:35,014 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 19 [2025-02-17 22:48:35,020 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:35,020 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:35,020 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:35,020 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:35,020 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:35,020 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:35,020 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:35,020 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:35,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:35,030 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 26 [2025-02-17 22:48:35,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:35,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:35,033 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:48:35,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:48:35,033 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:35,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:35,035 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 26 [2025-02-17 22:48:35,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:35,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:35,035 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:48:35,035 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-02-17 22:48:35,038 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:48:35,039 INFO L754 eck$LassoCheckResult]: Loop: "[37] L21-->L23: Formula: (< (+ v_x4_1 v_x3_1 v_x1_1) v_z_1) InVars {x1=v_x1_1, x4=v_x4_1, x3=v_x3_1, z=v_z_1} OutVars{x1=v_x1_1, x4=v_x4_1, x3=v_x3_1, z=v_z_1} AuxVars[] AssignedVars[]" "[39] L23-->L24: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[40] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[41] L25-->L21: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-02-17 22:48:35,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash 79, now seen corresponding path program 1 times [2025-02-17 22:48:35,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057505877] [2025-02-17 22:48:35,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:35,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:48:35,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:35,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:48:35,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2064548, now seen corresponding path program 1 times [2025-02-17 22:48:35,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870304786] [2025-02-17 22:48:35,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:35,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:35,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,127 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:35,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:35,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,137 INFO L85 PathProgramCache]: Analyzing trace with hash 74099186, now seen corresponding path program 1 times [2025-02-17 22:48:35,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128996942] [2025-02-17 22:48:35,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:35,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:35,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,146 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:35,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:35,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,250 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:35,251 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:35,251 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:35,251 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:35,251 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:35,252 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,253 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:35,253 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:35,253 INFO L132 ssoRankerPreferences]: Filename of dumped script: b4.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:35,253 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:35,254 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:35,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,333 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:35,334 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:35,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,337 INFO L229 MonitoredProcess]: Starting monitored process 2 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-02-17 22:48:35,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:48:35,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:35,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:35,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:48:35,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,369 INFO L229 MonitoredProcess]: Starting monitored process 3 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-02-17 22:48:35,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-17 22:48:35,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:35,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:35,526 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:35,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-17 22:48:35,532 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:35,532 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:35,532 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:35,532 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:35,532 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:35,532 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,532 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:35,533 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:35,533 INFO L132 ssoRankerPreferences]: Filename of dumped script: b4.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:35,533 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:35,533 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:35,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:35,589 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:35,592 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:35,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,595 INFO L229 MonitoredProcess]: Starting monitored process 4 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-02-17 22:48:35,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-17 22:48:35,597 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:35,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:35,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:35,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:35,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:35,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:35,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:35,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:35,618 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:35,624 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-02-17 22:48:35,625 INFO L444 ModelExtractionUtils]: 0 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:35,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:35,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:35,628 INFO L229 MonitoredProcess]: Starting monitored process 5 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-02-17 22:48:35,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-17 22:48:35,632 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:35,632 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:35,632 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:35,633 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, x1, z, x4) = -1*x3 - 1*x1 + 1*z - 1*x4 Supporting invariants [] [2025-02-17 22:48:35,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:35,644 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:35,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:48:35,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:35,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:48:35,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:35,699 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:35,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:35,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:35,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:35,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:35,711 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-17 22:48:35,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:35,854 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-02-17 22:48:35,855 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:35,925 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 84 states and 139 transitions. Complement of second has 6 states. [2025-02-17 22:48:35,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2025-02-17 22:48:35,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-17 22:48:35,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:35,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:48:35,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:35,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 1 letters. Loop has 8 letters. [2025-02-17 22:48:35,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:35,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 139 transitions. [2025-02-17 22:48:35,939 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-02-17 22:48:35,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 38 states and 68 transitions. [2025-02-17 22:48:35,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-02-17 22:48:35,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-02-17 22:48:35,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 68 transitions. [2025-02-17 22:48:35,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:35,943 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 68 transitions. [2025-02-17 22:48:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 68 transitions. [2025-02-17 22:48:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-02-17 22:48:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.84375) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2025-02-17 22:48:35,962 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 59 transitions. [2025-02-17 22:48:35,963 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 59 transitions. [2025-02-17 22:48:35,964 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:35,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 59 transitions. [2025-02-17 22:48:35,965 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-02-17 22:48:35,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:35,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:35,965 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:35,965 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:35,966 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[51] L12-->L32: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[36] L21-->thread1FINAL: Formula: (<= v_z_2 (+ v_x4_4 v_x3_4 v_x1_4)) InVars {x1=v_x1_4, x4=v_x4_4, x3=v_x3_4, z=v_z_2} OutVars{x1=v_x1_4, x4=v_x4_4, x3=v_x3_4, z=v_z_2} AuxVars[] AssignedVars[]" [2025-02-17 22:48:35,966 INFO L754 eck$LassoCheckResult]: Loop: "[43] L32-->L34: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[45] L34-->L32: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:35,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash 77536, now seen corresponding path program 1 times [2025-02-17 22:48:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208302485] [2025-02-17 22:48:35,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:35,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:35,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 1 times [2025-02-17 22:48:35,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346151688] [2025-02-17 22:48:35,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:35,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:35,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,983 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:35,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:35,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:35,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:35,986 INFO L85 PathProgramCache]: Analyzing trace with hash 74513474, now seen corresponding path program 1 times [2025-02-17 22:48:35,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:35,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287052982] [2025-02-17 22:48:35,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:35,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:35,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:35,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:35,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:35,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:35,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:35,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:35,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:35,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,015 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:36,016 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:36,016 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:36,016 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:36,016 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:36,016 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,016 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:36,016 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:36,016 INFO L132 ssoRankerPreferences]: Filename of dumped script: b4.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:36,016 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:36,016 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:36,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,036 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:36,036 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:36,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,039 INFO L229 MonitoredProcess]: Starting monitored process 6 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-02-17 22:48:36,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-17 22:48:36,041 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:36,041 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:36,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,060 INFO L229 MonitoredProcess]: Starting monitored process 7 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-02-17 22:48:36,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-17 22:48:36,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:36,064 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,129 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:36,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:48:36,133 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:36,133 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:36,133 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:36,133 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:36,133 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:36,133 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,133 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:36,133 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:36,133 INFO L132 ssoRankerPreferences]: Filename of dumped script: b4.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:36,133 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:36,134 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:36,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,147 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:36,148 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:36,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,149 INFO L229 MonitoredProcess]: Starting monitored process 8 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-02-17 22:48:36,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-17 22:48:36,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:36,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:36,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:36,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:36,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:36,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:36,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:36,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:36,164 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:36,166 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:36,167 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:36,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,169 INFO L229 MonitoredProcess]: Starting monitored process 9 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-02-17 22:48:36,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-17 22:48:36,170 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:36,170 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:36,170 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:36,170 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:48:36,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:48:36,176 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:36,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:36,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:36,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:36,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:36,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:36,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:36,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,204 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:36,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:36,222 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:36,222 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 59 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,250 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 59 transitions. cyclomatic complexity: 33. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 97 transitions. Complement of second has 6 states. [2025-02-17 22:48:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-02-17 22:48:36,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:48:36,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:48:36,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:48:36,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 97 transitions. [2025-02-17 22:48:36,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-17 22:48:36,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 18 states and 30 transitions. [2025-02-17 22:48:36,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-02-17 22:48:36,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-02-17 22:48:36,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 30 transitions. [2025-02-17 22:48:36,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:36,255 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 30 transitions. [2025-02-17 22:48:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 30 transitions. [2025-02-17 22:48:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-17 22:48:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2025-02-17 22:48:36,257 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 30 transitions. [2025-02-17 22:48:36,257 INFO L432 stractBuchiCegarLoop]: Abstraction has 18 states and 30 transitions. [2025-02-17 22:48:36,257 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:48:36,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 30 transitions. [2025-02-17 22:48:36,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-02-17 22:48:36,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:36,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:36,258 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:36,258 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:36,260 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[51] L12-->L32: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[37] L21-->L23: Formula: (< (+ v_x4_1 v_x3_1 v_x1_1) v_z_1) InVars {x1=v_x1_1, x4=v_x4_1, x3=v_x3_1, z=v_z_1} OutVars{x1=v_x1_1, x4=v_x4_1, x3=v_x3_1, z=v_z_1} AuxVars[] AssignedVars[]" "[39] L23-->L24: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[43] L32-->L34: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" [2025-02-17 22:48:36,260 INFO L754 eck$LassoCheckResult]: Loop: "[45] L34-->L32: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[43] L32-->L34: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" [2025-02-17 22:48:36,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,260 INFO L85 PathProgramCache]: Analyzing trace with hash 74514309, now seen corresponding path program 1 times [2025-02-17 22:48:36,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791146945] [2025-02-17 22:48:36,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:36,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:36,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:36,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:36,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2399, now seen corresponding path program 2 times [2025-02-17 22:48:36,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807800959] [2025-02-17 22:48:36,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:48:36,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:36,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:36,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:48:36,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:36,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:36,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1406191645, now seen corresponding path program 1 times [2025-02-17 22:48:36,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:36,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793279001] [2025-02-17 22:48:36,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:36,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:36,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:36,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:36,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:36,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:36,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:36,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:36,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:36,298 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:36,298 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:36,298 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:36,298 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:36,298 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:36,298 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,298 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:36,298 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:36,299 INFO L132 ssoRankerPreferences]: Filename of dumped script: b4.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:36,299 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:36,299 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:36,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,315 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:36,315 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:36,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,317 INFO L229 MonitoredProcess]: Starting monitored process 10 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-02-17 22:48:36,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-17 22:48:36,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:36,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:48:36,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,337 INFO L229 MonitoredProcess]: Starting monitored process 11 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-02-17 22:48:36,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-17 22:48:36,339 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:36,339 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:36,426 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:36,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-17 22:48:36,430 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:36,430 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:36,430 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:36,430 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:36,431 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:36,431 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,431 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:36,431 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:36,431 INFO L132 ssoRankerPreferences]: Filename of dumped script: b4.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:36,431 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:36,431 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:36,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:36,449 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:36,449 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:36,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,451 INFO L229 MonitoredProcess]: Starting monitored process 12 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-02-17 22:48:36,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-17 22:48:36,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:48:36,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:36,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:36,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:36,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:36,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:36,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:36,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:36,468 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:36,471 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:36,471 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:36,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:36,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:36,570 INFO L229 MonitoredProcess]: Starting monitored process 13 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-02-17 22:48:36,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-17 22:48:36,573 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:36,573 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:36,573 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:36,573 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:48:36,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:48:36,580 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:36,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:36,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:36,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:36,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:36,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:36,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:36,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:36,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:36,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:36,614 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:36,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:36,623 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:48:36,623 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 30 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,644 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 30 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 56 transitions. Complement of second has 6 states. [2025-02-17 22:48:36,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:48:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2025-02-17 22:48:36,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:48:36,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:48:36,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:48:36,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:36,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 56 transitions. [2025-02-17 22:48:36,646 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:36,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2025-02-17 22:48:36,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:48:36,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:48:36,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:48:36,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:48:36,646 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:36,646 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:36,646 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:36,646 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:48:36,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:48:36,647 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:36,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:48:36,651 INFO L201 PluginConnector]: Adding new model b4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:48:36 BoogieIcfgContainer [2025-02-17 22:48:36,651 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:48:36,652 INFO L158 Benchmark]: Toolchain (without parser) took 2036.38ms. Allocated memory is still 125.8MB. Free memory was 61.8MB in the beginning and 50.0MB in the end (delta: 11.9MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2025-02-17 22:48:36,652 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:36,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.35ms. Allocated memory is still 125.8MB. Free memory was 61.8MB in the beginning and 60.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:36,652 INFO L158 Benchmark]: Boogie Preprocessor took 9.19ms. Allocated memory is still 125.8MB. Free memory was 60.5MB in the beginning and 60.0MB in the end (delta: 509.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:36,653 INFO L158 Benchmark]: RCFGBuilder took 158.09ms. Allocated memory is still 125.8MB. Free memory was 59.8MB in the beginning and 51.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:48:36,653 INFO L158 Benchmark]: BuchiAutomizer took 1848.11ms. Allocated memory is still 125.8MB. Free memory was 51.3MB in the beginning and 50.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.9MB. Max. memory is 8.0GB. [2025-02-17 22:48:36,654 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.15ms. Allocated memory is still 125.8MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.35ms. Allocated memory is still 125.8MB. Free memory was 61.8MB in the beginning and 60.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 9.19ms. Allocated memory is still 125.8MB. Free memory was 60.5MB in the beginning and 60.0MB in the end (delta: 509.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 158.09ms. Allocated memory is still 125.8MB. Free memory was 59.8MB in the beginning and 51.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1848.11ms. Allocated memory is still 125.8MB. Free memory was 51.3MB in the beginning and 50.0MB in the end (delta: 1.3MB). Peak memory consumption was 1.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + -1 * x1 + -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 26 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf93 smp100 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 39ms VariablesStem: 0 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 121, Trivial Ample Sets caused by loops: 19, Number of non-trivial ample sets: 20, Number of pruned transitions: 14, Number of transitions in reduction automaton: 57, Number of states in reduction automaton: 37, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:48:36,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:48:36,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-17 22:48:37,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...