/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/indep_loops_6.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:49,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:49,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:24:49,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:49,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:49,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:49,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:49,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:49,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:49,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:49,209 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:49,209 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:49,209 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:49,209 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:49,210 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:49,210 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:49,210 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:49,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:49,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:49,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:49,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:49,212 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:49,212 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:49,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:49,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:49,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:49,466 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:49,466 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:49,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_6.c.bpl [2025-04-26 16:24:49,468 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_6.c.bpl' [2025-04-26 16:24:49,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:49,486 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:49,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:49,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:49,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:49,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:49" (1/1) ... [2025-04-26 16:24:49,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:49" (1/1) ... [2025-04-26 16:24:49,512 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:49,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:49,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:49,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:49,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:49,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:49" (1/1) ... [2025-04-26 16:24:49,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:49" (1/1) ... [2025-04-26 16:24:49,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:49" (1/1) ... [2025-04-26 16:24:49,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:49" (1/1) ... [2025-04-26 16:24:49,522 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:49" (1/1) ... [2025-04-26 16:24:49,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:49" (1/1) ... [2025-04-26 16:24:49,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:49" (1/1) ... [2025-04-26 16:24:49,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:49" (1/1) ... [2025-04-26 16:24:49,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:49" (1/1) ... [2025-04-26 16:24:49,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:49,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:49,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:49,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:49,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:49" (1/1) ... [2025-04-26 16:24:49,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:49,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:49,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:49,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:24:49,589 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:49,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:49,589 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:49,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:49,590 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:24:49,590 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:24:49,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:24:49,590 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:49,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:49,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:49,590 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:24:49,590 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:24:49,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:24:49,590 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:24:49,590 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:24:49,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:24:49,590 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:24:49,590 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:24:49,590 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:24:49,591 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:24:49,625 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:49,627 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:49,715 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:49,716 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:49,727 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:49,728 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:49,729 INFO L201 PluginConnector]: Adding new model indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:49 BoogieIcfgContainer [2025-04-26 16:24:49,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:49,730 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:49,730 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:49,735 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:49,735 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:49,735 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:49" (1/2) ... [2025-04-26 16:24:49,737 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@154015bd and model type indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:49, skipping insertion in model container [2025-04-26 16:24:49,737 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:49,737 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:49" (2/2) ... [2025-04-26 16:24:49,738 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_6.c.bpl [2025-04-26 16:24:49,807 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:24:49,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 140 flow [2025-04-26 16:24:49,856 INFO L116 PetriNetUnfolderBase]: 6/37 cut-off events. [2025-04-26 16:24:49,858 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:24:49,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 37 events. 6/37 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-04-26 16:24:49,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 49 transitions, 140 flow [2025-04-26 16:24:49,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 37 transitions, 110 flow [2025-04-26 16:24:49,866 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 50 places, 37 transitions, 110 flow [2025-04-26 16:24:49,875 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:49,875 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:49,875 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:49,876 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:49,876 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:49,876 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:49,876 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:49,876 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:49,877 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:50,592 INFO L131 ngComponentsAnalysis]: Automaton has 1267 accepting balls. 6636 [2025-04-26 16:24:50,593 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:50,593 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:50,597 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:50,597 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:50,598 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:50,599 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 6826 states, but on-demand construction may add more states [2025-04-26 16:24:50,756 INFO L131 ngComponentsAnalysis]: Automaton has 1267 accepting balls. 6636 [2025-04-26 16:24:50,757 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:50,758 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:50,758 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:50,758 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:50,762 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:50,763 INFO L754 eck$LassoCheckResult]: Loop: "[93] L29-->L31: 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[]" "[95] L31-->L29: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:50,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2025-04-26 16:24:50,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:50,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045000087] [2025-04-26 16:24:50,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:50,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:50,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:50,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:50,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:50,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:50,823 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:50,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:50,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:50,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:50,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:50,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:50,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:50,845 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2025-04-26 16:24:50,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:50,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135470623] [2025-04-26 16:24:50,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:50,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:50,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:50,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:50,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:50,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:50,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:50,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:50,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:50,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:50,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:50,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:50,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash 146167, now seen corresponding path program 1 times [2025-04-26 16:24:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:50,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178239447] [2025-04-26 16:24:50,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:50,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:50,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:50,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:50,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:50,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:50,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:50,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:50,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:50,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:50,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:50,923 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:50,923 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:50,923 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:50,923 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:50,923 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:50,923 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:50,924 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:50,924 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:50,924 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:50,924 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:50,924 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:50,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:50,962 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:50,962 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:50,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:50,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:50,965 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-04-26 16:24:50,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:50,993 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:50,996 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-04-26 16:24:51,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:51,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:51,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:51,014 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-04-26 16:24:51,015 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-04-26 16:24:51,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:51,017 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:51,082 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:51,086 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-04-26 16:24:51,086 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:51,086 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:51,086 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:51,087 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:51,087 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:51,087 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:51,087 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:51,087 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:51,087 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:51,087 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:51,087 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:51,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:51,109 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:51,112 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:51,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:51,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:51,115 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-04-26 16:24:51,116 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-04-26 16:24:51,118 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-04-26 16:24:51,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:51,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:51,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:51,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:51,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:51,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:51,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:51,136 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:51,142 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:51,142 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:51,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:51,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:51,146 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-04-26 16:24:51,148 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-04-26 16:24:51,148 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:51,151 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:51,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:24:51,152 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:51,152 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:51,152 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:24:51,158 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-04-26 16:24:51,160 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:51,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:51,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:51,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:51,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:51,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:51,220 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:51,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:51,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:51,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:51,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:51,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:51,237 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:51,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:51,321 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-04-26 16:24:51,324 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 6826 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:51,974 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 6826 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 19109 states and 121850 transitions. Complement of second has 6 states. [2025-04-26 16:24:51,977 INFO L140 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-04-26 16:24:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-04-26 16:24:52,021 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 89 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:24:52,022 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:52,022 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 89 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:52,022 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:52,022 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 89 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:24:52,022 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:52,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19109 states and 121850 transitions. [2025-04-26 16:24:52,505 INFO L131 ngComponentsAnalysis]: Automaton has 1505 accepting balls. 6510 [2025-04-26 16:24:52,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19109 states to 14629 states and 94157 transitions. [2025-04-26 16:24:52,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6633 [2025-04-26 16:24:52,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10631 [2025-04-26 16:24:52,880 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14629 states and 94157 transitions. [2025-04-26 16:24:52,881 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:52,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14629 states and 94157 transitions. [2025-04-26 16:24:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14629 states and 94157 transitions. [2025-04-26 16:24:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14629 to 10633. [2025-04-26 16:24:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10633 states, 10633 states have (on average 6.63077212451801) internal successors, (in total 70505), 10632 states have internal predecessors, (70505), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 70505 transitions. [2025-04-26 16:24:53,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10633 states and 70505 transitions. [2025-04-26 16:24:53,597 INFO L438 stractBuchiCegarLoop]: Abstraction has 10633 states and 70505 transitions. [2025-04-26 16:24:53,597 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:53,597 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10633 states and 70505 transitions. [2025-04-26 16:24:53,684 INFO L131 ngComponentsAnalysis]: Automaton has 1505 accepting balls. 6510 [2025-04-26 16:24:53,684 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:53,684 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:53,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:53,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:53,685 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[121] L12-->L38: 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-04-26 16:24:53,685 INFO L754 eck$LassoCheckResult]: Loop: "[97] L38-->L40: 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[]" "[99] L40-->L38: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:24:53,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:53,686 INFO L85 PathProgramCache]: Analyzing trace with hash 4740, now seen corresponding path program 1 times [2025-04-26 16:24:53,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:53,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729585710] [2025-04-26 16:24:53,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:53,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:53,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:53,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:53,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:53,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:53,693 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:53,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:53,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:53,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:53,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:53,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:53,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:53,698 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:24:53,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:53,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024592324] [2025-04-26 16:24:53,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:53,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:53,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:53,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:53,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:53,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:53,704 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:53,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:53,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:53,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:53,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:53,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:53,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash 4558246, now seen corresponding path program 1 times [2025-04-26 16:24:53,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:53,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888187229] [2025-04-26 16:24:53,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:53,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:53,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:53,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:53,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:53,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:53,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:53,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:53,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:53,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:53,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:53,738 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:53,738 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:53,739 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:53,739 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:53,739 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:53,739 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:53,739 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:53,739 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:53,739 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:53,739 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:53,739 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:53,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:53,759 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:53,759 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:53,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:53,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:53,762 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-04-26 16:24:53,764 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-04-26 16:24:53,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:53,765 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:53,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:53,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:53,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:53,785 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-04-26 16:24:53,786 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-04-26 16:24:53,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:53,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:53,855 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:53,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:53,860 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:53,860 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:53,860 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:53,860 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:53,860 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:53,861 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:53,861 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:53,861 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:53,861 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:53,861 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:53,861 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:53,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:53,881 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:53,881 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:53,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:53,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:53,884 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-04-26 16:24:53,885 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-04-26 16:24:53,886 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-04-26 16:24:53,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:53,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:53,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:53,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:53,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:53,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:53,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:53,899 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:53,904 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:53,904 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:53,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:53,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:53,907 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-04-26 16:24:53,908 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-04-26 16:24:53,909 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:53,912 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:53,913 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-04-26 16:24:53,913 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:53,913 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:53,913 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:24:53,919 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-04-26 16:24:53,920 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:53,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:53,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:53,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:53,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:53,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:53,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:53,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:53,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:53,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:53,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:53,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:53,951 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:53,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:53,964 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-04-26 16:24:53,964 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10633 states and 70505 transitions. cyclomatic complexity: 61709 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:55,036 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10633 states and 70505 transitions. cyclomatic complexity: 61709. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 32675 states and 225290 transitions. Complement of second has 6 states. [2025-04-26 16:24:55,037 INFO L140 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-04-26 16:24:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-04-26 16:24:55,038 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:55,038 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:55,038 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:55,038 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:55,038 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:55,038 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:55,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32675 states and 225290 transitions. [2025-04-26 16:24:55,648 INFO L131 ngComponentsAnalysis]: Automaton has 1790 accepting balls. 6230 [2025-04-26 16:24:56,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32675 states to 24489 states and 169853 transitions. [2025-04-26 16:24:56,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8751 [2025-04-26 16:24:56,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13370 [2025-04-26 16:24:56,148 INFO L74 IsDeterministic]: Start isDeterministic. Operand 24489 states and 169853 transitions. [2025-04-26 16:24:56,148 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:56,148 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24489 states and 169853 transitions. [2025-04-26 16:24:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24489 states and 169853 transitions. [2025-04-26 16:24:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24489 to 19870. [2025-04-26 16:24:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19870 states, 19870 states have (on average 7.2187720181177655) internal successors, (in total 143437), 19869 states have internal predecessors, (143437), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19870 states to 19870 states and 143437 transitions. [2025-04-26 16:24:57,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19870 states and 143437 transitions. [2025-04-26 16:24:57,150 INFO L438 stractBuchiCegarLoop]: Abstraction has 19870 states and 143437 transitions. [2025-04-26 16:24:57,150 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:57,150 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19870 states and 143437 transitions. [2025-04-26 16:24:57,445 INFO L131 ngComponentsAnalysis]: Automaton has 1790 accepting balls. 6230 [2025-04-26 16:24:57,445 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:57,445 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:57,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:57,446 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:57,446 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[121] L12-->L38: 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]" "[124] L13-->L47: 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-04-26 16:24:57,446 INFO L754 eck$LassoCheckResult]: Loop: "[101] L47-->L49: 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[]" "[103] L49-->L47: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:24:57,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:57,447 INFO L85 PathProgramCache]: Analyzing trace with hash 147064, now seen corresponding path program 1 times [2025-04-26 16:24:57,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:57,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746149801] [2025-04-26 16:24:57,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:57,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:57,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:57,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:57,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:57,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:57,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:57,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:57,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:57,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:57,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:57,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:57,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:57,453 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 16:24:57,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:57,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157250524] [2025-04-26 16:24:57,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:57,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:57,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:57,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:57,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:57,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:57,456 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:57,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:57,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:57,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:57,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:57,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:57,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash 141331738, now seen corresponding path program 1 times [2025-04-26 16:24:57,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:57,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919733340] [2025-04-26 16:24:57,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:57,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:57,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:57,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:57,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:57,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:57,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:57,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:57,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:57,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:57,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:57,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:57,486 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:57,486 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:57,486 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:57,486 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:57,486 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:57,487 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:57,487 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:57,487 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:57,487 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:57,487 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:57,487 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:57,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:57,502 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:57,502 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:57,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:57,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:57,504 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-04-26 16:24:57,505 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-04-26 16:24:57,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:57,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:57,522 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-04-26 16:24:57,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:57,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:57,525 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-04-26 16:24:57,526 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-04-26 16:24:57,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:57,527 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:57,590 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:57,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:24:57,594 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:57,594 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:57,594 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:57,594 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:57,594 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:57,594 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:57,594 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:57,594 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:57,595 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:57,595 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:57,595 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:57,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:57,614 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:57,615 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:57,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:57,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:57,617 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-04-26 16:24:57,618 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-04-26 16:24:57,619 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-04-26 16:24:57,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:57,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:57,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:57,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:57,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:57,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:57,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:57,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:57,635 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:57,635 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:57,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:57,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:57,637 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-04-26 16:24:57,638 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-04-26 16:24:57,640 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:57,642 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:57,643 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-04-26 16:24:57,643 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:57,643 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:57,643 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:24:57,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:57,649 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:57,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:57,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:57,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:57,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:57,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:57,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:57,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:57,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:57,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:57,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:57,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:57,676 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:57,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:57,687 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-04-26 16:24:57,688 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19870 states and 143437 transitions. cyclomatic complexity: 126368 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:58,700 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19870 states and 143437 transitions. cyclomatic complexity: 126368. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 62628 states and 462615 transitions. Complement of second has 6 states. [2025-04-26 16:24:58,700 INFO L140 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-04-26 16:24:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 16:24:58,701 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:58,701 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:58,701 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:58,701 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:58,701 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:24:58,702 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:58,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62628 states and 462615 transitions. [2025-04-26 16:25:00,160 INFO L131 ngComponentsAnalysis]: Automaton has 2005 accepting balls. 5670 [2025-04-26 16:25:00,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62628 states to 44778 states and 331130 transitions. [2025-04-26 16:25:00,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12781 [2025-04-26 16:25:00,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17316 [2025-04-26 16:25:00,946 INFO L74 IsDeterministic]: Start isDeterministic. Operand 44778 states and 331130 transitions. [2025-04-26 16:25:00,947 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:00,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44778 states and 331130 transitions. [2025-04-26 16:25:00,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44778 states and 331130 transitions. [2025-04-26 16:25:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44778 to 37696. [2025-04-26 16:25:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37696 states, 37696 states have (on average 7.657125424448218) internal successors, (in total 288643), 37695 states have internal predecessors, (288643), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37696 states to 37696 states and 288643 transitions. [2025-04-26 16:25:02,681 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37696 states and 288643 transitions. [2025-04-26 16:25:02,681 INFO L438 stractBuchiCegarLoop]: Abstraction has 37696 states and 288643 transitions. [2025-04-26 16:25:02,681 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:25:02,681 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37696 states and 288643 transitions. [2025-04-26 16:25:03,286 INFO L131 ngComponentsAnalysis]: Automaton has 2005 accepting balls. 5670 [2025-04-26 16:25:03,286 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:03,287 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:03,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:25:03,287 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:03,288 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[121] L12-->L38: 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]" "[124] L13-->L47: 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]" "[127] L14-->L56: 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-04-26 16:25:03,288 INFO L754 eck$LassoCheckResult]: Loop: "[105] L56-->L58: 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[]" "[107] L58-->L56: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:25:03,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash 4559111, now seen corresponding path program 1 times [2025-04-26 16:25:03,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:03,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470771637] [2025-04-26 16:25:03,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:03,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:03,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:03,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:03,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:03,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:03,296 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:03,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:03,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:03,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:03,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:03,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:03,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:03,299 INFO L85 PathProgramCache]: Analyzing trace with hash 4323, now seen corresponding path program 1 times [2025-04-26 16:25:03,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:03,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991078152] [2025-04-26 16:25:03,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:03,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:03,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:03,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:03,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:03,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:03,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:03,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:03,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:03,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:03,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:03,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash 86341737, now seen corresponding path program 1 times [2025-04-26 16:25:03,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:03,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825260553] [2025-04-26 16:25:03,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:03,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:25:03,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:25:03,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:03,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:03,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:03,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:25:03,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:25:03,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:03,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:03,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:03,328 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:03,328 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:03,328 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:03,328 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:03,329 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:03,329 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:03,329 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:03,329 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:03,329 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:25:03,329 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:03,329 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:03,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:03,343 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:03,343 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:03,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:03,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:03,345 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-04-26 16:25:03,347 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-04-26 16:25:03,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:03,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:03,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:25:03,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:03,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:03,367 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-04-26 16:25:03,367 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-04-26 16:25:03,369 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:03,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:03,433 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:03,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:25:03,437 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:03,437 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:03,437 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:03,437 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:03,437 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:03,437 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:03,437 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:03,437 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:03,437 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:25:03,437 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:03,437 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:03,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:03,453 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:03,453 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:03,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:03,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:03,455 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-04-26 16:25:03,456 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-04-26 16:25:03,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-04-26 16:25:03,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:03,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:03,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:03,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:03,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:03,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:03,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:03,475 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:03,479 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:25:03,479 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:03,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:03,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:03,481 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-04-26 16:25:03,482 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-04-26 16:25:03,483 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:03,486 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:25:03,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:03,487 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:03,487 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:03,487 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:25:03,492 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-04-26 16:25:03,492 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:03,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:03,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:25:03,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:25:03,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:03,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:03,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:03,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:03,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:03,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:03,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:03,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:03,524 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:03,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:25:03,534 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-04-26 16:25:03,534 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37696 states and 288643 transitions. cyclomatic complexity: 255251 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:05,529 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37696 states and 288643 transitions. cyclomatic complexity: 255251. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 113120 states and 875155 transitions. Complement of second has 6 states. [2025-04-26 16:25:05,530 INFO L140 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-04-26 16:25:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-04-26 16:25:05,530 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 99 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:25:05,530 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:05,530 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 99 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:25:05,530 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:05,530 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 99 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:25:05,531 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:05,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113120 states and 875155 transitions. [2025-04-26 16:25:08,174 INFO L131 ngComponentsAnalysis]: Automaton has 1962 accepting balls. 4606 [2025-04-26 16:25:09,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113120 states to 75142 states and 580055 transitions. [2025-04-26 16:25:09,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18103 [2025-04-26 16:25:09,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22122 [2025-04-26 16:25:09,547 INFO L74 IsDeterministic]: Start isDeterministic. Operand 75142 states and 580055 transitions. [2025-04-26 16:25:09,547 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:09,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75142 states and 580055 transitions. [2025-04-26 16:25:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75142 states and 580055 transitions. [2025-04-26 16:25:11,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75142 to 65282. [2025-04-26 16:25:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65282 states, 65282 states have (on average 7.942082044055023) internal successors, (in total 518475), 65281 states have internal predecessors, (518475), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65282 states to 65282 states and 518475 transitions. [2025-04-26 16:25:12,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65282 states and 518475 transitions. [2025-04-26 16:25:12,302 INFO L438 stractBuchiCegarLoop]: Abstraction has 65282 states and 518475 transitions. [2025-04-26 16:25:12,302 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:25:12,302 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65282 states and 518475 transitions. [2025-04-26 16:25:13,260 INFO L131 ngComponentsAnalysis]: Automaton has 1962 accepting balls. 4606 [2025-04-26 16:25:13,260 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:13,260 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:13,261 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:25:13,261 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:13,262 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[121] L12-->L38: 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]" "[124] L13-->L47: 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]" "[127] L14-->L56: 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]" "[130] L15-->L65: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" [2025-04-26 16:25:13,262 INFO L754 eck$LassoCheckResult]: Loop: "[109] L65-->L67: Formula: (< v_x5_1 v_z_9) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" "[111] L67-->L65: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-04-26 16:25:13,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:13,262 INFO L85 PathProgramCache]: Analyzing trace with hash 141332571, now seen corresponding path program 1 times [2025-04-26 16:25:13,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:13,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598274574] [2025-04-26 16:25:13,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:13,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:13,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:25:13,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:25:13,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,268 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:13,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:25:13,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:25:13,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:13,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash 4451, now seen corresponding path program 1 times [2025-04-26 16:25:13,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:13,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553134448] [2025-04-26 16:25:13,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:13,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:13,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:13,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:13,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,274 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:13,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:13,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:13,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:13,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1618349251, now seen corresponding path program 1 times [2025-04-26 16:25:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:13,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880777550] [2025-04-26 16:25:13,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:13,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:13,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:25:13,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:25:13,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,282 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:13,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:25:13,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:25:13,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:13,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:13,301 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:13,301 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:13,301 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:13,301 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:13,301 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:13,301 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,301 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:13,301 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:13,301 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:25:13,301 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:13,301 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:13,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:13,315 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:13,315 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:13,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:13,317 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:13,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:25:13,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:13,320 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:13,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:13,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:13,339 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:13,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:25:13,346 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:13,346 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:13,418 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:13,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:13,422 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:13,422 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:13,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:13,422 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:13,422 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:13,422 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,422 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:13,422 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:13,422 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:25:13,422 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:13,422 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:13,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:13,436 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:13,436 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:13,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:13,439 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:13,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:25:13,442 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-04-26 16:25:13,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:13,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:13,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:13,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:13,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:13,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:13,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:13,456 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:13,458 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:25:13,458 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:25:13,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:13,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:13,461 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:13,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:25:13,463 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:13,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:13,467 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:13,467 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:13,467 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 16:25:13,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:25:13,473 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:13,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:13,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:25:13,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:25:13,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:13,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:13,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:13,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:13,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:13,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:13,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:13,506 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:13,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:25:13,522 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-04-26 16:25:13,523 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65282 states and 518475 transitions. cyclomatic complexity: 459485 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:16,720 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65282 states and 518475 transitions. cyclomatic complexity: 459485. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 183520 states and 1462697 transitions. Complement of second has 6 states. [2025-04-26 16:25:16,721 INFO L140 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-04-26 16:25:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-04-26 16:25:16,721 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:25:16,722 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:16,722 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:25:16,722 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:16,722 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 103 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:25:16,722 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:16,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183520 states and 1462697 transitions. [2025-04-26 16:25:21,577 INFO L131 ngComponentsAnalysis]: Automaton has 1365 accepting balls. 2730 [2025-04-26 16:25:23,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183520 states to 101034 states and 802953 transitions. [2025-04-26 16:25:23,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21369 [2025-04-26 16:25:23,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24182 [2025-04-26 16:25:23,665 INFO L74 IsDeterministic]: Start isDeterministic. Operand 101034 states and 802953 transitions. [2025-04-26 16:25:23,666 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:25:23,666 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101034 states and 802953 transitions. [2025-04-26 16:25:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101034 states and 802953 transitions. [2025-04-26 16:25:26,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101034 to 90174. [2025-04-26 16:25:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90174 states, 90174 states have (on average 8.123882715638654) internal successors, (in total 732563), 90173 states have internal predecessors, (732563), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90174 states to 90174 states and 732563 transitions. [2025-04-26 16:25:27,454 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90174 states and 732563 transitions. [2025-04-26 16:25:27,454 INFO L438 stractBuchiCegarLoop]: Abstraction has 90174 states and 732563 transitions. [2025-04-26 16:25:27,454 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:25:27,454 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90174 states and 732563 transitions. [2025-04-26 16:25:28,828 INFO L131 ngComponentsAnalysis]: Automaton has 1365 accepting balls. 2730 [2025-04-26 16:25:28,828 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:25:28,828 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:25:28,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:25:28,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:25:28,830 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[121] L12-->L38: 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]" "[124] L13-->L47: 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]" "[127] L14-->L56: 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]" "[130] L15-->L65: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[133] L16-->L74: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" [2025-04-26 16:25:28,830 INFO L754 eck$LassoCheckResult]: Loop: "[113] L74-->L76: Formula: (< v_x6_1 v_z_11) InVars {x6=v_x6_1, z=v_z_11} OutVars{x6=v_x6_1, z=v_z_11} AuxVars[] AssignedVars[]" "[115] L76-->L74: Formula: (= v_x6_2 (+ v_x6_3 1)) InVars {x6=v_x6_3} OutVars{x6=v_x6_2} AuxVars[] AssignedVars[x6]" [2025-04-26 16:25:28,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:28,830 INFO L85 PathProgramCache]: Analyzing trace with hash 86342538, now seen corresponding path program 1 times [2025-04-26 16:25:28,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:28,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363286760] [2025-04-26 16:25:28,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:28,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:25:28,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:25:28,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:28,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:28,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:25:28,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:25:28,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:28,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:28,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash 4579, now seen corresponding path program 1 times [2025-04-26 16:25:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:28,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202935622] [2025-04-26 16:25:28,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:28,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:28,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:28,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:28,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:28,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:28,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:28,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:28,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:28,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:28,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1370804012, now seen corresponding path program 1 times [2025-04-26 16:25:28,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:25:28,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638915045] [2025-04-26 16:25:28,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:25:28,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:25:28,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:25:28,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:25:28,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:28,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:25:28,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:25:28,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:25:28,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:28,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:25:28,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:25:28,866 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:28,866 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:28,866 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:28,866 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:28,866 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:25:28,866 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:28,866 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:28,866 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:28,866 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:25:28,866 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:28,866 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:28,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:28,877 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:28,877 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:25:28,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:28,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:28,880 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:28,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:25:28,883 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:25:28,883 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:28,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:25:28,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:28,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:28,905 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:28,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:25:28,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:25:28,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:25:28,975 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:25:28,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:28,979 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:25:28,979 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:25:28,979 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:25:28,979 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:25:28,979 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:25:28,979 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:28,979 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:25:28,979 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:25:28,979 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_6.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:25:28,979 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:25:28,979 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:25:28,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:25:28,994 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:25:28,994 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:25:28,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:28,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:28,996 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:28,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:25:28,998 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-04-26 16:25:29,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:25:29,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:25:29,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:25:29,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:25:29,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:25:29,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:25:29,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:25:29,012 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:25:29,015 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:25:29,016 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:25:29,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:25:29,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:25:29,017 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:25:29,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:25:29,020 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:25:29,023 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:25:29,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:25:29,024 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:25:29,024 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:25:29,024 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x6) = 1*z - 1*x6 Supporting invariants [] [2025-04-26 16:25:29,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:25:29,031 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:25:29,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:25:29,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:25:29,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:25:29,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:29,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:29,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:25:29,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:29,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:25:29,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:25:29,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:25:29,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:25:29,062 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:25:29,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:25:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:25:29,071 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-04-26 16:25:29,071 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90174 states and 732563 transitions. cyclomatic complexity: 650090 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:33,124 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90174 states and 732563 transitions. cyclomatic complexity: 650090. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 212582 states and 1698208 transitions. Complement of second has 6 states. [2025-04-26 16:25:33,124 INFO L140 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-04-26 16:25:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:25:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-04-26 16:25:33,125 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:25:33,125 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:33,125 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:25:33,125 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:33,125 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:25:33,125 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:25:33,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212582 states and 1698208 transitions. [2025-04-26 16:25:38,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:25:38,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212582 states to 0 states and 0 transitions. [2025-04-26 16:25:38,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:25:38,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:25:38,722 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:25:38,722 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:25:38,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:25:38,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:25:38,722 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:25:38,722 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:25:38,723 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:25:38,723 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:25:38,723 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:25:38,728 INFO L201 PluginConnector]: Adding new model indep_loops_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:25:38 BoogieIcfgContainer [2025-04-26 16:25:38,728 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:25:38,728 INFO L158 Benchmark]: Toolchain (without parser) took 49245.04ms. Allocated memory was 155.2MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 83.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 5.4GB. Max. memory is 8.0GB. [2025-04-26 16:25:38,728 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.82ms. Allocated memory is still 155.2MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:25:38,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.98ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:25:38,729 INFO L158 Benchmark]: Boogie Preprocessor took 23.25ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 80.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:25:38,729 INFO L158 Benchmark]: RCFGBuilder took 191.77ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 70.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:25:38,732 INFO L158 Benchmark]: BuchiAutomizer took 48997.43ms. Allocated memory was 155.2MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 70.6MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 5.4GB. Max. memory is 8.0GB. [2025-04-26 16:25:38,733 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.82ms. Allocated memory is still 155.2MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.98ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.25ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 80.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 191.77ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 70.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 48997.43ms. Allocated memory was 155.2MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 70.6MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 5.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 48.8s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.4s. Büchi inclusion checks took 11.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 10.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 36417 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 20.4s Buchi closure took 0.2s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 405 mSDsluCounter, 378 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 552 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 186 mSDtfsCounter, 552 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 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: 39ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 6 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. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x6 and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:25:38,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...