/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/ie2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:32,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:32,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:24:32,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:32,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:32,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:32,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:32,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:32,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:32,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:32,273 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:32,273 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:32,273 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:32,273 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:32,273 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:32,274 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:32,274 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:32,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:32,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:32,275 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:32,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:32,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:32,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:32,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:32,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:32,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:32,276 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:32,276 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:32,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:32,276 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:32,276 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:32,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:32,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:32,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:32,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:32,277 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:32,277 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:32,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:32,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:32,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:32,557 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:32,558 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:32,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/ie2.c.bpl [2025-04-26 16:24:32,561 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/ie2.c.bpl' [2025-04-26 16:24:32,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:32,578 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:32,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:32,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:32,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:32,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:32" (1/1) ... [2025-04-26 16:24:32,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:32" (1/1) ... [2025-04-26 16:24:32,613 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:32,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:32,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:32,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:32,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:32,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:32" (1/1) ... [2025-04-26 16:24:32,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:32" (1/1) ... [2025-04-26 16:24:32,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:32" (1/1) ... [2025-04-26 16:24:32,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:32" (1/1) ... [2025-04-26 16:24:32,625 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:32" (1/1) ... [2025-04-26 16:24:32,627 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:32" (1/1) ... [2025-04-26 16:24:32,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:32" (1/1) ... [2025-04-26 16:24:32,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:32" (1/1) ... [2025-04-26 16:24:32,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:32" (1/1) ... [2025-04-26 16:24:32,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:32,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:32,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:32,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:32,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:32" (1/1) ... [2025-04-26 16:24:32,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:32,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:32,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:32,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:24:32,692 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:32,693 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:32,693 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:24:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:24:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:24:32,693 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:32,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:32,694 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:24:32,732 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:32,734 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:32,839 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:32,839 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:32,850 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:32,850 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:32,851 INFO L201 PluginConnector]: Adding new model ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:32 BoogieIcfgContainer [2025-04-26 16:24:32,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:32,851 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:32,851 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:32,855 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:32,856 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:32,856 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:32" (1/2) ... [2025-04-26 16:24:32,857 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@604f8b7d and model type ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:32, skipping insertion in model container [2025-04-26 16:24:32,857 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:32,857 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:32" (2/2) ... [2025-04-26 16:24:32,858 INFO L376 chiAutomizerObserver]: Analyzing ICFG ie2.c.bpl [2025-04-26 16:24:32,915 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:24:32,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 41 transitions, 103 flow [2025-04-26 16:24:32,972 INFO L116 PetriNetUnfolderBase]: 6/35 cut-off events. [2025-04-26 16:24:32,974 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:24:32,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 6/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-04-26 16:24:32,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 41 transitions, 103 flow [2025-04-26 16:24:32,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 35 transitions, 88 flow [2025-04-26 16:24:32,988 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 39 places, 35 transitions, 88 flow [2025-04-26 16:24:32,998 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:32,998 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:32,998 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:32,998 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:32,998 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:32,998 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:32,999 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:32,999 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:33,000 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:33,175 INFO L131 ngComponentsAnalysis]: Automaton has 196 accepting balls. 552 [2025-04-26 16:24:33,176 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:33,176 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:33,179 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:33,179 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:33,179 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:33,179 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 659 states, but on-demand construction may add more states [2025-04-26 16:24:33,201 INFO L131 ngComponentsAnalysis]: Automaton has 196 accepting balls. 552 [2025-04-26 16:24:33,202 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:33,202 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:33,202 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:33,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:33,208 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:33,208 INFO L754 eck$LassoCheckResult]: Loop: "[92] L26-->L28: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[94] L28-->L26: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:33,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash 3716, now seen corresponding path program 1 times [2025-04-26 16:24:33,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:33,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095837713] [2025-04-26 16:24:33,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:33,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:33,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:33,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:33,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:33,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:33,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,317 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-04-26 16:24:33,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:33,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63119004] [2025-04-26 16:24:33,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:33,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:33,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:33,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:33,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:33,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:33,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash 3574022, now seen corresponding path program 1 times [2025-04-26 16:24:33,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:33,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211655950] [2025-04-26 16:24:33,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:33,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:33,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:33,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:33,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:33,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:33,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:33,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:33,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:33,400 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:33,400 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:33,400 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:33,400 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:33,402 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:33,402 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,402 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:33,402 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:33,402 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:33,402 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:33,403 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:33,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,454 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:33,455 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:33,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:33,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:33,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:33,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:24:33,486 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-04-26 16:24:33,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,489 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:33,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:24:33,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:33,492 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:33,562 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:33,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:33,567 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:33,567 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:33,567 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:33,567 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:33,567 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:33,567 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,567 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:33,567 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:33,567 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:33,567 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:33,567 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:33,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:33,592 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:33,595 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:33,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:33,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:24:33,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:33,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:33,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:33,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:33,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:33,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:33,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:33,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:33,622 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:33,628 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:33,629 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:33,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:33,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:33,661 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:33,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:24:33,664 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:33,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:33,668 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:33,668 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:33,669 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 16:24:33,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:33,678 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:33,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:33,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:33,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:33,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:33,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:33,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:33,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:33,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:33,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:33,741 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:33,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:33,845 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:33,852 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 659 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:34,052 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 659 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1702 states and 5937 transitions. Complement of second has 6 states. [2025-04-26 16:24:34,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-26 16:24:34,065 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:34,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:34,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:34,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1702 states and 5937 transitions. [2025-04-26 16:24:34,097 INFO L131 ngComponentsAnalysis]: Automaton has 205 accepting balls. 526 [2025-04-26 16:24:34,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1702 states to 1150 states and 4028 transitions. [2025-04-26 16:24:34,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 662 [2025-04-26 16:24:34,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 892 [2025-04-26 16:24:34,130 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1150 states and 4028 transitions. [2025-04-26 16:24:34,130 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:34,130 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1150 states and 4028 transitions. [2025-04-26 16:24:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states and 4028 transitions. [2025-04-26 16:24:34,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 922. [2025-04-26 16:24:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 922 states have (on average 3.5683297180043385) internal successors, (in total 3290), 921 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 3290 transitions. [2025-04-26 16:24:34,216 INFO L240 hiAutomatonCegarLoop]: Abstraction has 922 states and 3290 transitions. [2025-04-26 16:24:34,216 INFO L438 stractBuchiCegarLoop]: Abstraction has 922 states and 3290 transitions. [2025-04-26 16:24:34,216 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:34,216 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 922 states and 3290 transitions. [2025-04-26 16:24:34,224 INFO L131 ngComponentsAnalysis]: Automaton has 205 accepting balls. 526 [2025-04-26 16:24:34,224 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:34,224 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:34,224 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:34,224 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:34,225 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:24:34,225 INFO L754 eck$LassoCheckResult]: Loop: "[101] L41-->L43: Formula: (< v_x3_5 v_z2_1) InVars {z2=v_z2_1, x3=v_x3_5} OutVars{z2=v_z2_1, x3=v_x3_5} AuxVars[] AssignedVars[]" "[103] L43-->L41: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-04-26 16:24:34,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash 115319, now seen corresponding path program 1 times [2025-04-26 16:24:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170249913] [2025-04-26 16:24:34,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:34,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:34,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,229 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:34,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:34,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,234 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 16:24:34,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693803685] [2025-04-26 16:24:34,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:34,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:34,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:34,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:34,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,242 INFO L85 PathProgramCache]: Analyzing trace with hash 110824793, now seen corresponding path program 1 times [2025-04-26 16:24:34,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405755088] [2025-04-26 16:24:34,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:34,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:34,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:34,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:34,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,270 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:34,270 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:34,270 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:34,270 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:34,270 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:34,270 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,270 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:34,270 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:34,270 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:34,270 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:34,270 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:34,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,292 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:34,292 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:34,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,297 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:24:34,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:34,303 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:34,321 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-04-26 16:24:34,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,323 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:24:34,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:34,325 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:34,400 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:34,405 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-04-26 16:24:34,405 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:34,405 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:34,405 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:34,405 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:34,405 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:34,405 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,405 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:34,405 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:34,405 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:34,405 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:34,405 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:34,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,429 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:34,429 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:34,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,432 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:24:34,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:34,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:34,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:34,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:34,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:34,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:34,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:34,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:34,448 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:34,451 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:34,451 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:34,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,453 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:24:34,456 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:34,458 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:34,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:34,459 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:34,459 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:34,459 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x3) = 1*z2 - 1*x3 Supporting invariants [] [2025-04-26 16:24:34,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:34,467 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:34,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:34,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:34,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:34,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:34,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:34,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:34,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:34,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:34,495 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:34,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:34,511 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:34,512 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 922 states and 3290 transitions. cyclomatic complexity: 2620 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:34,615 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 922 states and 3290 transitions. cyclomatic complexity: 2620. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2551 states and 9355 transitions. Complement of second has 6 states. [2025-04-26 16:24:34,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-26 16:24:34,616 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:34,616 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,616 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:34,616 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,616 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:24:34,617 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:34,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2551 states and 9355 transitions. [2025-04-26 16:24:34,648 INFO L131 ngComponentsAnalysis]: Automaton has 198 accepting balls. 470 [2025-04-26 16:24:34,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2551 states to 1649 states and 6013 transitions. [2025-04-26 16:24:34,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 758 [2025-04-26 16:24:34,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1011 [2025-04-26 16:24:34,696 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1649 states and 6013 transitions. [2025-04-26 16:24:34,696 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:34,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1649 states and 6013 transitions. [2025-04-26 16:24:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states and 6013 transitions. [2025-04-26 16:24:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1396. [2025-04-26 16:24:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1396 states have (on average 3.7449856733524354) internal successors, (in total 5228), 1395 states have internal predecessors, (5228), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 5228 transitions. [2025-04-26 16:24:34,734 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1396 states and 5228 transitions. [2025-04-26 16:24:34,734 INFO L438 stractBuchiCegarLoop]: Abstraction has 1396 states and 5228 transitions. [2025-04-26 16:24:34,734 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:34,734 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1396 states and 5228 transitions. [2025-04-26 16:24:34,743 INFO L131 ngComponentsAnalysis]: Automaton has 198 accepting balls. 470 [2025-04-26 16:24:34,744 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:34,744 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:34,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:24:34,744 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:34,744 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: 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]" "[126] L16-->L56: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:24:34,744 INFO L754 eck$LassoCheckResult]: Loop: "[110] L56-->L58: Formula: (< v_x4_5 v_z3_1) InVars {x4=v_x4_5, z3=v_z3_1} OutVars{x4=v_x4_5, z3=v_z3_1} AuxVars[] AssignedVars[]" "[112] L58-->L56: Formula: (= v_x4_6 (+ v_x4_7 1)) InVars {x4=v_x4_7} OutVars{x4=v_x4_6} AuxVars[] AssignedVars[x4]" [2025-04-26 16:24:34,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,745 INFO L85 PathProgramCache]: Analyzing trace with hash 3575015, now seen corresponding path program 1 times [2025-04-26 16:24:34,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186042509] [2025-04-26 16:24:34,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:34,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:34,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,751 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:34,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:34,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,758 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-04-26 16:24:34,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310965798] [2025-04-26 16:24:34,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:34,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:34,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,765 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:34,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:34,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:34,767 INFO L85 PathProgramCache]: Analyzing trace with hash -859374359, now seen corresponding path program 1 times [2025-04-26 16:24:34,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:34,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670370633] [2025-04-26 16:24:34,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:34,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:34,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:34,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:34,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:34,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:24:34,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:24:34,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:34,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:34,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:34,795 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:34,796 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:34,796 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:34,796 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:34,796 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:34,796 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,797 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:34,797 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:34,797 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:34,797 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:34,797 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:34,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,816 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:34,817 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:34,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,818 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:24:34,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:34,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:34,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:34,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,844 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:24:34,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:34,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:34,911 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:34,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:24:34,915 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:34,915 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:34,915 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:34,915 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:34,915 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:34,915 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,915 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:34,915 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:34,915 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:34,916 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:34,916 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:34,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:34,937 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:34,938 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:34,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,970 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:24:34,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:34,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:34,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:34,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:34,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:34,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:34,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:34,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:34,985 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:34,987 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:34,988 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:34,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:34,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:34,989 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:34,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:24:35,003 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:35,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:24:35,007 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:35,007 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:35,007 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z3) = -1*x4 + 1*z3 Supporting invariants [] [2025-04-26 16:24:35,012 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-04-26 16:24:35,013 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:35,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:35,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:35,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:35,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:35,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:35,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:35,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:35,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:35,054 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:35,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:35,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:35,070 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:35,070 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1396 states and 5228 transitions. cyclomatic complexity: 4154 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,161 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1396 states and 5228 transitions. cyclomatic complexity: 4154. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3912 states and 15106 transitions. Complement of second has 6 states. [2025-04-26 16:24:35,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 16:24:35,162 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:35,163 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:35,163 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:24:35,163 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:35,163 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:24:35,163 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:35,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3912 states and 15106 transitions. [2025-04-26 16:24:35,232 INFO L131 ngComponentsAnalysis]: Automaton has 168 accepting balls. 382 [2025-04-26 16:24:35,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3912 states to 2363 states and 9032 transitions. [2025-04-26 16:24:35,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 916 [2025-04-26 16:24:35,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1127 [2025-04-26 16:24:35,261 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2363 states and 9032 transitions. [2025-04-26 16:24:35,261 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:35,261 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2363 states and 9032 transitions. [2025-04-26 16:24:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states and 9032 transitions. [2025-04-26 16:24:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 2085. [2025-04-26 16:24:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2085 states have (on average 3.9107913669064747) internal successors, (in total 8154), 2084 states have internal predecessors, (8154), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 8154 transitions. [2025-04-26 16:24:35,307 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2085 states and 8154 transitions. [2025-04-26 16:24:35,308 INFO L438 stractBuchiCegarLoop]: Abstraction has 2085 states and 8154 transitions. [2025-04-26 16:24:35,308 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:35,308 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2085 states and 8154 transitions. [2025-04-26 16:24:35,319 INFO L131 ngComponentsAnalysis]: Automaton has 168 accepting balls. 382 [2025-04-26 16:24:35,319 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:35,319 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:35,319 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:35,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:35,319 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[91] L26-->L30: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[93] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[95] L31-->L32-1: Formula: (<= 3 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 16:24:35,320 INFO L754 eck$LassoCheckResult]: Loop: "[97] L32-1-->L34: Formula: (< v_x3_1 v_z1_3) InVars {x3=v_x3_1, z1=v_z1_3} OutVars{x3=v_x3_1, z1=v_z1_3} AuxVars[] AssignedVars[]" "[99] L34-->L32-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:24:35,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,320 INFO L85 PathProgramCache]: Analyzing trace with hash 110793785, now seen corresponding path program 1 times [2025-04-26 16:24:35,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:35,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916785032] [2025-04-26 16:24:35,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:35,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:35,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:35,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:35,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:35,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:35,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916785032] [2025-04-26 16:24:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916785032] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:35,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:35,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:24:35,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625576521] [2025-04-26 16:24:35,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:35,367 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:35,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:24:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:35,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629889368] [2025-04-26 16:24:35,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:35,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:35,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:35,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:35,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:35,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:35,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:35,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:35,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:35,396 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:35,396 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:35,396 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:35,396 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:35,396 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:35,396 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,396 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:35,396 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:35,396 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:35,396 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:35,397 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:35,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,413 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:35,413 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:35,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,415 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:24:35,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:35,417 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:35,433 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-04-26 16:24:35,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,435 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:24:35,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:35,437 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:35,503 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:35,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:24:35,507 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:35,507 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:35,507 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:35,507 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:35,507 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:35,507 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,507 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:35,507 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:35,507 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:35,507 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:35,507 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:35,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:35,528 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:35,528 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:35,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,531 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:24:35,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:35,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:35,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:35,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:35,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:35,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:35,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:35,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:35,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:35,549 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:35,549 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:35,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:35,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:35,551 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:35,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:24:35,552 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:35,555 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-04-26 16:24:35,555 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:35,555 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:35,556 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x3) = 1*z1 - 1*x3 Supporting invariants [] [2025-04-26 16:24:35,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:35,561 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:35,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:35,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:35,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:35,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:35,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:35,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:35,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:35,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:35,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:35,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:35,589 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:35,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:35,603 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:35,604 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2085 states and 8154 transitions. cyclomatic complexity: 6466 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,689 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2085 states and 8154 transitions. cyclomatic complexity: 6466. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 4754 states and 19301 transitions. Complement of second has 6 states. [2025-04-26 16:24:35,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-04-26 16:24:35,691 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:35,691 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:35,691 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:24:35,691 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:35,691 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:24:35,691 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:35,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4754 states and 19301 transitions. [2025-04-26 16:24:35,740 INFO L131 ngComponentsAnalysis]: Automaton has 149 accepting balls. 318 [2025-04-26 16:24:35,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4754 states to 3465 states and 13940 transitions. [2025-04-26 16:24:35,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1085 [2025-04-26 16:24:35,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1313 [2025-04-26 16:24:35,812 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3465 states and 13940 transitions. [2025-04-26 16:24:35,812 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:35,812 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3465 states and 13940 transitions. [2025-04-26 16:24:35,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states and 13940 transitions. [2025-04-26 16:24:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 3007. [2025-04-26 16:24:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3007 states have (on average 4.135018290655138) internal successors, (in total 12434), 3006 states have internal predecessors, (12434), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 12434 transitions. [2025-04-26 16:24:35,889 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3007 states and 12434 transitions. [2025-04-26 16:24:35,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:35,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:24:35,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:24:35,892 INFO L87 Difference]: Start difference. First operand 3007 states and 12434 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:35,942 INFO L93 Difference]: Finished difference Result 1686 states and 6512 transitions. [2025-04-26 16:24:35,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1686 states and 6512 transitions. [2025-04-26 16:24:35,955 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 264 [2025-04-26 16:24:35,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1686 states to 1686 states and 6512 transitions. [2025-04-26 16:24:35,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 709 [2025-04-26 16:24:35,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 709 [2025-04-26 16:24:35,972 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1686 states and 6512 transitions. [2025-04-26 16:24:35,972 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:35,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1686 states and 6512 transitions. [2025-04-26 16:24:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states and 6512 transitions. [2025-04-26 16:24:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1686. [2025-04-26 16:24:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1686 states have (on average 3.8623962040332147) internal successors, (in total 6512), 1685 states have internal predecessors, (6512), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 6512 transitions. [2025-04-26 16:24:36,004 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1686 states and 6512 transitions. [2025-04-26 16:24:36,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:24:36,005 INFO L438 stractBuchiCegarLoop]: Abstraction has 1686 states and 6512 transitions. [2025-04-26 16:24:36,005 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:24:36,005 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1686 states and 6512 transitions. [2025-04-26 16:24:36,012 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 264 [2025-04-26 16:24:36,012 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:36,012 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:36,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:36,012 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:36,013 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: 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]" "[100] L41-->L45: Formula: (<= v_z2_2 v_x3_8) InVars {z2=v_z2_2, x3=v_x3_8} OutVars{z2=v_z2_2, x3=v_x3_8} AuxVars[] AssignedVars[]" "[102] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[91] L26-->L30: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[93] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[104] L46-->L47-1: Formula: (<= 3 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-04-26 16:24:36,013 INFO L754 eck$LassoCheckResult]: Loop: "[106] L47-1-->L49: Formula: (< v_x4_1 v_z2_3) InVars {x4=v_x4_1, z2=v_z2_3} OutVars{x4=v_x4_1, z2=v_z2_3} AuxVars[] AssignedVars[]" "[108] L49-->L47-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:24:36,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:36,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1249305235, now seen corresponding path program 1 times [2025-04-26 16:24:36,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:36,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423619845] [2025-04-26 16:24:36,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:36,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:36,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:36,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:36,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:36,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423619845] [2025-04-26 16:24:36,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423619845] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:36,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:36,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:24:36,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106982687] [2025-04-26 16:24:36,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:36,055 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:36,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:36,055 INFO L85 PathProgramCache]: Analyzing trace with hash 4355, now seen corresponding path program 1 times [2025-04-26 16:24:36,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:36,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244462766] [2025-04-26 16:24:36,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:36,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:36,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:36,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:36,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,057 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:36,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:36,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:36,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:36,073 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:36,073 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:36,073 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:36,073 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:36,074 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:36,074 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,074 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:36,074 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:36,074 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:24:36,074 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:36,074 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:36,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,088 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:36,088 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:36,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,090 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:24:36,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:36,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:36,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:36,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,112 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:24:36,115 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:36,115 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:36,191 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:36,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:36,196 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:36,196 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:36,196 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:36,196 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:36,196 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:36,196 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,196 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:36,196 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:36,196 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:24:36,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:36,196 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:36,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,211 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:36,211 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:36,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,213 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:24:36,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:36,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:36,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:36,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:36,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:36,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:36,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:36,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:36,230 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:36,232 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:36,232 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:36,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,234 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:24:36,235 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:36,238 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-04-26 16:24:36,238 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:36,238 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:36,238 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x4) = 1*z2 - 1*x4 Supporting invariants [] [2025-04-26 16:24:36,243 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-04-26 16:24:36,244 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:36,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:36,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:24:36,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:24:36,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:36,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:36,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:36,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:36,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:36,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:36,273 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:36,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:36,288 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:36,288 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1686 states and 6512 transitions. cyclomatic complexity: 5141 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:36,346 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1686 states and 6512 transitions. cyclomatic complexity: 5141. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3815 states and 15431 transitions. Complement of second has 6 states. [2025-04-26 16:24:36,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-04-26 16:24:36,348 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:24:36,348 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:36,348 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:24:36,348 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:36,348 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 97 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:24:36,348 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:36,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3815 states and 15431 transitions. [2025-04-26 16:24:36,373 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 162 [2025-04-26 16:24:36,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3815 states to 2532 states and 10293 transitions. [2025-04-26 16:24:36,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 704 [2025-04-26 16:24:36,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 859 [2025-04-26 16:24:36,398 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2532 states and 10293 transitions. [2025-04-26 16:24:36,398 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:36,398 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2532 states and 10293 transitions. [2025-04-26 16:24:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states and 10293 transitions. [2025-04-26 16:24:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 2197. [2025-04-26 16:24:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2197 states, 2197 states have (on average 4.13928083750569) internal successors, (in total 9094), 2196 states have internal predecessors, (9094), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 2197 states and 9094 transitions. [2025-04-26 16:24:36,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2197 states and 9094 transitions. [2025-04-26 16:24:36,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:36,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:24:36,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:24:36,442 INFO L87 Difference]: Start difference. First operand 2197 states and 9094 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:36,471 INFO L93 Difference]: Finished difference Result 637 states and 2402 transitions. [2025-04-26 16:24:36,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 637 states and 2402 transitions. [2025-04-26 16:24:36,493 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 62 [2025-04-26 16:24:36,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 637 states to 587 states and 2192 transitions. [2025-04-26 16:24:36,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2025-04-26 16:24:36,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2025-04-26 16:24:36,497 INFO L74 IsDeterministic]: Start isDeterministic. Operand 587 states and 2192 transitions. [2025-04-26 16:24:36,497 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:36,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 587 states and 2192 transitions. [2025-04-26 16:24:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states and 2192 transitions. [2025-04-26 16:24:36,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2025-04-26 16:24:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 587 states have (on average 3.734241908006814) internal successors, (in total 2192), 586 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 2192 transitions. [2025-04-26 16:24:36,506 INFO L240 hiAutomatonCegarLoop]: Abstraction has 587 states and 2192 transitions. [2025-04-26 16:24:36,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:24:36,506 INFO L438 stractBuchiCegarLoop]: Abstraction has 587 states and 2192 transitions. [2025-04-26 16:24:36,506 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:24:36,506 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 587 states and 2192 transitions. [2025-04-26 16:24:36,508 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 62 [2025-04-26 16:24:36,508 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:36,508 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:36,509 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:36,509 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:36,509 INFO L752 eck$LassoCheckResult]: Stem: "[85] $Ultimate##0-->L15: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[120] L15-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L15-1-->L41: 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]" "[100] L41-->L45: Formula: (<= v_z2_2 v_x3_8) InVars {z2=v_z2_2, x3=v_x3_8} OutVars{z2=v_z2_2, x3=v_x3_8} AuxVars[] AssignedVars[]" "[102] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[91] L26-->L30: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[93] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[126] L16-->L56: 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]" "[109] L56-->L60: Formula: (<= v_z3_2 v_x4_8) InVars {x4=v_x4_8, z3=v_z3_2} OutVars{x4=v_x4_8, z3=v_z3_2} AuxVars[] AssignedVars[]" "[111] L60-->L61: Formula: (= v_x2_7 (+ v_x2_8 1)) InVars {x2=v_x2_8} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[113] L61-->L62-1: Formula: (<= 3 v_x2_9) InVars {x2=v_x2_9} OutVars{x2=v_x2_9} AuxVars[] AssignedVars[]" [2025-04-26 16:24:36,509 INFO L754 eck$LassoCheckResult]: Loop: "[115] L62-1-->L64: Formula: (< v_x1_5 v_z3_3) InVars {x1=v_x1_5, z3=v_z3_3} OutVars{x1=v_x1_5, z3=v_z3_3} AuxVars[] AssignedVars[]" "[117] L64-->L62-1: Formula: (= (+ v_x1_7 1) v_x1_6) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:36,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:36,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2135094956, now seen corresponding path program 1 times [2025-04-26 16:24:36,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:36,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586056264] [2025-04-26 16:24:36,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:36,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:36,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:24:36,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:24:36,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:36,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:24:36,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:24:36,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:36,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:36,518 INFO L85 PathProgramCache]: Analyzing trace with hash 4643, now seen corresponding path program 1 times [2025-04-26 16:24:36,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:36,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133727055] [2025-04-26 16:24:36,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:36,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:36,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:36,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:36,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:36,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:36,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:36,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:36,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1168111090, now seen corresponding path program 1 times [2025-04-26 16:24:36,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:36,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527384551] [2025-04-26 16:24:36,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:36,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:36,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:24:36,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:24:36,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:36,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:24:36,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:24:36,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:36,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:36,552 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:36,552 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:36,552 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:36,552 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:36,553 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:36,553 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,553 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:36,553 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:36,553 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:24:36,553 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:36,553 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:36,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,570 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:36,570 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:36,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,620 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:24:36,622 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:36,622 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:36,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:24:36,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,642 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:24:36,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:36,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:36,709 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:36,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:36,714 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:36,714 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:36,714 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:36,714 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:36,714 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:36,714 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,714 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:36,714 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:36,714 INFO L132 ssoRankerPreferences]: Filename of dumped script: ie2.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:24:36,714 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:36,714 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:36,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:36,739 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:36,739 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:36,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,742 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:24:36,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:36,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:36,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:36,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:36,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:36,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:36,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:36,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:36,757 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:36,759 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:36,759 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:36,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:36,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:36,761 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:36,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:24:36,763 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:36,766 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:24:36,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:24:36,767 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:36,767 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:36,767 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z3, x1) = 1*z3 - 1*x1 Supporting invariants [] [2025-04-26 16:24:36,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:24:36,774 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:36,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:36,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:24:36,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:24:36,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:36,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:36,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:36,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:36,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:36,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:36,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:36,805 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:36,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:36,816 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:36,816 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 587 states and 2192 transitions. cyclomatic complexity: 1710 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:36,844 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 587 states and 2192 transitions. cyclomatic complexity: 1710. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1173 states and 4452 transitions. Complement of second has 6 states. [2025-04-26 16:24:36,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-04-26 16:24:36,845 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:24:36,845 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:36,845 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:24:36,845 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:36,845 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:24:36,845 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:36,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1173 states and 4452 transitions. [2025-04-26 16:24:36,853 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:36,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1173 states to 0 states and 0 transitions. [2025-04-26 16:24:36,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:36,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:36,854 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:36,854 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:36,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:36,854 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:36,854 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:36,854 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:24:36,854 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:36,854 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:36,854 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:36,859 INFO L201 PluginConnector]: Adding new model ie2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:36 BoogieIcfgContainer [2025-04-26 16:24:36,859 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:36,860 INFO L158 Benchmark]: Toolchain (without parser) took 4281.67ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 86.1MB in the beginning and 84.7MB in the end (delta: 1.4MB). Peak memory consumption was 58.9MB. Max. memory is 8.0GB. [2025-04-26 16:24:36,860 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.74ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:36,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.27ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 84.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:36,862 INFO L158 Benchmark]: Boogie Preprocessor took 26.81ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.2MB in the end (delta: 972.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:36,862 INFO L158 Benchmark]: RCFGBuilder took 207.25ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.5MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:24:36,863 INFO L158 Benchmark]: BuchiAutomizer took 4008.00ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 73.4MB in the beginning and 84.7MB in the end (delta: -11.3MB). Peak memory consumption was 46.3MB. Max. memory is 8.0GB. [2025-04-26 16:24:36,864 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.74ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.27ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 84.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.81ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.2MB in the end (delta: 972.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 207.25ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.5MB in the end (delta: 9.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4008.00ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 73.4MB in the beginning and 84.7MB in the end (delta: -11.3MB). Peak memory consumption was 46.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 1552 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.4s 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, 434 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 428 mSDsluCounter, 700 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 287 IncrementalHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 335 mSDtfsCounter, 287 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 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: 72ms 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: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z3 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z3 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:36,875 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...