/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/me1-1p2c.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:39,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:39,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:24:39,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:39,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:39,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:39,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:39,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:39,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:39,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:39,096 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:39,096 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:39,097 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:39,097 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:39,098 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:39,098 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:39,098 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:39,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:39,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:39,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:39,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:39,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:39,100 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:39,100 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:39,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:39,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:39,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:39,348 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:39,349 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:39,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/me1-1p2c.c.bpl [2025-04-26 16:24:39,350 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/me1-1p2c.c.bpl' [2025-04-26 16:24:39,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:39,366 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:39,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:39,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:39,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:39,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:39" (1/1) ... [2025-04-26 16:24:39,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:39" (1/1) ... [2025-04-26 16:24:39,405 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:39,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:39,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:39,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:39,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:39,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:39" (1/1) ... [2025-04-26 16:24:39,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:39" (1/1) ... [2025-04-26 16:24:39,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:39" (1/1) ... [2025-04-26 16:24:39,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:39" (1/1) ... [2025-04-26 16:24:39,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:39" (1/1) ... [2025-04-26 16:24:39,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:39" (1/1) ... [2025-04-26 16:24:39,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:39" (1/1) ... [2025-04-26 16:24:39,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:39" (1/1) ... [2025-04-26 16:24:39,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:39" (1/1) ... [2025-04-26 16:24:39,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:39,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:39,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:39,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:39,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:39" (1/1) ... [2025-04-26 16:24:39,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:39,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:24:39,473 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:39,473 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:39,473 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:24:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:24:39,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:24:39,473 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:39,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:39,474 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:24:39,507 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:39,508 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:39,568 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:39,568 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:39,579 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:39,579 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:39,580 INFO L201 PluginConnector]: Adding new model me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:39 BoogieIcfgContainer [2025-04-26 16:24:39,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:39,580 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:39,580 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:39,585 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:39,586 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:39,586 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:39" (1/2) ... [2025-04-26 16:24:39,587 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38cd6592 and model type me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:39, skipping insertion in model container [2025-04-26 16:24:39,588 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:39,588 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:39" (2/2) ... [2025-04-26 16:24:39,589 INFO L376 chiAutomizerObserver]: Analyzing ICFG me1-1p2c.c.bpl [2025-04-26 16:24:39,639 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:24:39,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 16:24:39,688 INFO L116 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-04-26 16:24:39,690 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:24:39,693 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 41 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-04-26 16:24:39,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 16:24:39,696 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 64 flow [2025-04-26 16:24:39,696 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 23 transitions, 64 flow [2025-04-26 16:24:39,705 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:39,705 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:39,705 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:39,705 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:39,705 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:39,705 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:39,705 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:39,705 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:39,707 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:39,765 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 134 [2025-04-26 16:24:39,765 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:39,765 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:39,768 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:39,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:39,768 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:39,768 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 188 states, but on-demand construction may add more states [2025-04-26 16:24:39,774 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 134 [2025-04-26 16:24:39,774 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:39,774 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:39,774 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:39,774 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:39,778 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L14: Formula: (and (= v_g_5 0) (= v_f_1 0)) InVars {g=v_g_5, f=v_f_1} OutVars{g=v_g_5, f=v_f_1} AuxVars[] AssignedVars[]" "[78] L14-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:39,778 INFO L754 eck$LassoCheckResult]: Loop: "[62] L25-->L27: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[64] L27-->L25: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:24:39,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2713, now seen corresponding path program 1 times [2025-04-26 16:24:39,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:39,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178253096] [2025-04-26 16:24:39,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:39,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:39,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:39,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:39,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:39,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:39,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:39,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:39,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2025-04-26 16:24:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:39,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831536044] [2025-04-26 16:24:39,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:39,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:39,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:39,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:39,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:39,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:39,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:39,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:39,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:39,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2609179, now seen corresponding path program 1 times [2025-04-26 16:24:39,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:39,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476091728] [2025-04-26 16:24:39,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:39,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:39,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:39,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:39,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:39,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:39,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:39,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:39,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:39,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:39,937 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:39,939 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:39,940 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:39,940 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:39,940 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:39,940 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,940 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:39,940 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:39,940 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:39,940 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:39,940 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:39,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:39,988 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:39,989 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:39,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:39,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:39,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:39,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:24:39,996 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:39,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:40,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:24:40,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:40,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:24:40,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:40,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:40,097 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:40,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:40,103 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:40,103 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:40,103 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:40,103 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:40,103 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:40,103 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,103 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:40,103 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:40,103 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:40,103 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:40,103 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:40,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:40,130 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:40,133 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:40,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:40,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:24:40,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:40,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:40,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:40,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:40,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:40,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:40,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:40,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:40,158 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:40,163 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:40,163 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:40,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,166 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:40,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:24:40,168 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:40,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:24:40,172 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:40,173 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:40,173 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:24:40,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:40,181 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:40,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:40,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:40,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:40,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:40,248 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:40,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:40,323 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:40,325 INFO L70 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, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:40,491 INFO L74 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, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 676 states and 2053 transitions. Complement of second has 7 states. [2025-04-26 16:24:40,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 16:24:40,504 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:40,505 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,505 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:40,505 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,505 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:40,505 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 676 states and 2053 transitions. [2025-04-26 16:24:40,519 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 128 [2025-04-26 16:24:40,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 676 states to 479 states and 1487 transitions. [2025-04-26 16:24:40,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 309 [2025-04-26 16:24:40,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 399 [2025-04-26 16:24:40,530 INFO L74 IsDeterministic]: Start isDeterministic. Operand 479 states and 1487 transitions. [2025-04-26 16:24:40,530 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:40,530 INFO L218 hiAutomatonCegarLoop]: Abstraction has 479 states and 1487 transitions. [2025-04-26 16:24:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states and 1487 transitions. [2025-04-26 16:24:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 297. [2025-04-26 16:24:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 297 states have (on average 3.1986531986531985) internal successors, (in total 950), 296 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 950 transitions. [2025-04-26 16:24:40,571 INFO L240 hiAutomatonCegarLoop]: Abstraction has 297 states and 950 transitions. [2025-04-26 16:24:40,571 INFO L438 stractBuchiCegarLoop]: Abstraction has 297 states and 950 transitions. [2025-04-26 16:24:40,573 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:40,573 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 297 states and 950 transitions. [2025-04-26 16:24:40,576 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 128 [2025-04-26 16:24:40,576 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:40,576 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:40,576 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:24:40,576 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:40,577 INFO L752 eck$LassoCheckResult]: Stem: "[54] $Ultimate##0-->L14: Formula: (and (= v_g_5 0) (= v_f_1 0)) InVars {g=v_g_5, f=v_f_1} OutVars{g=v_g_5, f=v_f_1} AuxVars[] AssignedVars[]" "[78] L14-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[81] L14-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]" "[66] $Ultimate##0-->L38-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[61] L25-->L29: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" [2025-04-26 16:24:40,577 INFO L754 eck$LassoCheckResult]: Loop: "[68] L38-1-->L38: Formula: (< v_y2_2 v_x2_6) InVars {y2=v_y2_2, x2=v_x2_6} OutVars{y2=v_y2_2, x2=v_x2_6} AuxVars[] AssignedVars[]" "[70] L38-->L38-1: Formula: (and (< v_y2_7 v_x2_16) (= (+ v_x2_15 1) v_x2_16)) InVars {y2=v_y2_7, x2=v_x2_16} OutVars{y2=v_y2_7, x2=v_x2_15} AuxVars[] AssignedVars[x2]" [2025-04-26 16:24:40,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,578 INFO L85 PathProgramCache]: Analyzing trace with hash 80902931, now seen corresponding path program 1 times [2025-04-26 16:24:40,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:40,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165886930] [2025-04-26 16:24:40,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:40,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:40,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:40,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:40,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:40,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:24:40,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165886930] [2025-04-26 16:24:40,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165886930] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:24:40,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:24:40,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:24:40,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700071414] [2025-04-26 16:24:40,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:24:40,613 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:24:40,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,614 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2025-04-26 16:24:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:40,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670453898] [2025-04-26 16:24:40,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:40,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:40,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:40,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:40,639 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:40,639 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:40,639 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:40,639 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:40,639 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:40,639 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,639 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:40,639 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:40,639 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:40,639 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:40,639 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:40,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:40,661 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:40,661 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:40,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:40,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:24:40,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:40,667 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:40,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:40,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:40,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:24:40,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:40,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:40,762 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:40,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:24:40,767 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:40,767 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:40,767 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:40,767 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:40,768 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:40,768 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,768 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:40,768 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:40,768 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-1p2c.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:40,768 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:40,768 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:40,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:40,787 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:40,787 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:40,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,790 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:40,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:24:40,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:24:40,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:40,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:40,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:40,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:40,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:40,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:40,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:40,807 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:40,811 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:40,811 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:40,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:40,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:40,813 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:24:40,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:24:40,816 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:40,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:40,819 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:40,819 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:40,820 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, y2) = 1*x2 - 1*y2 Supporting invariants [] [2025-04-26 16:24:40,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:40,827 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:40,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:40,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:40,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:40,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:40,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:40,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:40,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:40,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:40,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:40,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:40,864 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:40,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:40,881 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:24:40,881 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 297 states and 950 transitions. cyclomatic complexity: 730 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:40,950 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 297 states and 950 transitions. cyclomatic complexity: 730. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 687 states and 2054 transitions. Complement of second has 7 states. [2025-04-26 16:24:40,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-26 16:24:40,951 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:40,951 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,951 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:24:40,952 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,952 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:24:40,952 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:40,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 687 states and 2054 transitions. [2025-04-26 16:24:40,959 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 56 [2025-04-26 16:24:40,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 687 states to 192 states and 590 transitions. [2025-04-26 16:24:40,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2025-04-26 16:24:40,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2025-04-26 16:24:40,963 INFO L74 IsDeterministic]: Start isDeterministic. Operand 192 states and 590 transitions. [2025-04-26 16:24:40,964 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:40,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 192 states and 590 transitions. [2025-04-26 16:24:40,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 590 transitions. [2025-04-26 16:24:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-04-26 16:24:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 192 states have (on average 3.0729166666666665) internal successors, (in total 590), 191 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 590 transitions. [2025-04-26 16:24:40,972 INFO L240 hiAutomatonCegarLoop]: Abstraction has 192 states and 590 transitions. [2025-04-26 16:24:40,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:24:40,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:24:40,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:24:40,975 INFO L87 Difference]: Start difference. First operand 192 states and 590 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:24:40,982 INFO L93 Difference]: Finished difference Result 16 states and 29 transitions. [2025-04-26 16:24:40,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 29 transitions. [2025-04-26 16:24:40,983 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:40,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2025-04-26 16:24:40,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:40,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:40,983 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:40,983 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:40,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:40,983 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:40,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:24:40,985 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:40,985 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:40,985 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:40,985 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:40,985 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:40,990 INFO L201 PluginConnector]: Adding new model me1-1p2c.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:40 BoogieIcfgContainer [2025-04-26 16:24:40,990 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:40,990 INFO L158 Benchmark]: Toolchain (without parser) took 1624.22ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.8MB in the beginning and 63.1MB in the end (delta: 23.7MB). Peak memory consumption was 24.3MB. Max. memory is 8.0GB. [2025-04-26 16:24:40,990 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:40,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.11ms. Allocated memory is still 159.4MB. Free memory was 86.8MB in the beginning and 85.0MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:24:40,991 INFO L158 Benchmark]: Boogie Preprocessor took 22.64ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:40,991 INFO L158 Benchmark]: RCFGBuilder took 148.94ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 74.6MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:40,991 INFO L158 Benchmark]: BuchiAutomizer took 1409.44ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.5MB in the beginning and 63.1MB in the end (delta: 11.4MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2025-04-26 16:24:40,992 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.19ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.11ms. Allocated memory is still 159.4MB. Free memory was 86.8MB in the beginning and 85.0MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.64ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 83.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 148.94ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 74.6MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1409.44ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.5MB in the beginning and 63.1MB in the end (delta: 11.4MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 182 StatesRemovedByMinimization, 1 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 39 mSDtfsCounter, 102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 39ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:24:41,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...