/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/4_plus_thr/indep_loops_4.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:49:10,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:49:10,968 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:49:10,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:49:10,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:49:10,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:49:10,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:49:10,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:49:10,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:49:10,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:49:10,993 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:49:10,993 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:49:10,994 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:49:10,994 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:49:10,994 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:49:10,994 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:49:10,994 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:49:10,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:49:10,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:49:10,994 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:49:10,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:49:10,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:49:10,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:49:10,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:49:10,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:49:10,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:49:10,996 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:49:10,996 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:49:10,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:49:10,996 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:49:10,997 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:49:10,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:49:10,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:49:10,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:49:10,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:49:10,997 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:49:10,997 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:49:11,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:49:11,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:49:11,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:49:11,256 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:49:11,257 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:49:11,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_4.c.bpl [2025-02-17 22:49:11,259 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_4.c.bpl' [2025-02-17 22:49:11,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:49:11,275 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:49:11,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:11,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:49:11,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:49:11,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,292 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:49:11,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:11,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:49:11,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:49:11,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:49:11,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:49:11,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:49:11,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:49:11,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:49:11,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:11,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:11,337 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:49:11,342 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:49:11,359 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:49:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:49:11,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:49:11,360 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:49:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:49:11,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:49:11,360 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:49:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:49:11,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:49:11,360 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:49:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:49:11,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:49:11,360 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-02-17 22:49:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-17 22:49:11,360 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-17 22:49:11,361 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:49:11,397 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:49:11,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:49:11,472 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:49:11,472 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:49:11,481 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:49:11,481 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:49:11,483 INFO L201 PluginConnector]: Adding new model indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:11 BoogieIcfgContainer [2025-02-17 22:49:11,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:49:11,484 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:49:11,484 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:49:11,488 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:49:11,489 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:11,489 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/2) ... [2025-02-17 22:49:11,490 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2240967c and model type indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:49:11, skipping insertion in model container [2025-02-17 22:49:11,490 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:11,490 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:11" (2/2) ... [2025-02-17 22:49:11,491 INFO L363 chiAutomizerObserver]: Analyzing ICFG indep_loops_4.c.bpl [2025-02-17 22:49:11,554 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-17 22:49:11,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 94 flow [2025-02-17 22:49:11,617 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-02-17 22:49:11,620 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-17 22:49:11,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 25 events. 4/25 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 53 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-02-17 22:49:11,625 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 94 flow [2025-02-17 22:49:11,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 25 transitions, 74 flow [2025-02-17 22:49:11,636 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:49:12,032 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:49:12,035 INFO L101 AmpleReduction]: Number of pruned transitions: 215, Number of non-trivial ample sets: 713 [2025-02-17 22:49:12,035 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 682 [2025-02-17 22:49:12,044 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:49:12,044 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:49:12,044 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:49:12,044 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:49:12,044 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:49:12,045 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:49:12,045 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:49:12,045 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:49:12,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 427 states, 426 states have (on average 3.3708920187793425) internal successors, (1436), 426 states have internal predecessors, (1436), 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:12,084 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-02-17 22:49:12,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:12,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:12,088 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:49:12,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:12,089 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:49:12,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 427 states, 426 states have (on average 3.3708920187793425) internal successors, (1436), 426 states have internal predecessors, (1436), 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:12,107 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-02-17 22:49:12,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:12,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:12,108 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:49:12,108 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:12,112 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:49:12,113 INFO L754 eck$LassoCheckResult]: Loop: "[63] L25-->L27: 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[]" "[65] L27-->L25: 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:49:12,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:12,117 INFO L85 PathProgramCache]: Analyzing trace with hash 111, now seen corresponding path program 1 times [2025-02-17 22:49:12,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:12,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569812164] [2025-02-17 22:49:12,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:12,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:12,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:12,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:12,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:12,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:12,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:12,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:12,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:12,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2025-02-17 22:49:12,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:12,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198529143] [2025-02-17 22:49:12,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:12,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:12,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:12,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:12,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:12,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:12,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:12,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:12,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash 108689, now seen corresponding path program 1 times [2025-02-17 22:49:12,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:12,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293893722] [2025-02-17 22:49:12,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:12,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:12,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:12,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:12,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:12,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:12,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:12,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:12,249 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:12,250 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:12,250 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:12,251 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:12,251 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:12,252 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:12,252 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:12,252 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:12,252 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:12,252 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:12,252 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:12,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:12,301 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:12,302 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:12,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:12,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:12,305 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:49:12,308 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:49:12,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:12,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:12,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:49:12,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:12,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:12,337 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:49:12,338 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:49:12,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:12,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:12,415 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:12,420 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:49:12,421 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:12,421 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:12,421 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:12,421 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:12,421 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:12,421 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:12,421 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:12,421 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:12,421 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:12,421 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:12,421 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:12,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:12,448 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:12,451 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:12,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:12,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:12,455 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:49:12,458 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:49:12,458 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:12,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:12,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:12,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:12,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:12,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:12,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:12,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:12,481 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:12,487 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:12,488 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:12,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:12,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:12,491 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:12,493 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:12,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:12,495 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:12,495 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:12,496 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:49:12,502 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:12,504 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:12,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:12,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:12,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:12,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:12,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:12,568 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:12,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:12,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:12,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:12,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:12,578 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:12,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:12,603 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:12,655 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:12,672 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 427 states, 426 states have (on average 3.3708920187793425) internal successors, (1436), 426 states have internal predecessors, (1436), 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:12,829 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 427 states, 426 states have (on average 3.3708920187793425) internal successors, (1436), 426 states have internal predecessors, (1436), 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 1189 states and 4504 transitions. Complement of second has 6 states. [2025-02-17 22:49:12,831 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:12,835 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:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-02-17 22:49:12,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 1 letters. Loop has 2 letters. [2025-02-17 22:49:12,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:12,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:12,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:12,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-17 22:49:12,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:12,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1189 states and 4504 transitions. [2025-02-17 22:49:12,869 INFO L131 ngComponentsAnalysis]: Automaton has 113 accepting balls. 321 [2025-02-17 22:49:12,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1189 states to 780 states and 3060 transitions. [2025-02-17 22:49:12,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 349 [2025-02-17 22:49:12,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 550 [2025-02-17 22:49:12,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 780 states and 3060 transitions. [2025-02-17 22:49:12,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:12,892 INFO L218 hiAutomatonCegarLoop]: Abstraction has 780 states and 3060 transitions. [2025-02-17 22:49:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states and 3060 transitions. [2025-02-17 22:49:12,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 580. [2025-02-17 22:49:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 580 states have (on average 4.0344827586206895) internal successors, (2340), 579 states have internal predecessors, (2340), 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:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 2340 transitions. [2025-02-17 22:49:12,958 INFO L240 hiAutomatonCegarLoop]: Abstraction has 580 states and 2340 transitions. [2025-02-17 22:49:12,958 INFO L432 stractBuchiCegarLoop]: Abstraction has 580 states and 2340 transitions. [2025-02-17 22:49:12,959 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:49:12,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 580 states and 2340 transitions. [2025-02-17 22:49:12,963 INFO L131 ngComponentsAnalysis]: Automaton has 113 accepting balls. 321 [2025-02-17 22:49:12,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:12,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:12,964 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:12,964 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:12,964 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[83] L12-->L34: 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:12,965 INFO L754 eck$LassoCheckResult]: Loop: "[67] L34-->L36: 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[]" "[69] L36-->L34: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:12,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:12,966 INFO L85 PathProgramCache]: Analyzing trace with hash 3524, now seen corresponding path program 1 times [2025-02-17 22:49:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:12,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024863656] [2025-02-17 22:49:12,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:12,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:12,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:12,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:12,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:12,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:12,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:12,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:12,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash 3107, now seen corresponding path program 1 times [2025-02-17 22:49:12,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:12,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382670893] [2025-02-17 22:49:12,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:12,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:12,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:12,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:12,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,985 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:12,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:12,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:12,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:12,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:12,990 INFO L85 PathProgramCache]: Analyzing trace with hash 3388710, now seen corresponding path program 1 times [2025-02-17 22:49:12,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:12,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284411549] [2025-02-17 22:49:12,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:12,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:12,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:12,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:12,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:13,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:13,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:13,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:13,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:13,032 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:13,032 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:13,032 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:13,032 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:13,032 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:13,032 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,032 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:13,032 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:13,032 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:13,032 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:13,032 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:13,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:13,057 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:13,057 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:13,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:13,060 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:13,061 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:13,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:13,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:13,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:49:13,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:13,085 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:13,086 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:13,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:13,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:13,152 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:13,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:49:13,157 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:13,157 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:13,157 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:13,157 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:13,157 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:13,157 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,157 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:13,157 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:13,157 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:13,157 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:13,157 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:13,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:13,181 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:13,181 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:13,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:13,183 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:13,185 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:13,186 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:13,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:13,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:13,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:13,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:13,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:13,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:13,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:13,199 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:13,203 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:13,203 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:13,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:13,205 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:13,207 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:13,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:13,208 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:13,208 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:13,208 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-02-17 22:49:13,214 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:13,215 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:13,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:13,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:13,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:13,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:13,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:13,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:13,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:13,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:13,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:13,245 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:13,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:13,260 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:13,260 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:13,261 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 580 states and 2340 transitions. cyclomatic complexity: 1905 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:13,369 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 580 states and 2340 transitions. cyclomatic complexity: 1905. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 1755 states and 7333 transitions. Complement of second has 6 states. [2025-02-17 22:49:13,370 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:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-02-17 22:49:13,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:49:13,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:13,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:13,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:13,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:49:13,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:13,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1755 states and 7333 transitions. [2025-02-17 22:49:13,392 INFO L131 ngComponentsAnalysis]: Automaton has 97 accepting balls. 231 [2025-02-17 22:49:13,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1755 states to 1182 states and 4978 transitions. [2025-02-17 22:49:13,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 411 [2025-02-17 22:49:13,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 618 [2025-02-17 22:49:13,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1182 states and 4978 transitions. [2025-02-17 22:49:13,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:13,412 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1182 states and 4978 transitions. [2025-02-17 22:49:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states and 4978 transitions. [2025-02-17 22:49:13,472 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:13,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 975. [2025-02-17 22:49:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 975 states have (on average 4.397948717948718) internal successors, (4288), 974 states have internal predecessors, (4288), 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:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 4288 transitions. [2025-02-17 22:49:13,486 INFO L240 hiAutomatonCegarLoop]: Abstraction has 975 states and 4288 transitions. [2025-02-17 22:49:13,486 INFO L432 stractBuchiCegarLoop]: Abstraction has 975 states and 4288 transitions. [2025-02-17 22:49:13,486 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:13,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 975 states and 4288 transitions. [2025-02-17 22:49:13,494 INFO L131 ngComponentsAnalysis]: Automaton has 97 accepting balls. 231 [2025-02-17 22:49:13,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:13,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:13,494 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:49:13,494 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:13,495 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[83] L12-->L34: 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]" "[86] L13-->L43: 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:13,495 INFO L754 eck$LassoCheckResult]: Loop: "[71] L43-->L45: 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[]" "[73] L45-->L43: 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:13,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:13,495 INFO L85 PathProgramCache]: Analyzing trace with hash 109330, now seen corresponding path program 1 times [2025-02-17 22:49:13,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:13,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300080203] [2025-02-17 22:49:13,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:13,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:13,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:13,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:13,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:13,499 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:13,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:13,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:13,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:13,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:13,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:13,501 INFO L85 PathProgramCache]: Analyzing trace with hash 3235, now seen corresponding path program 1 times [2025-02-17 22:49:13,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:13,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795973725] [2025-02-17 22:49:13,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:13,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:13,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:13,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:13,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:13,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:13,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:13,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:13,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:13,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:13,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash 105068404, now seen corresponding path program 1 times [2025-02-17 22:49:13,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:13,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56857527] [2025-02-17 22:49:13,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:13,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:13,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:13,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:13,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:13,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:13,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:13,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:13,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:13,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:13,543 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:13,543 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:13,543 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:13,543 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:13,543 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:13,544 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,544 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:13,544 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:13,544 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:13,544 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:13,544 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:13,544 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:13,560 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:13,561 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:13,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:13,565 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:13,567 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:13,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:13,568 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:13,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:49:13,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:13,588 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:13,589 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:13,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:13,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:13,658 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:13,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:13,663 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:13,663 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:13,663 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:13,663 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:13,663 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:13,663 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,663 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:13,664 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:13,664 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:13,664 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:13,664 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:13,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:13,689 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:13,689 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:13,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:13,691 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:13,693 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:13,694 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:13,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:13,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:13,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:13,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:13,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:13,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:13,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:13,707 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:13,709 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:13,709 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:13,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:13,711 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:13,712 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:13,713 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:13,713 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:13,713 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:13,713 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-02-17 22:49:13,719 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:13,720 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:13,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:13,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:13,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:13,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:13,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:13,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:13,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:13,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:13,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:13,746 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:13,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:13,759 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:13,760 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:13,760 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 975 states and 4288 transitions. cyclomatic complexity: 3495 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:13,855 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 975 states and 4288 transitions. cyclomatic complexity: 3495. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2952 states and 13125 transitions. Complement of second has 6 states. [2025-02-17 22:49:13,856 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:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-02-17 22:49:13,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:13,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:13,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:13,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:13,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:49:13,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:13,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2952 states and 13125 transitions. [2025-02-17 22:49:13,892 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 122 [2025-02-17 22:49:13,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2952 states to 1650 states and 7421 transitions. [2025-02-17 22:49:13,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 473 [2025-02-17 22:49:13,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 616 [2025-02-17 22:49:13,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1650 states and 7421 transitions. [2025-02-17 22:49:13,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:13,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1650 states and 7421 transitions. [2025-02-17 22:49:13,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:49:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states and 7421 transitions. [2025-02-17 22:49:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1427. [2025-02-17 22:49:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1427 states have (on average 4.65031534688157) internal successors, (6636), 1426 states have internal predecessors, (6636), 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:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 6636 transitions. [2025-02-17 22:49:13,988 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1427 states and 6636 transitions. [2025-02-17 22:49:13,988 INFO L432 stractBuchiCegarLoop]: Abstraction has 1427 states and 6636 transitions. [2025-02-17 22:49:13,988 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:13,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1427 states and 6636 transitions. [2025-02-17 22:49:13,997 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 122 [2025-02-17 22:49:13,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:13,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:13,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:49:13,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:13,998 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[83] L12-->L34: 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]" "[86] L13-->L43: 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]" "[89] L14-->L52: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-02-17 22:49:13,998 INFO L754 eck$LassoCheckResult]: Loop: "[75] L52-->L54: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[77] L54-->L52: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-02-17 22:49:13,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:13,999 INFO L85 PathProgramCache]: Analyzing trace with hash 3389319, now seen corresponding path program 1 times [2025-02-17 22:49:13,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:13,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061366478] [2025-02-17 22:49:13,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:13,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:14,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:14,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:14,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:14,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:14,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:14,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:14,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,011 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2025-02-17 22:49:14,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:14,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849111028] [2025-02-17 22:49:14,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:14,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:14,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,017 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:14,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:14,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1037829335, now seen corresponding path program 1 times [2025-02-17 22:49:14,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:14,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202812601] [2025-02-17 22:49:14,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:14,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:14,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:14,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:14,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:14,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:14,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:14,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:14,054 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:14,055 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:14,055 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:14,055 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:14,055 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:14,055 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,055 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:14,055 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:14,055 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:14,055 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:14,055 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:14,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:14,074 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:14,074 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:14,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,076 INFO L229 MonitoredProcess]: Starting monitored process 14 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:14,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-17 22:49:14,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:14,079 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:14,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:14,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,099 INFO L229 MonitoredProcess]: Starting monitored process 15 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:14,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-17 22:49:14,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:14,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:14,173 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:14,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:14,178 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:14,178 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:14,179 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:14,179 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:14,179 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:14,179 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,179 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:14,179 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:14,179 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:14,179 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:14,179 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:14,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:14,198 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:14,198 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:14,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,201 INFO L229 MonitoredProcess]: Starting monitored process 16 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:14,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-17 22:49:14,204 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:14,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:14,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:14,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:14,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:14,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:14,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:14,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:14,218 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:14,221 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:14,221 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:14,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,223 INFO L229 MonitoredProcess]: Starting monitored process 17 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:14,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-17 22:49:14,225 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:14,225 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:14,226 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:14,226 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-02-17 22:49:14,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:14,232 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:14,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:14,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:14,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:14,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:14,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:14,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:14,269 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:14,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:14,285 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:14,285 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:14,285 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1427 states and 6636 transitions. cyclomatic complexity: 5416 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:14,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-17 22:49:14,410 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1427 states and 6636 transitions. cyclomatic complexity: 5416. 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 3585 states and 16280 transitions. Complement of second has 6 states. [2025-02-17 22:49:14,410 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:14,411 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:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-02-17 22:49:14,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:14,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:14,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:14,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:14,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:49:14,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:14,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3585 states and 16280 transitions. [2025-02-17 22:49:14,448 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:14,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3585 states to 0 states and 0 transitions. [2025-02-17 22:49:14,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:14,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:14,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:14,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:14,449 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:14,449 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:14,449 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:14,449 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:14,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:14,449 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:14,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:14,457 INFO L201 PluginConnector]: Adding new model indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:14 BoogieIcfgContainer [2025-02-17 22:49:14,457 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:14,459 INFO L158 Benchmark]: Toolchain (without parser) took 3182.91ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.0MB in the beginning and 61.5MB in the end (delta: 24.5MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2025-02-17 22:49:14,459 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:14,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.94ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:14,459 INFO L158 Benchmark]: Boogie Preprocessor took 13.08ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 84.0MB in the end (delta: 749.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:14,459 INFO L158 Benchmark]: RCFGBuilder took 174.79ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 75.1MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:49:14,459 INFO L158 Benchmark]: BuchiAutomizer took 2972.81ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.0MB in the beginning and 61.5MB in the end (delta: 13.5MB). Peak memory consumption was 811.0kB. Max. memory is 8.0GB. [2025-02-17 22:49:14,460 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.16ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.94ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 13.08ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 84.0MB in the end (delta: 749.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 174.79ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 75.1MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2972.81ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 75.0MB in the beginning and 61.5MB in the end (delta: 13.5MB). Peak memory consumption was 811.0kB. 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 4 terminating modules (0 trivial, 4 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. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 630 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 232 IncrementalHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 76 mSDtfsCounter, 232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 42ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 458, Trivial Ample Sets caused by loops: 682, Number of non-trivial ample sets: 713, Number of pruned transitions: 215, Number of transitions in reduction automaton: 1436, Number of states in reduction automaton: 427, 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:14,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...