/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/m4.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:45:48,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:45:48,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:45:48,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:45:48,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:45:48,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:45:48,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:45:48,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:45:48,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:45:48,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:45:48,609 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:45:48,609 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:45:48,610 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:45:48,610 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:45:48,610 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:45:48,610 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:45:48,610 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:45:48,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:45:48,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:45:48,610 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:45:48,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:45:48,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:45:48,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:45:48,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:45:48,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:45:48,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:45:48,611 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:45:48,611 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:45:48,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:45:48,611 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:45:48,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:45:48,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:45:48,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:45:48,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:45:48,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:45:48,612 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:45:48,612 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-02-17 22:45:48,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:45:48,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:45:48,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:45:48,858 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:45:48,858 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:45:48,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/m4.c.bpl [2025-02-17 22:45:48,861 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/m4.c.bpl' [2025-02-17 22:45:48,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:45:48,873 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:45:48,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:48,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:45:48,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:45:48,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:48" (1/1) ... [2025-02-17 22:45:48,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:48" (1/1) ... [2025-02-17 22:45:48,888 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:45:48,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:45:48,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:45:48,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:45:48,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:45:48,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:48" (1/1) ... [2025-02-17 22:45:48,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:48" (1/1) ... [2025-02-17 22:45:48,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:48" (1/1) ... [2025-02-17 22:45:48,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:48" (1/1) ... [2025-02-17 22:45:48,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:48" (1/1) ... [2025-02-17 22:45:48,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:48" (1/1) ... [2025-02-17 22:45:48,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:48" (1/1) ... [2025-02-17 22:45:48,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:48" (1/1) ... [2025-02-17 22:45:48,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:48" (1/1) ... [2025-02-17 22:45:48,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:45:48,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:45:48,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:45:48,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:45:48,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:48" (1/1) ... [2025-02-17 22:45:48,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:48,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:48,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:48,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:45:48,940 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:45:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:45:48,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:45:48,940 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:45:48,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:45:48,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:45:48,941 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:45:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:45:48,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:45:48,941 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:45:48,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:45:48,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:45:48,941 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:45:48,973 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:45:48,975 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:45:49,026 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:45:49,026 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:45:49,034 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:45:49,035 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:45:49,035 INFO L201 PluginConnector]: Adding new model m4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:49 BoogieIcfgContainer [2025-02-17 22:45:49,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:45:49,037 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:45:49,037 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:45:49,040 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:45:49,041 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:49,041 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:45:48" (1/2) ... [2025-02-17 22:45:49,042 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4db8f3ae and model type m4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:45:49, skipping insertion in model container [2025-02-17 22:45:49,042 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:45:49,042 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:45:49" (2/2) ... [2025-02-17 22:45:49,043 INFO L363 chiAutomizerObserver]: Analyzing ICFG m4.c.bpl [2025-02-17 22:45:49,110 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-17 22:45:49,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 79 flow [2025-02-17 22:45:49,161 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-02-17 22:45:49,163 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-17 22:45:49,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 3/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-02-17 22:45:49,167 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 79 flow [2025-02-17 22:45:49,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 64 flow [2025-02-17 22:45:49,179 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:45:49,179 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:45:49,179 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:45:49,179 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:45:49,179 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:45:49,179 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:45:49,179 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:45:49,179 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:45:49,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-02-17 22:45:49,230 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 134 [2025-02-17 22:45:49,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:49,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:49,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:49,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:49,234 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:45:49,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 188 states, but on-demand construction may add more states [2025-02-17 22:45:49,241 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 134 [2025-02-17 22:45:49,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:49,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:49,243 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:45:49,243 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:49,246 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L12: Formula: (= v_f_6 0) InVars {} OutVars{f=v_f_6} AuxVars[] AssignedVars[f]" "[73] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:45:49,247 INFO L754 eck$LassoCheckResult]: Loop: "[57] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[59] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-02-17 22:45:49,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2522, now seen corresponding path program 1 times [2025-02-17 22:45:49,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:49,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250736826] [2025-02-17 22:45:49,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:49,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:49,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:49,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:49,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:49,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:49,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:49,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:49,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:49,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:49,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:49,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:49,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2787, now seen corresponding path program 1 times [2025-02-17 22:45:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:49,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936176433] [2025-02-17 22:45:49,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:49,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:49,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:49,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:49,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:49,325 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:49,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:49,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:49,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:49,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:49,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:49,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2425468, now seen corresponding path program 1 times [2025-02-17 22:45:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:49,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063749062] [2025-02-17 22:45:49,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:49,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:49,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:49,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:49,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:49,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:49,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:49,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:49,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:49,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:49,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:49,402 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:49,403 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:49,403 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:49,403 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:49,403 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:49,403 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:49,403 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:49,403 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:49,404 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:49,404 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:49,404 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:49,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:49,466 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:49,466 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:49,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:49,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:49,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:49,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:45:49,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:49,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:49,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:49,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:49,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:49,499 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:49,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-17 22:45:49,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:49,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:49,577 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:49,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-17 22:45:49,583 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:49,583 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:49,583 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:49,583 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:49,583 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:49,583 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:49,583 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:49,583 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:49,583 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:45:49,583 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:49,583 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:49,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:49,613 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:49,616 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:49,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:49,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:49,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:49,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-17 22:45:49,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:49,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:49,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:49,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:49,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:49,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:49,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:49,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:49,644 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:49,649 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:49,650 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:49,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:49,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:49,655 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:49,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-17 22:45:49,658 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:49,658 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:49,659 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:49,659 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:45:49,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-17 22:45:49,667 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:49,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:49,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:49,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:49,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:49,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:49,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:49,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:49,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:49,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:49,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:49,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:49,714 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:49,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:49,759 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:49,785 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 188 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:49,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:45:49,929 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 188 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 648 states and 1998 transitions. Complement of second has 7 states. [2025-02-17 22:45:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-02-17 22:45:49,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:45:49,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:49,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:45:49,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:49,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:45:49,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:49,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 648 states and 1998 transitions. [2025-02-17 22:45:49,976 INFO L131 ngComponentsAnalysis]: Automaton has 74 accepting balls. 174 [2025-02-17 22:45:50,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 648 states to 417 states and 1305 transitions. [2025-02-17 22:45:50,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 263 [2025-02-17 22:45:50,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 343 [2025-02-17 22:45:50,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 417 states and 1305 transitions. [2025-02-17 22:45:50,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:50,016 INFO L218 hiAutomatonCegarLoop]: Abstraction has 417 states and 1305 transitions. [2025-02-17 22:45:50,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 1305 transitions. [2025-02-17 22:45:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 270. [2025-02-17 22:45:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 3.2333333333333334) internal successors, (873), 269 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 873 transitions. [2025-02-17 22:45:50,057 INFO L240 hiAutomatonCegarLoop]: Abstraction has 270 states and 873 transitions. [2025-02-17 22:45:50,057 INFO L432 stractBuchiCegarLoop]: Abstraction has 270 states and 873 transitions. [2025-02-17 22:45:50,057 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:45:50,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 873 transitions. [2025-02-17 22:45:50,060 INFO L131 ngComponentsAnalysis]: Automaton has 57 accepting balls. 140 [2025-02-17 22:45:50,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:50,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:50,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:45:50,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:50,062 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L12: Formula: (= v_f_6 0) InVars {} OutVars{f=v_f_6} AuxVars[] AssignedVars[f]" "[73] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] L12-1-->$Ultimate##0: 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]" "[79] L13-->L43: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-02-17 22:45:50,062 INFO L754 eck$LassoCheckResult]: Loop: "[67] L43-->L45: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L45-->L43: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:45:50,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:50,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2426077, now seen corresponding path program 1 times [2025-02-17 22:45:50,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:50,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739539364] [2025-02-17 22:45:50,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:50,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:50,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:50,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:50,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:50,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:50,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:50,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:50,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:50,077 INFO L85 PathProgramCache]: Analyzing trace with hash 3107, now seen corresponding path program 1 times [2025-02-17 22:45:50,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:50,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573509339] [2025-02-17 22:45:50,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:50,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:50,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:50,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:50,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,080 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:50,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:50,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:50,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:50,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1963505153, now seen corresponding path program 1 times [2025-02-17 22:45:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:50,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111896171] [2025-02-17 22:45:50,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:50,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:50,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:50,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,091 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:50,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:45:50,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:45:50,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:50,119 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:50,119 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:50,119 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:50,119 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:50,119 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:50,119 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,119 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:50,119 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:50,119 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:50,119 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:50,119 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:50,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:50,136 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:50,137 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:50,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,139 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:50,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-17 22:45:50,142 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:50,142 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:50,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:45:50,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:50,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-17 22:45:50,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:50,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:50,226 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:50,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:45:50,230 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:50,231 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:50,231 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:50,231 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:50,231 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:50,231 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,231 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:50,231 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:50,231 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:45:50,231 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:50,231 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:50,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:50,252 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:50,253 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:50,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,255 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:50,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-17 22:45:50,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:50,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:50,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:50,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:50,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:50,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:50,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:50,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:50,273 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:50,279 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:45:50,279 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:45:50,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,286 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:50,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-17 22:45:50,287 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:50,287 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:50,287 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:50,287 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x2) = 1*w - 1*x2 Supporting invariants [] [2025-02-17 22:45:50,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:50,294 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:50,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:50,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:45:50,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:45:50,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:50,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:50,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:50,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:50,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:50,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:50,321 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:50,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:50,334 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:50,334 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 270 states and 873 transitions. cyclomatic complexity: 680 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:50,378 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 270 states and 873 transitions. cyclomatic complexity: 680. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 725 states and 2571 transitions. Complement of second has 6 states. [2025-02-17 22:45:50,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-02-17 22:45:50,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:45:50,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:50,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:45:50,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:50,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:45:50,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:50,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 725 states and 2571 transitions. [2025-02-17 22:45:50,388 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 94 [2025-02-17 22:45:50,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 725 states to 433 states and 1530 transitions. [2025-02-17 22:45:50,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2025-02-17 22:45:50,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 278 [2025-02-17 22:45:50,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 1530 transitions. [2025-02-17 22:45:50,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:50,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 433 states and 1530 transitions. [2025-02-17 22:45:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 1530 transitions. [2025-02-17 22:45:50,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 356. [2025-02-17 22:45:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 356 states have (on average 3.662921348314607) internal successors, (1304), 355 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1304 transitions. [2025-02-17 22:45:50,417 INFO L240 hiAutomatonCegarLoop]: Abstraction has 356 states and 1304 transitions. [2025-02-17 22:45:50,417 INFO L432 stractBuchiCegarLoop]: Abstraction has 356 states and 1304 transitions. [2025-02-17 22:45:50,417 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:45:50,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 356 states and 1304 transitions. [2025-02-17 22:45:50,419 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 94 [2025-02-17 22:45:50,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:50,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:50,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:45:50,420 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:50,420 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L12: Formula: (= v_f_6 0) InVars {} OutVars{f=v_f_6} AuxVars[] AssignedVars[f]" "[73] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[56] L23-->L27: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[76] L12-1-->$Ultimate##0: 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]" "[61] $Ultimate##0-->L34-1: Formula: (< 1 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-02-17 22:45:50,420 INFO L754 eck$LassoCheckResult]: Loop: "[63] L34-1-->L36: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[65] L36-->L34-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-02-17 22:45:50,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash 75189135, now seen corresponding path program 1 times [2025-02-17 22:45:50,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:50,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614995774] [2025-02-17 22:45:50,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:50,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:50,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:50,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:50,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:50,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:45:50,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614995774] [2025-02-17 22:45:50,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614995774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:45:50,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:45:50,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-17 22:45:50,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149737153] [2025-02-17 22:45:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:45:50,453 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:45:50,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:50,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2025-02-17 22:45:50,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:50,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639321454] [2025-02-17 22:45:50,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:50,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:50,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:50,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:50,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:50,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:50,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:50,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:50,472 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:50,472 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:50,472 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:50,473 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:50,473 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:50,473 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,473 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:50,473 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:50,473 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:45:50,473 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:50,473 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:50,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:50,492 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:50,492 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:50,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,494 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:50,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-17 22:45:50,499 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:50,499 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:50,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:50,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,517 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:50,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-17 22:45:50,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:50,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:50,585 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:50,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-17 22:45:50,588 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:50,589 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:50,589 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:50,589 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:50,589 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:50,589 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,589 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:50,589 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:50,589 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:45:50,589 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:50,589 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:50,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:50,604 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:50,604 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:50,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,606 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:50,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-17 22:45:50,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:50,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:50,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:50,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:50,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:50,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:50,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:50,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:50,620 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:50,621 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:50,621 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:50,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,623 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:50,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-17 22:45:50,625 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:50,625 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:50,625 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:50,625 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x1) = -1*y + 1*x1 Supporting invariants [] [2025-02-17 22:45:50,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-17 22:45:50,631 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:50,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:50,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:45:50,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:45:50,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:50,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:50,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:50,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:50,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:50,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:50,667 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:50,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:50,686 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:50,686 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 356 states and 1304 transitions. cyclomatic complexity: 1028 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:50,742 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 356 states and 1304 transitions. cyclomatic complexity: 1028. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1177 states and 4222 transitions. Complement of second has 7 states. [2025-02-17 22:45:50,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-02-17 22:45:50,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:45:50,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:50,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:45:50,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:50,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:45:50,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:50,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1177 states and 4222 transitions. [2025-02-17 22:45:50,757 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 94 [2025-02-17 22:45:50,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1177 states to 643 states and 2243 transitions. [2025-02-17 22:45:50,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255 [2025-02-17 22:45:50,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2025-02-17 22:45:50,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 643 states and 2243 transitions. [2025-02-17 22:45:50,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:50,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 643 states and 2243 transitions. [2025-02-17 22:45:50,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states and 2243 transitions. [2025-02-17 22:45:50,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 432. [2025-02-17 22:45:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 432 states have (on average 3.6550925925925926) internal successors, (1579), 431 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1579 transitions. [2025-02-17 22:45:50,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 432 states and 1579 transitions. [2025-02-17 22:45:50,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:45:50,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:45:50,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:45:50,781 INFO L87 Difference]: Start difference. First operand 432 states and 1579 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:45:50,796 INFO L93 Difference]: Finished difference Result 124 states and 320 transitions. [2025-02-17 22:45:50,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 320 transitions. [2025-02-17 22:45:50,797 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2025-02-17 22:45:50,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 119 states and 305 transitions. [2025-02-17 22:45:50,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-02-17 22:45:50,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2025-02-17 22:45:50,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 305 transitions. [2025-02-17 22:45:50,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:50,798 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 305 transitions. [2025-02-17 22:45:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 305 transitions. [2025-02-17 22:45:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-17 22:45:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 2.563025210084034) internal successors, (305), 118 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 305 transitions. [2025-02-17 22:45:50,802 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 305 transitions. [2025-02-17 22:45:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:45:50,803 INFO L432 stractBuchiCegarLoop]: Abstraction has 119 states and 305 transitions. [2025-02-17 22:45:50,803 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:45:50,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 305 transitions. [2025-02-17 22:45:50,804 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2025-02-17 22:45:50,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:45:50,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:45:50,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:45:50,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:45:50,804 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L12: Formula: (= v_f_6 0) InVars {} OutVars{f=v_f_6} AuxVars[] AssignedVars[f]" "[73] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[57] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[76] L12-1-->$Ultimate##0: 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]" "[79] L13-->L43: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[66] L43-->L47: Formula: (<= v_w_2 v_x2_4) InVars {x2=v_x2_4, w=v_w_2} OutVars{x2=v_x2_4, w=v_w_2} AuxVars[] AssignedVars[]" "[68] L47-->thread3FINAL: Formula: (= v_f_4 (+ v_f_5 1)) InVars {f=v_f_5} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[61] $Ultimate##0-->L34-1: Formula: (< 1 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[59] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[56] L23-->L27: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" [2025-02-17 22:45:50,804 INFO L754 eck$LassoCheckResult]: Loop: "[63] L34-1-->L36: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[65] L36-->L34-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-02-17 22:45:50,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash 171631286, now seen corresponding path program 1 times [2025-02-17 22:45:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573745169] [2025-02-17 22:45:50,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:45:50,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:50,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:45:50,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:45:50,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:50,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:45:50,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573745169] [2025-02-17 22:45:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573745169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:45:50,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:45:50,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:45:50,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867048929] [2025-02-17 22:45:50,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:45:50,847 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:45:50,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 2 times [2025-02-17 22:45:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:45:50,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353224065] [2025-02-17 22:45:50,847 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-17 22:45:50,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:45:50,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:50,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:50,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-17 22:45:50,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,850 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:45:50,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:50,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:50,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:50,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:45:50,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:45:50,863 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:50,863 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:50,863 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:50,863 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:50,863 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:45:50,863 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,863 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:50,863 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:50,863 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:45:50,863 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:50,863 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:50,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:50,877 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:50,877 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:45:50,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,879 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:50,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-17 22:45:50,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:45:50,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:50,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-17 22:45:50,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,899 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:50,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-17 22:45:50,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:45:50,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:45:50,964 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:45:50,968 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-02-17 22:45:50,968 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:45:50,968 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:45:50,968 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:45:50,968 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:45:50,968 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:45:50,968 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,968 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:45:50,968 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:45:50,968 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:45:50,968 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:45:50,968 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:45:50,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:45:50,989 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:45:50,989 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:45:50,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:50,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:50,991 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:50,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-17 22:45:50,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:45:51,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:45:51,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:45:51,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:45:51,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:45:51,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:45:51,004 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:45:51,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:45:51,006 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:45:51,007 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:45:51,008 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:45:51,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:45:51,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:45:51,010 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:45:51,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-17 22:45:51,011 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:45:51,011 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:45:51,011 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:45:51,011 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, y) = 1*x1 - 1*y Supporting invariants [] [2025-02-17 22:45:51,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-17 22:45:51,016 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:45:51,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:45:51,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:45:51,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:45:51,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:51,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:45:51,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:51,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:45:51,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:45:51,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:45:51,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:45:51,051 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:45:51,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:45:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:45:51,061 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-02-17 22:45:51,061 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 119 states and 305 transitions. cyclomatic complexity: 217 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:51,080 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 119 states and 305 transitions. cyclomatic complexity: 217. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 177 states and 446 transitions. Complement of second has 6 states. [2025-02-17 22:45:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:45:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-02-17 22:45:51,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:45:51,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:51,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 12 letters. Loop has 2 letters. [2025-02-17 22:45:51,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:51,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 10 letters. Loop has 4 letters. [2025-02-17 22:45:51,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:45:51,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 446 transitions. [2025-02-17 22:45:51,083 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 16 [2025-02-17 22:45:51,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 103 states and 258 transitions. [2025-02-17 22:45:51,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-02-17 22:45:51,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2025-02-17 22:45:51,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 258 transitions. [2025-02-17 22:45:51,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:45:51,084 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 258 transitions. [2025-02-17 22:45:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 258 transitions. [2025-02-17 22:45:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-02-17 22:45:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 2.504854368932039) internal successors, (258), 102 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 258 transitions. [2025-02-17 22:45:51,087 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 258 transitions. [2025-02-17 22:45:51,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:45:51,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:45:51,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:45:51,088 INFO L87 Difference]: Start difference. First operand 103 states and 258 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:45:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:45:51,095 INFO L93 Difference]: Finished difference Result 46 states and 100 transitions. [2025-02-17 22:45:51,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 100 transitions. [2025-02-17 22:45:51,096 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:51,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2025-02-17 22:45:51,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:45:51,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:45:51,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:45:51,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:45:51,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:51,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-17 22:45:51,098 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:45:51,098 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:45:51,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:45:51,098 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:45:51,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:45:51,106 INFO L201 PluginConnector]: Adding new model m4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:45:51 BoogieIcfgContainer [2025-02-17 22:45:51,106 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:45:51,106 INFO L158 Benchmark]: Toolchain (without parser) took 2233.04ms. Allocated memory was 163.6MB in the beginning and 167.8MB in the end (delta: 4.2MB). Free memory was 88.5MB in the beginning and 29.2MB in the end (delta: 59.3MB). Peak memory consumption was 64.3MB. Max. memory is 8.0GB. [2025-02-17 22:45:51,106 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.88ms. Allocated memory is still 163.6MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:51,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.85ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 87.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:51,107 INFO L158 Benchmark]: Boogie Preprocessor took 9.44ms. Allocated memory is still 163.6MB. Free memory was 87.4MB in the beginning and 86.7MB in the end (delta: 682.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:45:51,107 INFO L158 Benchmark]: RCFGBuilder took 135.26ms. Allocated memory is still 163.6MB. Free memory was 86.5MB in the beginning and 77.8MB in the end (delta: 8.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-02-17 22:45:51,107 INFO L158 Benchmark]: BuchiAutomizer took 2068.93ms. Allocated memory was 163.6MB in the beginning and 167.8MB in the end (delta: 4.2MB). Free memory was 77.6MB in the beginning and 29.2MB in the end (delta: 48.4MB). Peak memory consumption was 55.9MB. Max. memory is 8.0GB. [2025-02-17 22:45:51,108 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.88ms. Allocated memory is still 163.6MB. Free memory is still 89.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 15.85ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 87.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 9.44ms. Allocated memory is still 163.6MB. Free memory was 87.4MB in the beginning and 86.7MB in the end (delta: 682.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 135.26ms. Allocated memory is still 163.6MB. Free memory was 86.5MB in the beginning and 77.8MB in the end (delta: 8.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 2068.93ms. Allocated memory was 163.6MB in the beginning and 167.8MB in the end (delta: 4.2MB). Free memory was 77.6MB in the beginning and 29.2MB in the end (delta: 48.4MB). Peak memory consumption was 55.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function w + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 435 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 120 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 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: 42ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:45:51,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-17 22:45:51,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:45:51,517 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-02-17 22:45:51,720 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...