/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 --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/bb5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:40,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:40,099 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:48:40,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:40,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:40,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:40,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:40,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:40,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:40,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:40,130 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:40,130 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:40,130 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:40,130 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:40,130 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:40,130 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:40,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:40,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:40,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:40,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:40,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:40,132 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:40,132 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:48:40,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:40,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:40,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:40,368 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:40,368 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:40,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/bb5.c.bpl [2025-02-17 22:48:40,369 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/bb5.c.bpl' [2025-02-17 22:48:40,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:40,381 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:40,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:40,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:40,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:40,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,396 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:40,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:40,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:40,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:40,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:40,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,404 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:40,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:40,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:40,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:40,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/1) ... [2025-02-17 22:48:40,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:40,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:40,435 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:48:40,437 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:48:40,455 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:40,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:40,455 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:40,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:40,455 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:40,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:40,456 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:48:40,489 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:40,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:40,537 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:40,537 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:40,543 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:40,544 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:40,544 INFO L201 PluginConnector]: Adding new model bb5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:40 BoogieIcfgContainer [2025-02-17 22:48:40,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:40,545 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:40,545 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:40,548 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:40,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:40,549 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:40" (1/2) ... [2025-02-17 22:48:40,554 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49d954e9 and model type bb5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:40, skipping insertion in model container [2025-02-17 22:48:40,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:40,554 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:40" (2/2) ... [2025-02-17 22:48:40,555 INFO L363 chiAutomizerObserver]: Analyzing ICFG bb5.c.bpl [2025-02-17 22:48:40,598 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-17 22:48:40,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 30 transitions, 74 flow [2025-02-17 22:48:40,648 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-02-17 22:48:40,649 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-17 22:48:40,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-02-17 22:48:40,653 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 30 transitions, 74 flow [2025-02-17 22:48:40,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2025-02-17 22:48:40,660 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:40,956 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:40,957 INFO L101 AmpleReduction]: Number of pruned transitions: 34, Number of non-trivial ample sets: 62 [2025-02-17 22:48:40,957 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 42 [2025-02-17 22:48:40,962 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:40,963 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:40,963 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:40,963 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:40,963 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:40,963 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:40,963 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:40,963 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:40,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 101 states, 100 states have (on average 1.84) internal successors, (184), 100 states have internal predecessors, (184), 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:48:40,985 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 65 [2025-02-17 22:48:40,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:40,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:40,990 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:48:40,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:40,991 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:40,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 101 states, 100 states have (on average 1.84) internal successors, (184), 100 states have internal predecessors, (184), 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:48:40,997 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 65 [2025-02-17 22:48:40,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:40,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:40,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:48:40,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:41,004 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[88] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:48:41,004 INFO L754 eck$LassoCheckResult]: Loop: "[67] L22-->L24: Formula: (< (+ v_x4_1 v_x1_1) v_z_2) InVars {x4=v_x4_1, x1=v_x1_1, z=v_z_2} OutVars{x4=v_x4_1, x1=v_x1_1, z=v_z_2} AuxVars[] AssignedVars[]" "[69] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[71] L25-->L22: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-02-17 22:48:41,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2940, now seen corresponding path program 1 times [2025-02-17 22:48:41,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:41,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568578504] [2025-02-17 22:48:41,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:41,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:41,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:41,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:41,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash 96388, now seen corresponding path program 1 times [2025-02-17 22:48:41,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:41,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122780095] [2025-02-17 22:48:41,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:41,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:41,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:41,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:41,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:41,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:41,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:41,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:41,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,106 INFO L85 PathProgramCache]: Analyzing trace with hash 87652137, now seen corresponding path program 1 times [2025-02-17 22:48:41,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:41,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481676743] [2025-02-17 22:48:41,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:41,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:41,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:41,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:41,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,114 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:41,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:41,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:41,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:41,150 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:41,150 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:41,150 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:41,150 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:41,151 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:41,151 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,151 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:41,151 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:41,151 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:41,151 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:41,151 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:41,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:41,221 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:41,222 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:41,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,225 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:48:41,225 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:48:41,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:41,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:41,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:48:41,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,249 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:48:41,250 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:48:41,258 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:41,258 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:41,345 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:41,349 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:48:41,349 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:41,349 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:41,350 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:41,350 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:41,350 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:41,350 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,350 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:41,350 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:41,350 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:41,350 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:41,350 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:41,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:41,376 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:41,378 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:41,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,381 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:48:41,383 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:48:41,392 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:48:41,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:41,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:41,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:41,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:41,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:41,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:41,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:41,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:41,413 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:41,414 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:41,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,418 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:48:41,419 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:48:41,420 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:41,420 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:41,421 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:41,421 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x4, z, x1) = -1*x4 + 1*z - 1*x1 Supporting invariants [] [2025-02-17 22:48:41,426 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:48:41,429 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:41,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:41,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:41,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:41,483 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:48:41,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:41,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:41,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:41,489 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:41,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:41,526 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:48:41,554 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:48:41,573 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 101 states, 100 states have (on average 1.84) internal successors, (184), 100 states have internal predecessors, (184), 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:48:41,666 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 101 states, 100 states have (on average 1.84) internal successors, (184), 100 states have internal predecessors, (184), 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). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 231 states and 449 transitions. Complement of second has 6 states. [2025-02-17 22:48:41,668 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:48:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:48:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2025-02-17 22:48:41,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 2 letters. Loop has 3 letters. [2025-02-17 22:48:41,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:41,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:48:41,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:41,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 2 letters. Loop has 6 letters. [2025-02-17 22:48:41,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:41,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 449 transitions. [2025-02-17 22:48:41,686 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 53 [2025-02-17 22:48:41,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 145 states and 291 transitions. [2025-02-17 22:48:41,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2025-02-17 22:48:41,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2025-02-17 22:48:41,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 291 transitions. [2025-02-17 22:48:41,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:41,694 INFO L218 hiAutomatonCegarLoop]: Abstraction has 145 states and 291 transitions. [2025-02-17 22:48:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 291 transitions. [2025-02-17 22:48:41,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 128. [2025-02-17 22:48:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 2.0) internal successors, (256), 127 states have internal predecessors, (256), 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:48:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 256 transitions. [2025-02-17 22:48:41,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 128 states and 256 transitions. [2025-02-17 22:48:41,722 INFO L432 stractBuchiCegarLoop]: Abstraction has 128 states and 256 transitions. [2025-02-17 22:48:41,722 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:41,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 256 transitions. [2025-02-17 22:48:41,724 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 53 [2025-02-17 22:48:41,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:41,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:41,724 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:41,724 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:41,726 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[88] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[91] L13-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-02-17 22:48:41,726 INFO L754 eck$LassoCheckResult]: Loop: "[78] L39-->L41: Formula: (< v_x3_5 v_z_6) InVars {x3=v_x3_5, z=v_z_6} OutVars{x3=v_x3_5, z=v_z_6} AuxVars[] AssignedVars[]" "[80] L41-->L39: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-02-17 22:48:41,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,729 INFO L85 PathProgramCache]: Analyzing trace with hash 91231, now seen corresponding path program 1 times [2025-02-17 22:48:41,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:41,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457827301] [2025-02-17 22:48:41,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:41,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:41,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:41,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:41,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,734 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:41,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:41,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:41,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:41,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2025-02-17 22:48:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:41,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745187239] [2025-02-17 22:48:41,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:41,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:41,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:41,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,747 INFO L85 PathProgramCache]: Analyzing trace with hash 87675489, now seen corresponding path program 1 times [2025-02-17 22:48:41,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:41,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348492526] [2025-02-17 22:48:41,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:41,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:41,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:41,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:41,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,756 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:41,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:41,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:41,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:41,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:41,773 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:41,773 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:41,773 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:41,773 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:41,773 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:41,773 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,773 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:41,773 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:41,773 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:41,773 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:41,773 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:41,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:41,798 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:41,798 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:41,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,801 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:48:41,802 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:48:41,803 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:41,803 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:41,823 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:48:41,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,825 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:48:41,828 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:48:41,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:41,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:41,894 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:41,899 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:48:41,899 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:41,899 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:41,899 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:41,899 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:41,899 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:41,899 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,899 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:41,899 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:41,899 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:41,899 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:41,899 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:41,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:41,918 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:41,919 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:41,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,921 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:48:41,922 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:48:41,923 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:48:41,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:41,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:41,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:41,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:41,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:41,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:41,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:41,937 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:41,938 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:41,939 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:41,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:41,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:41,940 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:48:41,942 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:41,942 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:41,942 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:41,942 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:48:41,944 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:48:41,948 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:48:41,949 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:41,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:41,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:41,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:41,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:41,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:41,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:41,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:41,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:41,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:41,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:41,975 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:41,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:41,990 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:48:41,990 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:48:41,991 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 128 states and 256 transitions. cyclomatic complexity: 154 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:42,058 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 128 states and 256 transitions. cyclomatic complexity: 154. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 312 states and 677 transitions. Complement of second has 6 states. [2025-02-17 22:48:42,060 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:48:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-02-17 22:48:42,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:48:42,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:42,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:48:42,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:42,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:48:42,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:42,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 677 transitions. [2025-02-17 22:48:42,067 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 39 [2025-02-17 22:48:42,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 186 states and 393 transitions. [2025-02-17 22:48:42,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2025-02-17 22:48:42,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2025-02-17 22:48:42,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 393 transitions. [2025-02-17 22:48:42,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:42,071 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 393 transitions. [2025-02-17 22:48:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 393 transitions. [2025-02-17 22:48:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2025-02-17 22:48:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 2.1666666666666665) internal successors, (364), 167 states have internal predecessors, (364), 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:48:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 364 transitions. [2025-02-17 22:48:42,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 168 states and 364 transitions. [2025-02-17 22:48:42,080 INFO L432 stractBuchiCegarLoop]: Abstraction has 168 states and 364 transitions. [2025-02-17 22:48:42,081 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:48:42,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 364 transitions. [2025-02-17 22:48:42,082 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 39 [2025-02-17 22:48:42,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:42,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:42,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:42,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:42,082 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[88] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[66] L22-->L27: Formula: (<= v_z_3 (+ v_x4_4 v_x1_4)) InVars {x4=v_x4_4, x1=v_x1_4, z=v_z_3} OutVars{x4=v_x4_4, x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[68] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[70] L28-->L29-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-02-17 22:48:42,082 INFO L754 eck$LassoCheckResult]: Loop: "[73] L29-1-->L31: Formula: (< (+ v_x5_2 v_x3_2) v_z_4) InVars {x5=v_x5_2, x3=v_x3_2, z=v_z_4} OutVars{x5=v_x5_2, x3=v_x3_2, z=v_z_4} AuxVars[] AssignedVars[]" "[75] L31-->L32: Formula: (= (+ v_x3_4 1) v_x3_3) InVars {x3=v_x3_4} OutVars{x3=v_x3_3} AuxVars[] AssignedVars[x3]" "[76] L32-->L29-1: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-02-17 22:48:42,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:42,083 INFO L85 PathProgramCache]: Analyzing trace with hash 87651144, now seen corresponding path program 1 times [2025-02-17 22:48:42,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:42,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488882599] [2025-02-17 22:48:42,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:42,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:42,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:42,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:42,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:42,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:42,127 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:48:42,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:42,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488882599] [2025-02-17 22:48:42,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488882599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:42,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:42,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:48:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813808289] [2025-02-17 22:48:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:42,137 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:48:42,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:42,137 INFO L85 PathProgramCache]: Analyzing trace with hash 102345, now seen corresponding path program 1 times [2025-02-17 22:48:42,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:42,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128219469] [2025-02-17 22:48:42,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:42,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:42,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:42,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:42,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:42,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:42,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:42,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:42,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:42,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:42,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:42,169 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:42,169 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:42,170 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:42,170 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:42,170 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:42,170 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:42,170 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:42,170 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:42,170 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:42,170 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:42,170 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:42,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:42,195 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:42,196 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:42,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:42,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:42,199 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:48:42,201 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:48:42,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:42,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:42,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:48:42,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:42,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:42,221 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:48:42,222 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:48:42,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:42,224 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:42,308 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:42,312 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:48:42,312 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:42,312 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:42,312 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:42,312 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:42,312 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:42,312 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:42,312 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:42,312 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:42,312 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:42,312 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:42,312 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:42,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:42,343 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:42,343 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:42,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:42,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:42,345 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:48:42,347 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:48:42,348 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:48:42,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:42,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:42,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:42,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:42,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:42,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:42,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:42,361 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:42,363 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:48:42,363 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:42,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:42,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:42,365 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:48:42,367 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:48:42,367 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:42,367 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:42,367 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:42,367 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5, x3) = 1*z - 1*x5 - 1*x3 Supporting invariants [] [2025-02-17 22:48:42,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:42,373 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:42,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:42,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:42,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:42,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:42,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:42,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:42,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:42,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:42,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:42,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:42,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:42,407 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-17 22:48:42,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:42,436 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:48:42,437 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:48:42,437 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 168 states and 364 transitions. cyclomatic complexity: 224 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:48:42,483 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 168 states and 364 transitions. cyclomatic complexity: 224. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 338 states and 792 transitions. Complement of second has 6 states. [2025-02-17 22:48:42,484 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:48:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:48:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-02-17 22:48:42,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:48:42,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:42,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:48:42,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:42,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-17 22:48:42,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:42,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 792 transitions. [2025-02-17 22:48:42,488 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 18 [2025-02-17 22:48:42,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 239 states and 572 transitions. [2025-02-17 22:48:42,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2025-02-17 22:48:42,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-02-17 22:48:42,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 239 states and 572 transitions. [2025-02-17 22:48:42,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:42,491 INFO L218 hiAutomatonCegarLoop]: Abstraction has 239 states and 572 transitions. [2025-02-17 22:48:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states and 572 transitions. [2025-02-17 22:48:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 212. [2025-02-17 22:48:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 212 states have (on average 2.4292452830188678) internal successors, (515), 211 states have internal predecessors, (515), 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:48:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 515 transitions. [2025-02-17 22:48:42,508 INFO L240 hiAutomatonCegarLoop]: Abstraction has 212 states and 515 transitions. [2025-02-17 22:48:42,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:48:42,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:48:42,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:48:42,511 INFO L87 Difference]: Start difference. First operand 212 states and 515 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:48:42,535 INFO L93 Difference]: Finished difference Result 79 states and 163 transitions. [2025-02-17 22:48:42,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 163 transitions. [2025-02-17 22:48:42,536 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-02-17 22:48:42,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 163 transitions. [2025-02-17 22:48:42,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-02-17 22:48:42,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-02-17 22:48:42,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 163 transitions. [2025-02-17 22:48:42,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:42,537 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 163 transitions. [2025-02-17 22:48:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 163 transitions. [2025-02-17 22:48:42,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-17 22:48:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 78 states have internal predecessors, (163), 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:48:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 163 transitions. [2025-02-17 22:48:42,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79 states and 163 transitions. [2025-02-17 22:48:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-17 22:48:42,544 INFO L432 stractBuchiCegarLoop]: Abstraction has 79 states and 163 transitions. [2025-02-17 22:48:42,544 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:48:42,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 163 transitions. [2025-02-17 22:48:42,544 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-02-17 22:48:42,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:42,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:42,545 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:48:42,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:42,545 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L13: Formula: (= v_x2_7 0) InVars {} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[88] L13-->L22: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[66] L22-->L27: Formula: (<= v_z_3 (+ v_x4_4 v_x1_4)) InVars {x4=v_x4_4, x1=v_x1_4, z=v_z_3} OutVars{x4=v_x4_4, x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[68] L27-->L28: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[91] L13-1-->L39: 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]" "[77] L39-->L43: Formula: (<= v_z_7 v_x3_8) InVars {x3=v_x3_8, z=v_z_7} OutVars{x3=v_x3_8, z=v_z_7} AuxVars[] AssignedVars[]" "[79] L43-->L44: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[70] L28-->L29-1: Formula: (<= 2 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" "[81] L44-->L45-1: Formula: (<= 2 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-02-17 22:48:42,545 INFO L754 eck$LassoCheckResult]: Loop: "[83] L45-1-->L47: Formula: (< v_x1_6 v_z_8) InVars {x1=v_x1_6, z=v_z_8} OutVars{x1=v_x1_6, z=v_z_8} AuxVars[] AssignedVars[]" "[85] L47-->L45-1: Formula: (= v_x1_7 (+ v_x1_8 1)) InVars {x1=v_x1_8} OutVars{x1=v_x1_7} AuxVars[] AssignedVars[x1]" [2025-02-17 22:48:42,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:42,546 INFO L85 PathProgramCache]: Analyzing trace with hash 445296330, now seen corresponding path program 1 times [2025-02-17 22:48:42,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:42,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785698024] [2025-02-17 22:48:42,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:42,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:42,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:48:42,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:48:42,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:42,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:42,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:42,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:48:42,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:48:42,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:42,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:42,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:42,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 1 times [2025-02-17 22:48:42,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:42,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506960450] [2025-02-17 22:48:42,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:42,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:42,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:42,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:42,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:42,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:42,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:42,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:42,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:42,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:42,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:42,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:42,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:42,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1566953812, now seen corresponding path program 1 times [2025-02-17 22:48:42,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:42,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390721208] [2025-02-17 22:48:42,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:42,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:42,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:48:42,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:48:42,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:42,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:42,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:42,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:48:42,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:48:42,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:42,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:42,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:42,597 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:42,597 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:42,597 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:42,597 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:42,597 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:42,597 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:42,597 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:42,597 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:42,597 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:48:42,597 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:42,597 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:42,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:42,612 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:42,612 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:42,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:42,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:42,629 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:48:42,631 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:48:42,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:42,632 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:42,649 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:48:42,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:42,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:42,651 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:48:42,652 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:48:42,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:42,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:42,716 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:42,720 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:48:42,720 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:42,720 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:42,720 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:42,720 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:42,720 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:42,720 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:42,720 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:42,720 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:42,720 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:48:42,720 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:42,720 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:42,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:42,735 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:42,736 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:42,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:42,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:42,737 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:48:42,739 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:48:42,740 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:48:42,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:42,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:42,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:42,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:42,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:42,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:42,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:42,752 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:42,754 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:42,755 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:42,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:42,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:42,757 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:48:42,758 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:48:42,758 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:42,758 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:42,758 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:42,758 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:48:42,763 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:48:42,764 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:42,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:42,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:48:42,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:48:42,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:42,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:42,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:42,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:42,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:42,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:42,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:42,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:42,802 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:42,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:42,813 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:48:42,813 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:48:42,814 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 163 transitions. cyclomatic complexity: 99 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:48:42,842 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 163 transitions. cyclomatic complexity: 99. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 117 states and 241 transitions. Complement of second has 6 states. [2025-02-17 22:48:42,842 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:48:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:48:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-02-17 22:48:42,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 9 letters. Loop has 2 letters. [2025-02-17 22:48:42,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:42,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-17 22:48:42,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:42,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 9 letters. Loop has 4 letters. [2025-02-17 22:48:42,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:42,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 241 transitions. [2025-02-17 22:48:42,844 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:42,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 0 states and 0 transitions. [2025-02-17 22:48:42,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:48:42,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:48:42,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:48:42,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:48:42,845 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:42,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:42,845 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:48:42,845 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:48:42,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:48:42,845 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:48:42,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:48:42,854 INFO L201 PluginConnector]: Adding new model bb5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:48:42 BoogieIcfgContainer [2025-02-17 22:48:42,854 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:48:42,855 INFO L158 Benchmark]: Toolchain (without parser) took 2473.71ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.2MB in the beginning and 37.5MB in the end (delta: 47.7MB). Peak memory consumption was 46.2MB. Max. memory is 8.0GB. [2025-02-17 22:48:42,855 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:42,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.90ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:42,855 INFO L158 Benchmark]: Boogie Preprocessor took 9.75ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 83.2MB in the end (delta: 695.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:48:42,855 INFO L158 Benchmark]: RCFGBuilder took 136.38ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 74.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:48:42,855 INFO L158 Benchmark]: BuchiAutomizer took 2309.23ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.1MB in the beginning and 37.5MB in the end (delta: 36.6MB). Peak memory consumption was 37.8MB. Max. memory is 8.0GB. [2025-02-17 22:48:42,856 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.13ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 15.90ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 9.75ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 83.2MB in the end (delta: 695.4kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 136.38ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 74.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2309.23ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.1MB in the beginning and 37.5MB in the end (delta: 36.6MB). Peak memory consumption was 37.8MB. 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 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x4 + -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 62 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, 163 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 187 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 104 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf93 smp100 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 41ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 342, Trivial Ample Sets caused by loops: 42, Number of non-trivial ample sets: 62, Number of pruned transitions: 34, Number of transitions in reduction automaton: 184, Number of states in reduction automaton: 101, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:48:42,863 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:48:43,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:43,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-17 22:48:43,466 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...