/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/3_thr/indep_loops_minus1_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:58,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:58,800 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:58,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:58,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:58,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:58,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:58,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:58,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:58,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:58,831 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:58,831 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:58,831 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:58,831 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:58,831 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:58,831 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:58,831 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:58,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:58,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:58,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:58,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:58,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:58,833 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:58,833 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:59,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:59,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:59,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:59,062 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:59,064 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:59,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/indep_loops_minus1_3.c.bpl [2025-02-17 22:48:59,065 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/indep_loops_minus1_3.c.bpl' [2025-02-17 22:48:59,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:59,079 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:59,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:59,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:59,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:59,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:59" (1/1) ... [2025-02-17 22:48:59,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:59" (1/1) ... [2025-02-17 22:48:59,096 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:59,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:59,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:59,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:59,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:59,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:59" (1/1) ... [2025-02-17 22:48:59,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:59" (1/1) ... [2025-02-17 22:48:59,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:59" (1/1) ... [2025-02-17 22:48:59,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:59" (1/1) ... [2025-02-17 22:48:59,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:59" (1/1) ... [2025-02-17 22:48:59,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:59" (1/1) ... [2025-02-17 22:48:59,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:59" (1/1) ... [2025-02-17 22:48:59,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:59" (1/1) ... [2025-02-17 22:48:59,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:59" (1/1) ... [2025-02-17 22:48:59,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:59,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:59,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:59,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:59,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:59" (1/1) ... [2025-02-17 22:48:59,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,141 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:59,144 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:59,163 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:59,164 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:59,164 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:59,164 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:59,164 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:59,164 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:59,164 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:48:59,164 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:48:59,164 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:48:59,164 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:59,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:59,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:59,165 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:59,199 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:59,201 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:59,248 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:59,248 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:59,255 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:59,255 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:59,256 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:59 BoogieIcfgContainer [2025-02-17 22:48:59,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:59,256 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:59,256 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:59,264 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:59,264 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:59,264 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:59" (1/2) ... [2025-02-17 22:48:59,265 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26c5ab1a and model type indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:59, skipping insertion in model container [2025-02-17 22:48:59,265 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:59,266 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:59" (2/2) ... [2025-02-17 22:48:59,266 INFO L363 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_3.c.bpl [2025-02-17 22:48:59,326 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-17 22:48:59,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 73 flow [2025-02-17 22:48:59,387 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-02-17 22:48:59,388 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-17 22:48:59,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 3/20 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 31 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-02-17 22:48:59,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 26 transitions, 73 flow [2025-02-17 22:48:59,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 20 transitions, 58 flow [2025-02-17 22:48:59,402 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:59,574 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:59,574 INFO L101 AmpleReduction]: Number of pruned transitions: 65, Number of non-trivial ample sets: 146 [2025-02-17 22:48:59,574 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 135 [2025-02-17 22:48:59,580 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:59,580 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:59,580 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:59,580 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:59,580 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:59,580 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:59,580 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:59,580 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:59,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 2.4153846153846152) internal successors, (314), 130 states have internal predecessors, (314), 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:59,605 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 104 [2025-02-17 22:48:59,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:59,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:59,608 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:48:59,608 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:59,608 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:59,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 2.4153846153846152) internal successors, (314), 130 states have internal predecessors, (314), 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:59,612 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 104 [2025-02-17 22:48:59,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:59,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:59,613 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:48:59,613 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:59,617 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:48:59,617 INFO L754 eck$LassoCheckResult]: Loop: "[50] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[52] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-02-17 22:48:59,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 95, now seen corresponding path program 1 times [2025-02-17 22:48:59,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272322498] [2025-02-17 22:48:59,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:59,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:48:59,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:48:59,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:48:59,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2025-02-17 22:48:59,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205675249] [2025-02-17 22:48:59,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,703 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash 92897, now seen corresponding path program 1 times [2025-02-17 22:48:59,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551932188] [2025-02-17 22:48:59,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:59,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:59,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,757 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,758 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,759 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,759 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,759 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:59,759 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,759 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,759 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,759 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:59,759 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,759 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,805 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,805 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:59,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,810 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:59,813 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:59,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:59,814 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:59,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,838 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:59,839 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:59,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:59,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,912 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:59,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:59,918 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,918 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,918 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,918 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,918 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:59,918 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,918 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,918 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,918 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:59,918 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,918 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,973 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,977 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:59,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,980 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:59,982 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:59,983 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:59,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:59,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:59,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:59,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:59,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:59,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:59,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:00,007 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:00,007 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:00,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,011 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:49:00,012 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:49:00,013 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:00,014 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:00,014 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:00,014 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:49:00,020 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:49:00,023 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:00,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:00,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:00,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,060 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,083 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:49:00,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,084 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,110 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:49:00,129 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:49:00,131 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 131 states, 130 states have (on average 2.4153846153846152) internal successors, (314), 130 states have internal predecessors, (314), 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 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:49:00,277 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 131 states, 130 states have (on average 2.4153846153846152) internal successors, (314), 130 states have internal predecessors, (314), 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 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 417 states and 1127 transitions. Complement of second has 6 states. [2025-02-17 22:49:00,279 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:49:00,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:49:00,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-02-17 22:49:00,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 1 letters. Loop has 2 letters. [2025-02-17 22:49:00,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:00,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-17 22:49:00,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 417 states and 1127 transitions. [2025-02-17 22:49:00,296 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 92 [2025-02-17 22:49:00,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 417 states to 271 states and 757 transitions. [2025-02-17 22:49:00,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2025-02-17 22:49:00,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2025-02-17 22:49:00,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 757 transitions. [2025-02-17 22:49:00,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:00,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 271 states and 757 transitions. [2025-02-17 22:49:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 757 transitions. [2025-02-17 22:49:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 208. [2025-02-17 22:49:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 208 states have (on average 2.8653846153846154) internal successors, (596), 207 states have internal predecessors, (596), 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:49:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 596 transitions. [2025-02-17 22:49:00,346 INFO L240 hiAutomatonCegarLoop]: Abstraction has 208 states and 596 transitions. [2025-02-17 22:49:00,346 INFO L432 stractBuchiCegarLoop]: Abstraction has 208 states and 596 transitions. [2025-02-17 22:49:00,346 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:49:00,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 596 transitions. [2025-02-17 22:49:00,349 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 92 [2025-02-17 22:49:00,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:00,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:00,350 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:00,350 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:49:00,350 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] 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]" [2025-02-17 22:49:00,350 INFO L754 eck$LassoCheckResult]: Loop: "[54] 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[]" "[56] L34-->L35: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[57] L35-->L32: Formula: (= v_x1_5 (+ v_x1_6 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-02-17 22:49:00,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,351 INFO L85 PathProgramCache]: Analyzing trace with hash 3012, now seen corresponding path program 1 times [2025-02-17 22:49:00,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096572972] [2025-02-17 22:49:00,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,364 INFO L85 PathProgramCache]: Analyzing trace with hash 83478, now seen corresponding path program 1 times [2025-02-17 22:49:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233386064] [2025-02-17 22:49:00,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:00,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:00,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,370 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:00,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:00,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,375 INFO L85 PathProgramCache]: Analyzing trace with hash 89784179, now seen corresponding path program 1 times [2025-02-17 22:49:00,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182311531] [2025-02-17 22:49:00,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:00,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:00,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:00,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:00,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,414 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,414 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,414 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,414 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,414 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:00,414 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,414 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,414 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,414 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:00,414 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,414 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,446 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,447 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:00,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,449 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:49:00,451 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:49:00,452 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:00,452 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,470 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:49:00,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,473 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:49:00,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:00,475 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,477 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:49:00,543 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:00,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,549 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,550 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,550 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,550 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,550 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:00,550 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,550 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,550 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,550 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:00,550 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,550 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,585 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,586 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:00,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,588 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:49:00,590 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:49:00,591 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:49:00,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:00,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:00,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:00,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:00,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:00,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:00,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,607 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:00,611 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:00,611 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:00,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,613 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:49:00,614 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:49:00,615 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:00,615 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:00,616 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:00,616 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-02-17 22:49:00,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,622 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:00,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:00,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:00,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,655 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,698 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:49:00,698 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:49:00,699 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 208 states and 596 transitions. cyclomatic complexity: 428 Second operand has 4 states, 4 states have (on average 1.25) 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:49:00,764 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 208 states and 596 transitions. cyclomatic complexity: 428. Second operand has 4 states, 4 states have (on average 1.25) 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 559 states and 1650 transitions. Complement of second has 6 states. [2025-02-17 22:49:00,765 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:49:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) 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:49:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-02-17 22:49:00,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 2 letters. Loop has 3 letters. [2025-02-17 22:49:00,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:49:00,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 2 letters. Loop has 6 letters. [2025-02-17 22:49:00,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 559 states and 1650 transitions. [2025-02-17 22:49:00,773 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 42 [2025-02-17 22:49:00,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 559 states to 324 states and 1020 transitions. [2025-02-17 22:49:00,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2025-02-17 22:49:00,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2025-02-17 22:49:00,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 324 states and 1020 transitions. [2025-02-17 22:49:00,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:00,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 324 states and 1020 transitions. [2025-02-17 22:49:00,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states and 1020 transitions. [2025-02-17 22:49:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 287. [2025-02-17 22:49:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 287 states have (on average 3.2439024390243905) internal successors, (931), 286 states have internal predecessors, (931), 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:49:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 931 transitions. [2025-02-17 22:49:00,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 287 states and 931 transitions. [2025-02-17 22:49:00,791 INFO L432 stractBuchiCegarLoop]: Abstraction has 287 states and 931 transitions. [2025-02-17 22:49:00,791 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:00,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 287 states and 931 transitions. [2025-02-17 22:49:00,792 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 42 [2025-02-17 22:49:00,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:00,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:00,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:49:00,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:00,793 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[50] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[67] 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]" "[70] L13-->L42: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-02-17 22:49:00,793 INFO L754 eck$LassoCheckResult]: Loop: "[59] L42-->L44: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[61] L44-->L42: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-02-17 22:49:00,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2880342, now seen corresponding path program 1 times [2025-02-17 22:49:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954258009] [2025-02-17 22:49:00,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:00,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:00,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:00,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:00,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2025-02-17 22:49:00,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058688601] [2025-02-17 22:49:00,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:00,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:00,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1526956744, now seen corresponding path program 1 times [2025-02-17 22:49:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:00,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418401057] [2025-02-17 22:49:00,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:00,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:00,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:00,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:00,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,820 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:00,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:00,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:00,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:00,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:00,843 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,843 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,843 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,843 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,843 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:00,843 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,843 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,843 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,843 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:00,843 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,843 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,860 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,860 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:00,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,861 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:49:00,863 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:49:00,864 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:00,864 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,883 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:49:00,885 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:49:00,886 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:00,886 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,950 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:00,954 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:49:00,954 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,954 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,954 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,954 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,954 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:00,954 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,954 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,954 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,954 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_3.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:00,954 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,954 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,970 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,970 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:00,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,971 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:49:00,973 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:49:00,975 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:49:00,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:00,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:00,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:00,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:00,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:00,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:00,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,989 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:00,991 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:00,991 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:00,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:01,010 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:49:01,013 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:49:01,013 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:01,013 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:01,014 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:01,014 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:49:01,019 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:49:01,020 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:01,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:01,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:01,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:01,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:01,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:01,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:01,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:01,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:01,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:01,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:01,051 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:01,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:01,065 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:49:01,065 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:49:01,066 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 287 states and 931 transitions. cyclomatic complexity: 693 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:49:01,105 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 287 states and 931 transitions. cyclomatic complexity: 693. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 718 states and 2293 transitions. Complement of second has 6 states. [2025-02-17 22:49:01,105 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:49:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:49:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2025-02-17 22:49:01,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:01,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:01,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:01,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:01,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:49:01,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:01,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 718 states and 2293 transitions. [2025-02-17 22:49:01,112 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:01,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 718 states to 0 states and 0 transitions. [2025-02-17 22:49:01,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:01,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:01,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:01,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:01,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:01,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:01,112 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:01,112 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:01,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:01,112 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:01,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:01,117 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:01 BoogieIcfgContainer [2025-02-17 22:49:01,117 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:01,117 INFO L158 Benchmark]: Toolchain (without parser) took 2038.68ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 87.2MB in the beginning and 50.0MB in the end (delta: 37.2MB). Peak memory consumption was 33.2MB. Max. memory is 8.0GB. [2025-02-17 22:49:01,117 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:01,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.93ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 85.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:01,118 INFO L158 Benchmark]: Boogie Preprocessor took 12.25ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 85.2MB in the end (delta: 652.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:01,118 INFO L158 Benchmark]: RCFGBuilder took 144.39ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 76.7MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:49:01,118 INFO L158 Benchmark]: BuchiAutomizer took 1860.47ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 76.5MB in the beginning and 50.0MB in the end (delta: 26.5MB). Peak memory consumption was 24.8MB. Max. memory is 8.0GB. [2025-02-17 22:49:01,119 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.20ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.93ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 85.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 12.25ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 85.2MB in the end (delta: 652.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 144.39ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 76.7MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1860.47ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 76.5MB in the beginning and 50.0MB in the end (delta: 26.5MB). Peak memory consumption was 24.8MB. 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 * x1 + 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 -1 * x3 + z and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. 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, 100 StatesRemovedByMinimization, 2 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, 91 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123 IncrementalHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 41 mSDtfsCounter, 123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital13 mio100 ax100 hnf100 lsp90 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 36ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 224, Trivial Ample Sets caused by loops: 135, Number of non-trivial ample sets: 146, Number of pruned transitions: 65, Number of transitions in reduction automaton: 314, Number of states in reduction automaton: 131, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:49:01,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:01,327 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:49:01,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...