/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/3_thr/seq_loops_indep_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:45:50,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:45:50,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:45:50,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:45:50,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:45:50,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:45:50,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:45:50,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:45:50,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:45:50,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:45:50,511 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:45:50,511 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:45:50,511 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:45:50,511 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:45:50,511 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:45:50,511 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:45:50,511 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:45:50,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:45:50,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:45:50,512 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:45:50,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:45:50,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:45:50,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:45:50,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:45:50,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:45:50,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:45:50,512 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:45:50,512 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:45:50,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:45:50,512 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:45:50,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:45:50,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:45:50,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:45:50,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:45:50,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:45:50,513 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:45:50,513 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-02-17 22:45:50,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:45:50,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:45:50,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:45:50,753 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:45:50,754 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:45:50,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/seq_loops_indep_3.c.bpl [2025-02-17 22:45:50,757 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/seq_loops_indep_3.c.bpl' [2025-02-17 22:45:50,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:45:50,772 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:45:50,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:50,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:45:50,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:45:50,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:50" (1/1) ... [2025-02-17 22:45:50,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:50" (1/1) ... [2025-02-17 22:45:50,790 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:45:50,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:50,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:45:50,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:45:50,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:45:50,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:50" (1/1) ... [2025-02-17 22:45:50,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:50" (1/1) ... [2025-02-17 22:45:50,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:50" (1/1) ... [2025-02-17 22:45:50,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:50" (1/1) ... [2025-02-17 22:45:50,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:50" (1/1) ... [2025-02-17 22:45:50,803 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:50" (1/1) ... [2025-02-17 22:45:50,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:50" (1/1) ... [2025-02-17 22:45:50,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:50" (1/1) ... [2025-02-17 22:45:50,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:50" (1/1) ... [2025-02-17 22:45:50,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:45:50,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:45:50,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:45:50,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:45:50,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:50" (1/1) ... [2025-02-17 22:45:50,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:50,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:45:50,863 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:45:50,863 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:45:50,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:45:50,864 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:45:50,864 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:45:50,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:45:50,864 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:45:50,864 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:45:50,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:45:50,864 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:45:50,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:45:50,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:45:50,865 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:45:50,898 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:45:50,900 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:45:50,957 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:45:50,957 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:45:50,964 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:45:50,964 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:45:50,964 INFO L201 PluginConnector]: Adding new model seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:50 BoogieIcfgContainer [2025-02-17 22:45:50,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:45:50,965 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:45:50,965 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:45:50,969 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:45:50,969 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:50,970 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:50" (1/2) ... [2025-02-17 22:45:50,971 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e9d6eb3 and model type seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:45:50, skipping insertion in model container [2025-02-17 22:45:50,971 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:50,971 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:50" (2/2) ... [2025-02-17 22:45:50,972 INFO L363 chiAutomizerObserver]: Analyzing ICFG seq_loops_indep_3.c.bpl [2025-02-17 22:45:51,017 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-17 22:45:51,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 89 flow [2025-02-17 22:45:51,060 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-02-17 22:45:51,061 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-17 22:45:51,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-02-17 22:45:51,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 34 transitions, 89 flow [2025-02-17 22:45:51,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 74 flow [2025-02-17 22:45:51,074 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:45:51,074 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:45:51,074 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:45:51,074 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:45:51,074 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:45:51,074 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:45:51,074 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:45:51,074 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:45:51,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-02-17 22:45:51,156 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 280 [2025-02-17 22:45:51,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:51,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:51,159 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:45:51,159 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:51,159 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:45:51,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 302 states, but on-demand construction may add more states [2025-02-17 22:45:51,175 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 280 [2025-02-17 22:45:51,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:51,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:51,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:45:51,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:51,180 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:45:51,181 INFO L754 eck$LassoCheckResult]: Loop: "[78] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[81] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-02-17 22:45:51,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 1 times [2025-02-17 22:45:51,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:51,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9160268] [2025-02-17 22:45:51,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:51,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:51,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:51,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:51,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,243 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:51,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:51,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:51,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:51,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:51,259 INFO L85 PathProgramCache]: Analyzing trace with hash 3460, now seen corresponding path program 1 times [2025-02-17 22:45:51,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:51,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978027568] [2025-02-17 22:45:51,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:51,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:51,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:51,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:51,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,270 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:51,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:51,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:51,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:51,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash 128390, now seen corresponding path program 1 times [2025-02-17 22:45:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:51,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841962630] [2025-02-17 22:45:51,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:51,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:51,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:51,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:51,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:51,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:51,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:51,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:51,351 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:51,351 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:51,351 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:51,351 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:51,351 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:51,352 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,352 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:51,352 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:51,353 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:51,353 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:51,353 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:51,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:51,411 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:51,412 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:51,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:51,418 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:51,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:45:51,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:51,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:51,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:45:51,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:51,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:51,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-17 22:45:51,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:51,453 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:51,530 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:51,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:51,535 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:51,535 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:51,535 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:51,535 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:51,535 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:51,535 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,535 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:51,536 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:51,536 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:51,536 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:51,536 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:51,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:51,569 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:51,572 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:51,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:51,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:51,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-17 22:45:51,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:51,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:51,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:51,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:51,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:51,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:51,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:51,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:51,596 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:51,602 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:51,602 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:51,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:51,605 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:51,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-17 22:45:51,608 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:51,608 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:51,608 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:51,609 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:45:51,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-17 22:45:51,619 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:51,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:51,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:45:51,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:45:51,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:51,643 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:51,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:51,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:51,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:51,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:51,655 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:51,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:51,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:45:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:51,745 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:51,747 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 302 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:51,917 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 302 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 774 states and 2836 transitions. Complement of second has 6 states. [2025-02-17 22:45:51,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-02-17 22:45:51,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 1 letters. Loop has 2 letters. [2025-02-17 22:45:51,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:51,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:45:51,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:51,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-17 22:45:51,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:51,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 774 states and 2836 transitions. [2025-02-17 22:45:51,939 INFO L131 ngComponentsAnalysis]: Automaton has 91 accepting balls. 266 [2025-02-17 22:45:51,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 774 states to 534 states and 1977 transitions. [2025-02-17 22:45:51,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 282 [2025-02-17 22:45:51,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 406 [2025-02-17 22:45:51,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 534 states and 1977 transitions. [2025-02-17 22:45:51,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:51,955 INFO L218 hiAutomatonCegarLoop]: Abstraction has 534 states and 1977 transitions. [2025-02-17 22:45:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states and 1977 transitions. [2025-02-17 22:45:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 411. [2025-02-17 22:45:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 411 states have (on average 3.725060827250608) internal successors, (1531), 410 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1531 transitions. [2025-02-17 22:45:52,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 411 states and 1531 transitions. [2025-02-17 22:45:52,006 INFO L432 stractBuchiCegarLoop]: Abstraction has 411 states and 1531 transitions. [2025-02-17 22:45:52,006 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:45:52,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 411 states and 1531 transitions. [2025-02-17 22:45:52,010 INFO L131 ngComponentsAnalysis]: Automaton has 91 accepting balls. 266 [2025-02-17 22:45:52,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:52,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:52,010 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:52,010 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:52,010 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[103] L12-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-02-17 22:45:52,011 INFO L754 eck$LassoCheckResult]: Loop: "[85] L36-->L38: Formula: (< v_x2_1 v_z_5) InVars {x2=v_x2_1, z=v_z_5} OutVars{x2=v_x2_1, z=v_z_5} AuxVars[] AssignedVars[]" "[88] L38-->L36: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:45:52,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:52,011 INFO L85 PathProgramCache]: Analyzing trace with hash 4164, now seen corresponding path program 1 times [2025-02-17 22:45:52,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:52,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954993585] [2025-02-17 22:45:52,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:52,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:52,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:52,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:52,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:52,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:52,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:52,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:52,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:52,023 INFO L85 PathProgramCache]: Analyzing trace with hash 3684, now seen corresponding path program 1 times [2025-02-17 22:45:52,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:52,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406505502] [2025-02-17 22:45:52,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:52,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:52,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:52,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:52,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,028 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:52,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:52,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:52,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:52,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash 4004327, now seen corresponding path program 1 times [2025-02-17 22:45:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:52,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052817675] [2025-02-17 22:45:52,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:52,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:52,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:52,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:52,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:52,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:52,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:52,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:52,066 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:52,067 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:52,067 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:52,067 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:52,067 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:52,067 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,067 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:52,067 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:52,067 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:52,067 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:52,067 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:52,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,086 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:52,086 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:52,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,120 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:52,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-17 22:45:52,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:52,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:52,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:45:52,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,147 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:52,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-17 22:45:52,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:52,149 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:52,217 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:52,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:45:52,222 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:52,222 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:52,222 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:52,222 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:52,222 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:52,222 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,222 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:52,222 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:52,222 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:52,222 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:52,222 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:52,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,244 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:52,245 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:52,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,247 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:52,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-17 22:45:52,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:52,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:52,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:52,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:52,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:52,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:52,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:52,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:52,263 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:52,266 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:52,266 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:52,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,269 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:52,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-17 22:45:52,270 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:52,270 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:52,270 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:52,270 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-02-17 22:45:52,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:45:52,277 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:52,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:52,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:52,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:52,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:52,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:52,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:52,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:52,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:52,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:52,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:52,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:52,327 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:52,328 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 411 states and 1531 transitions. cyclomatic complexity: 1232 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:52,420 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 411 states and 1531 transitions. cyclomatic complexity: 1232. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1147 states and 4496 transitions. Complement of second has 6 states. [2025-02-17 22:45:52,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:52,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-02-17 22:45:52,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:45:52,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:52,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:45:52,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:52,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:45:52,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:52,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1147 states and 4496 transitions. [2025-02-17 22:45:52,435 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 238 [2025-02-17 22:45:52,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1147 states to 787 states and 3053 transitions. [2025-02-17 22:45:52,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 327 [2025-02-17 22:45:52,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 462 [2025-02-17 22:45:52,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 787 states and 3053 transitions. [2025-02-17 22:45:52,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:52,452 INFO L218 hiAutomatonCegarLoop]: Abstraction has 787 states and 3053 transitions. [2025-02-17 22:45:52,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states and 3053 transitions. [2025-02-17 22:45:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 652. [2025-02-17 22:45:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 652 states have (on average 3.9708588957055215) internal successors, (2589), 651 states have internal predecessors, (2589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 2589 transitions. [2025-02-17 22:45:52,499 INFO L240 hiAutomatonCegarLoop]: Abstraction has 652 states and 2589 transitions. [2025-02-17 22:45:52,499 INFO L432 stractBuchiCegarLoop]: Abstraction has 652 states and 2589 transitions. [2025-02-17 22:45:52,499 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:45:52,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 652 states and 2589 transitions. [2025-02-17 22:45:52,507 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 238 [2025-02-17 22:45:52,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:52,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:52,508 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:52,508 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:52,508 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] L23-->L27-1: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" [2025-02-17 22:45:52,508 INFO L754 eck$LassoCheckResult]: Loop: "[80] L27-1-->L29: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[83] L29-->L27-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-02-17 22:45:52,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:52,509 INFO L85 PathProgramCache]: Analyzing trace with hash 4138, now seen corresponding path program 1 times [2025-02-17 22:45:52,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:52,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231456943] [2025-02-17 22:45:52,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:52,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:52,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:52,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:52,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,512 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:52,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:52,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:52,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:52,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:52,514 INFO L85 PathProgramCache]: Analyzing trace with hash 3524, now seen corresponding path program 1 times [2025-02-17 22:45:52,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:52,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639993518] [2025-02-17 22:45:52,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:52,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:52,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:52,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:52,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:52,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:52,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:52,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:52,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:52,527 INFO L85 PathProgramCache]: Analyzing trace with hash 3979181, now seen corresponding path program 1 times [2025-02-17 22:45:52,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:52,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102833891] [2025-02-17 22:45:52,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:52,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:52,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:52,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:52,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,533 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:52,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:52,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:52,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:52,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:52,559 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:52,559 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:52,559 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:52,559 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:52,559 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:52,559 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,559 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:52,559 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:52,559 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:45:52,559 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:52,559 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:52,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,577 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:52,577 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:52,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,579 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:52,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-17 22:45:52,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:52,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:52,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:45:52,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,607 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:52,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-17 22:45:52,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:52,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:52,683 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:52,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-02-17 22:45:52,688 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:52,688 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:52,688 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:52,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:52,688 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:52,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,688 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:52,688 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:52,688 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:45:52,688 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:52,688 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:52,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:52,716 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:52,716 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:52,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,723 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:52,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-17 22:45:52,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:52,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:52,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:52,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:52,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:52,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:52,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:52,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:52,754 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:52,756 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:52,756 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:52,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:52,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:52,761 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:52,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-17 22:45:52,769 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:52,769 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:52,769 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:52,769 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:45:52,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:45:52,777 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:52,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:52,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:52,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:52,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:52,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:52,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:52,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:52,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:52,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:52,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:52,801 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:52,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:52,818 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:52,819 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 652 states and 2589 transitions. cyclomatic complexity: 2089 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:52,916 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 652 states and 2589 transitions. cyclomatic complexity: 2089. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1423 states and 5893 transitions. Complement of second has 6 states. [2025-02-17 22:45:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:52,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-02-17 22:45:52,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:45:52,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:52,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:45:52,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:52,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:45:52,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:52,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1423 states and 5893 transitions. [2025-02-17 22:45:52,934 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 212 [2025-02-17 22:45:52,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:45:52,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1423 states to 1063 states and 4418 transitions. [2025-02-17 22:45:52,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 378 [2025-02-17 22:45:52,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 487 [2025-02-17 22:45:52,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1063 states and 4418 transitions. [2025-02-17 22:45:52,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:52,974 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1063 states and 4418 transitions. [2025-02-17 22:45:52,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states and 4418 transitions. [2025-02-17 22:45:52,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-17 22:45:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 905. [2025-02-17 22:45:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 905 states have (on average 4.27292817679558) internal successors, (3867), 904 states have internal predecessors, (3867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 3867 transitions. [2025-02-17 22:45:53,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 905 states and 3867 transitions. [2025-02-17 22:45:53,003 INFO L432 stractBuchiCegarLoop]: Abstraction has 905 states and 3867 transitions. [2025-02-17 22:45:53,003 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:45:53,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 905 states and 3867 transitions. [2025-02-17 22:45:53,011 INFO L131 ngComponentsAnalysis]: Automaton has 92 accepting balls. 212 [2025-02-17 22:45:53,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:53,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:53,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:45:53,012 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:53,012 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[103] L12-->L36: 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]" "[84] L36-->L40-1: Formula: (<= v_z_6 v_x2_4) InVars {x2=v_x2_4, z=v_z_6} OutVars{x2=v_x2_4, z=v_z_6} AuxVars[] AssignedVars[]" [2025-02-17 22:45:53,012 INFO L754 eck$LassoCheckResult]: Loop: "[87] L40-1-->L42: 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[]" "[90] L42-->L40-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-02-17 22:45:53,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash 129168, now seen corresponding path program 1 times [2025-02-17 22:45:53,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:53,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859707130] [2025-02-17 22:45:53,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:53,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:53,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:53,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:53,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:53,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:53,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:53,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 3748, now seen corresponding path program 1 times [2025-02-17 22:45:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:53,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944613599] [2025-02-17 22:45:53,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:53,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:53,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:53,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,022 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:53,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:53,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:53,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:53,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,024 INFO L85 PathProgramCache]: Analyzing trace with hash 124133235, now seen corresponding path program 1 times [2025-02-17 22:45:53,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:53,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880492758] [2025-02-17 22:45:53,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:53,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:53,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:53,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:53,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:53,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:53,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:53,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:53,038 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:53,039 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:53,039 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:53,039 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:53,039 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:53,039 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,039 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:53,039 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:53,039 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:45:53,039 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:53,039 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:53,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,060 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:53,061 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:53,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,063 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:53,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-17 22:45:53,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:53,066 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:53,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:53,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,085 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:53,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-17 22:45:53,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:53,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:53,153 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:53,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:53,157 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:53,157 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:53,157 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:53,157 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:53,158 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:53,158 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,158 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:53,158 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:53,158 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:45:53,158 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:53,158 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:53,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,205 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:53,205 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:53,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,207 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:53,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-17 22:45:53,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:53,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:53,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:53,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:53,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:53,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:53,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:53,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:53,227 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:53,229 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:53,229 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:53,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,231 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:53,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-17 22:45:53,234 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:53,234 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:53,234 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:53,234 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-02-17 22:45:53,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-17 22:45:53,241 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:53,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:53,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:53,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:53,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:53,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:53,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:53,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:53,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:53,268 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:53,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:53,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:53,280 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:53,280 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 905 states and 3867 transitions. cyclomatic complexity: 3143 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:53,355 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 905 states and 3867 transitions. cyclomatic complexity: 3143. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1763 states and 7612 transitions. Complement of second has 6 states. [2025-02-17 22:45:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-02-17 22:45:53,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:45:53,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:53,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:45:53,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:53,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 76 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:45:53,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:53,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1763 states and 7612 transitions. [2025-02-17 22:45:53,372 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 172 [2025-02-17 22:45:53,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1763 states to 1163 states and 5098 transitions. [2025-02-17 22:45:53,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 400 [2025-02-17 22:45:53,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 500 [2025-02-17 22:45:53,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1163 states and 5098 transitions. [2025-02-17 22:45:53,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:53,386 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1163 states and 5098 transitions. [2025-02-17 22:45:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states and 5098 transitions. [2025-02-17 22:45:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1014. [2025-02-17 22:45:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1014 states have (on average 4.4733727810650885) internal successors, (4536), 1013 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 4536 transitions. [2025-02-17 22:45:53,410 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1014 states and 4536 transitions. [2025-02-17 22:45:53,410 INFO L432 stractBuchiCegarLoop]: Abstraction has 1014 states and 4536 transitions. [2025-02-17 22:45:53,410 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:45:53,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1014 states and 4536 transitions. [2025-02-17 22:45:53,416 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 172 [2025-02-17 22:45:53,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:53,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:53,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:45:53,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:53,417 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[103] L12-->L36: 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]" "[106] L13-->L49: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-02-17 22:45:53,417 INFO L754 eck$LassoCheckResult]: Loop: "[92] L49-->L51: Formula: (< v_x5_2 v_z_12) InVars {x5=v_x5_2, z=v_z_12} OutVars{x5=v_x5_2, z=v_z_12} AuxVars[] AssignedVars[]" "[95] L51-->L49: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-02-17 22:45:53,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,417 INFO L85 PathProgramCache]: Analyzing trace with hash 129190, now seen corresponding path program 1 times [2025-02-17 22:45:53,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:53,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13685407] [2025-02-17 22:45:53,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:53,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:53,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:53,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:53,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:53,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:53,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:53,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:53,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,427 INFO L85 PathProgramCache]: Analyzing trace with hash 3908, now seen corresponding path program 1 times [2025-02-17 22:45:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:53,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531512225] [2025-02-17 22:45:53,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:53,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:53,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:53,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:53,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,433 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:53,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:53,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:53,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:53,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash 124154537, now seen corresponding path program 1 times [2025-02-17 22:45:53,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:53,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787273540] [2025-02-17 22:45:53,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:53,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:53,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:53,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:53,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:53,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:53,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:53,456 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:53,457 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:53,457 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:53,457 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:53,457 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:53,457 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,457 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:53,457 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:53,457 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:45:53,457 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:53,457 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:53,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,470 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:53,470 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:53,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,473 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-02-17 22:45:53,474 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-02-17 22:45:53,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:53,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:53,491 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-02-17 22:45:53,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,493 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-02-17 22:45:53,493 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-02-17 22:45:53,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:53,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:53,563 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:53,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-17 22:45:53,567 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:53,567 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:53,568 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:53,568 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:53,568 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:53,568 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,568 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:53,568 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:53,568 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:45:53,568 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:53,568 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:53,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,587 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:53,587 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:53,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,589 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-02-17 22:45:53,590 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-02-17 22:45:53,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:53,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:53,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:53,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:53,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:53,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:53,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:53,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:53,604 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:53,606 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:53,606 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:53,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,608 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-02-17 22:45:53,610 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-02-17 22:45:53,610 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:53,610 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:53,610 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:53,610 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-02-17 22:45:53,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:53,616 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:53,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:45:53,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:45:53,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:53,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:53,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:53,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:53,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:53,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:53,637 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:53,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:53,650 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:53,650 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1014 states and 4536 transitions. cyclomatic complexity: 3704 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:53,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-17 22:45:53,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:45:53,741 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1014 states and 4536 transitions. cyclomatic complexity: 3704. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2967 states and 13468 transitions. Complement of second has 6 states. [2025-02-17 22:45:53,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-02-17 22:45:53,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:45:53,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:53,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:45:53,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:53,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:45:53,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:53,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2967 states and 13468 transitions. [2025-02-17 22:45:53,768 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 86 [2025-02-17 22:45:53,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2967 states to 1933 states and 8327 transitions. [2025-02-17 22:45:53,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 505 [2025-02-17 22:45:53,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 587 [2025-02-17 22:45:53,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1933 states and 8327 transitions. [2025-02-17 22:45:53,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:53,789 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1933 states and 8327 transitions. [2025-02-17 22:45:53,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states and 8327 transitions. [2025-02-17 22:45:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1648. [2025-02-17 22:45:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1648 states have (on average 4.375) internal successors, (7210), 1647 states have internal predecessors, (7210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 7210 transitions. [2025-02-17 22:45:53,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1648 states and 7210 transitions. [2025-02-17 22:45:53,826 INFO L432 stractBuchiCegarLoop]: Abstraction has 1648 states and 7210 transitions. [2025-02-17 22:45:53,826 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:45:53,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1648 states and 7210 transitions. [2025-02-17 22:45:53,835 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 86 [2025-02-17 22:45:53,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:53,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:53,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:45:53,835 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:53,836 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[103] L12-->L36: 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]" "[106] L13-->L49: 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]" "[91] L49-->L53-1: Formula: (<= v_z_9 v_x5_1) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" [2025-02-17 22:45:53,836 INFO L754 eck$LassoCheckResult]: Loop: "[94] L53-1-->L55: Formula: (< v_x6_1 v_z_10) InVars {x6=v_x6_1, z=v_z_10} OutVars{x6=v_x6_1, z=v_z_10} AuxVars[] AssignedVars[]" "[97] L55-->L53-1: Formula: (= v_x6_2 (+ v_x6_3 1)) InVars {x6=v_x6_3} OutVars{x6=v_x6_2} AuxVars[] AssignedVars[x6]" [2025-02-17 22:45:53,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,836 INFO L85 PathProgramCache]: Analyzing trace with hash 4004981, now seen corresponding path program 1 times [2025-02-17 22:45:53,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:53,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763556711] [2025-02-17 22:45:53,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:53,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:53,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:53,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:53,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:53,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:53,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:53,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:53,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash 3972, now seen corresponding path program 1 times [2025-02-17 22:45:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896376228] [2025-02-17 22:45:53,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:53,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:53,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:53,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:53,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:53,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:53,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:53,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:53,859 INFO L85 PathProgramCache]: Analyzing trace with hash -446177544, now seen corresponding path program 1 times [2025-02-17 22:45:53,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:53,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757393026] [2025-02-17 22:45:53,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:53,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:53,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:53,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:53,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:53,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:53,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:53,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:53,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:53,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:53,887 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:53,887 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:53,887 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:53,887 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:53,887 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:53,887 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,887 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:53,887 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:53,887 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:45:53,887 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:53,887 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:53,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:53,901 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:53,901 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:53,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,903 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-02-17 22:45:53,904 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-02-17 22:45:53,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:53,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:53,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:53,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:53,925 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-02-17 22:45:53,926 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-02-17 22:45:53,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:53,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:53,994 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:53,998 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-02-17 22:45:53,998 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:53,998 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:53,998 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:53,998 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:53,998 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:53,998 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:53,998 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:53,998 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:53,998 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:45:53,998 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:53,998 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:53,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:54,020 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:54,020 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:54,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:54,022 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-02-17 22:45:54,024 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-02-17 22:45:54,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:54,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:54,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:54,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:54,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:54,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:54,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:54,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:54,038 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:54,040 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:54,040 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:54,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:54,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:54,042 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-02-17 22:45:54,043 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-02-17 22:45:54,045 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:54,045 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:54,045 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:54,045 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x6) = 1*z - 1*x6 Supporting invariants [] [2025-02-17 22:45:54,050 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-02-17 22:45:54,051 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:54,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:54,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:54,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:54,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:54,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:54,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:54,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:54,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:54,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:54,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:54,081 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:54,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:54,091 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:54,091 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1648 states and 7210 transitions. cyclomatic complexity: 5800 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:54,166 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1648 states and 7210 transitions. cyclomatic complexity: 5800. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2779 states and 11785 transitions. Complement of second has 6 states. [2025-02-17 22:45:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:54,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-02-17 22:45:54,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:45:54,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:54,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:45:54,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:54,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:45:54,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:54,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2779 states and 11785 transitions. [2025-02-17 22:45:54,211 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:54,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2779 states to 0 states and 0 transitions. [2025-02-17 22:45:54,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:45:54,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:45:54,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:45:54,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:45:54,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:54,211 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:54,211 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:54,212 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:45:54,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:45:54,212 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:54,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:45:54,218 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-02-17 22:45:54,219 INFO L201 PluginConnector]: Adding new model seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:45:54 BoogieIcfgContainer [2025-02-17 22:45:54,219 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:45:54,220 INFO L158 Benchmark]: Toolchain (without parser) took 3447.49ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 86.5MB in the beginning and 120.4MB in the end (delta: -33.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:54,220 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.79ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:54,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.69ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 85.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:54,220 INFO L158 Benchmark]: Boogie Preprocessor took 17.34ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 84.6MB in the end (delta: 679.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:54,220 INFO L158 Benchmark]: RCFGBuilder took 154.59ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 75.5MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:45:54,221 INFO L158 Benchmark]: BuchiAutomizer took 3253.90ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 75.4MB in the beginning and 120.4MB in the end (delta: -45.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:54,221 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.79ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.69ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 85.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.34ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 84.6MB in the end (delta: 679.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 154.59ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 75.5MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3253.90ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 75.4MB in the beginning and 120.4MB in the end (delta: -45.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 850 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 310 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 304 mSDsluCounter, 276 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 387 IncrementalHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 152 mSDtfsCounter, 387 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: 35ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:45:54,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...