/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:25:30,447 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:25:30,517 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:25:30,551 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:25:30,551 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:25:30,552 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:25:30,553 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:25:30,554 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:25:30,554 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:25:30,557 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:25:30,558 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:25:30,558 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:25:30,558 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:25:30,559 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:25:30,560 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:25:30,560 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:25:30,561 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:25:30,561 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:25:30,561 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:25:30,561 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:25:30,561 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:25:30,563 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:25:30,563 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:25:30,563 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:25:30,563 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:25:30,564 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:25:30,564 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:25:30,564 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:25:30,564 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:25:30,565 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:25:30,566 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:25:30,566 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:25:30,566 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:25:30,567 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:25:30,568 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:25:30,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:25:30,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:25:30,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:25:30,839 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:25:30,840 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:25:30,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl [2023-10-12 17:25:30,841 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl' [2023-10-12 17:25:30,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:25:30,868 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:25:30,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:25:30,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:25:30,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:25:30,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:30" (1/1) ... [2023-10-12 17:25:30,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:30" (1/1) ... [2023-10-12 17:25:30,895 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:25:30,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:25:30,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:25:30,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:25:30,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:25:30,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:30" (1/1) ... [2023-10-12 17:25:30,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:30" (1/1) ... [2023-10-12 17:25:30,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:30" (1/1) ... [2023-10-12 17:25:30,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:30" (1/1) ... [2023-10-12 17:25:30,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:30" (1/1) ... [2023-10-12 17:25:30,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:30" (1/1) ... [2023-10-12 17:25:30,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:30" (1/1) ... [2023-10-12 17:25:30,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:30" (1/1) ... [2023-10-12 17:25:30,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:25:30,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:25:30,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:25:30,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:25:30,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:30" (1/1) ... [2023-10-12 17:25:30,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:30,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:30,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:30,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:25:31,008 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:25:31,009 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:25:31,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:25:31,012 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:25:31,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:25:31,013 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:25:31,013 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:25:31,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:25:31,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:25:31,014 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:25:31,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:25:31,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:25:31,015 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:25:31,064 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:25:31,066 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:25:31,178 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:25:31,205 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:25:31,205 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:25:31,207 INFO L201 PluginConnector]: Adding new model ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:25:31 BoogieIcfgContainer [2023-10-12 17:25:31,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:25:31,208 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:25:31,208 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:25:31,214 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:25:31,214 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:25:31,217 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:30" (1/2) ... [2023-10-12 17:25:31,219 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48975f9f and model type ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:25:31, skipping insertion in model container [2023-10-12 17:25:31,219 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:25:31,219 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:25:31" (2/2) ... [2023-10-12 17:25:31,221 INFO L332 chiAutomizerObserver]: Analyzing ICFG ring.wvr.bpl [2023-10-12 17:25:31,332 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:25:31,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 114 flow [2023-10-12 17:25:31,417 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-10-12 17:25:31,417 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:25:31,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:25:31,422 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 114 flow [2023-10-12 17:25:31,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 96 flow [2023-10-12 17:25:31,429 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:25:31,440 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 96 flow [2023-10-12 17:25:31,442 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 96 flow [2023-10-12 17:25:31,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 96 flow [2023-10-12 17:25:31,456 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-10-12 17:25:31,456 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:25:31,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:25:31,458 INFO L119 LiptonReduction]: Number of co-enabled transitions 634 [2023-10-12 17:25:32,208 INFO L134 LiptonReduction]: Checked pairs total: 565 [2023-10-12 17:25:32,208 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-10-12 17:25:32,220 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:25:32,220 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:25:32,220 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:25:32,221 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:25:32,221 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:25:32,221 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:25:32,221 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:25:32,221 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:25:32,222 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 places, 19 transitions, 56 flow [2023-10-12 17:25:32,226 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:32,226 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-10-12 17:25:32,226 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:25:32,226 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:32,229 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:25:32,229 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 places, 19 transitions, 56 flow [2023-10-12 17:25:32,230 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:32,230 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-10-12 17:25:32,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:25:32,231 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:32,234 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 59#[L98, $Ultimate##0, $Ultimate##0]true [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 61#[L98, L58-1, $Ultimate##0]true [2023-10-12 17:25:32,235 INFO L750 eck$LassoCheckResult]: Loop: 61#[L98, L58-1, $Ultimate##0]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 61#[L98, L58-1, $Ultimate##0]true [2023-10-12 17:25:32,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:32,239 INFO L85 PathProgramCache]: Analyzing trace with hash 4190712, now seen corresponding path program 1 times [2023-10-12 17:25:32,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:32,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884095489] [2023-10-12 17:25:32,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:32,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:32,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash 200, now seen corresponding path program 1 times [2023-10-12 17:25:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:32,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395005810] [2023-10-12 17:25:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:32,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:32,400 INFO L85 PathProgramCache]: Analyzing trace with hash 129912241, now seen corresponding path program 1 times [2023-10-12 17:25:32,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:32,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917286686] [2023-10-12 17:25:32,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:32,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:25:32,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:32,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917286686] [2023-10-12 17:25:32,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917286686] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:32,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:25:32,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:25:32,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550516248] [2023-10-12 17:25:32,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:32,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:32,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:25:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:25:32,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 56 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:32,602 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:32,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:32,688 INFO L124 PetriNetUnfolderBase]: 152/232 cut-off events. [2023-10-12 17:25:32,689 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:25:32,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 232 events. 152/232 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 658 event pairs, 24 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 430. Up to 176 conditions per place. [2023-10-12 17:25:32,693 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2023-10-12 17:25:32,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 27 transitions, 132 flow [2023-10-12 17:25:32,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 132 flow [2023-10-12 17:25:32,713 INFO L124 PetriNetUnfolderBase]: 152/232 cut-off events. [2023-10-12 17:25:32,714 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:25:32,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 232 events. 152/232 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 664 event pairs, 24 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 430. Up to 176 conditions per place. [2023-10-12 17:25:32,714 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 27 places, 27 transitions, 132 flow [2023-10-12 17:25:32,716 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 27 places, 27 transitions, 132 flow [2023-10-12 17:25:32,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:25:32,723 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 27 transitions, 132 flow [2023-10-12 17:25:32,723 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:25:32,723 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 places, 27 transitions, 132 flow [2023-10-12 17:25:32,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:32,726 INFO L124 PetriNetUnfolderBase]: 11/25 cut-off events. [2023-10-12 17:25:32,726 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-10-12 17:25:32,726 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:32,727 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 83#[L97-1, L34-1]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 85#[L97-1, L35-1]true [2023-10-12 17:25:32,727 INFO L750 eck$LassoCheckResult]: Loop: 85#[L97-1, L35-1]true [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 83#[L97-1, L34-1]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 85#[L97-1, L35-1]true [2023-10-12 17:25:32,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:32,728 INFO L85 PathProgramCache]: Analyzing trace with hash 4190958, now seen corresponding path program 1 times [2023-10-12 17:25:32,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:32,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263671686] [2023-10-12 17:25:32,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:32,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:32,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash 6268, now seen corresponding path program 1 times [2023-10-12 17:25:32,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:32,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159231309] [2023-10-12 17:25:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:32,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:32,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:32,767 INFO L85 PathProgramCache]: Analyzing trace with hash -267451351, now seen corresponding path program 1 times [2023-10-12 17:25:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:32,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828739700] [2023-10-12 17:25:32,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:32,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:25:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:32,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828739700] [2023-10-12 17:25:32,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828739700] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:32,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:25:32,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:25:32,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900858529] [2023-10-12 17:25:32,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:32,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:32,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:25:32,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:25:32,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:32,870 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:32,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:32,941 INFO L124 PetriNetUnfolderBase]: 177/284 cut-off events. [2023-10-12 17:25:32,942 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-10-12 17:25:32,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 284 events. 177/284 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 883 event pairs, 27 based on Foata normal form. 13/218 useless extension candidates. Maximal degree in co-relation 701. Up to 202 conditions per place. [2023-10-12 17:25:32,949 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 40 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2023-10-12 17:25:32,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 43 transitions, 291 flow [2023-10-12 17:25:32,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 43 transitions, 291 flow [2023-10-12 17:25:32,971 INFO L124 PetriNetUnfolderBase]: 177/284 cut-off events. [2023-10-12 17:25:32,972 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-10-12 17:25:32,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 284 events. 177/284 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 887 event pairs, 27 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 701. Up to 202 conditions per place. [2023-10-12 17:25:32,973 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 29 places, 43 transitions, 291 flow [2023-10-12 17:25:32,974 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 29 places, 43 transitions, 291 flow [2023-10-12 17:25:32,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:25:32,977 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 43 transitions, 291 flow [2023-10-12 17:25:32,978 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:25:32,980 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 29 places, 43 transitions, 291 flow [2023-10-12 17:25:32,984 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:32,989 INFO L124 PetriNetUnfolderBase]: 17/35 cut-off events. [2023-10-12 17:25:32,989 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:25:32,989 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:32,990 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 83#[L97-1, L34-1]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 102#[L34-1, L98, $Ultimate##0]true [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 104#[L34-1, L98, L58-1]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 106#[L35-1, L98, L58-1]true [2023-10-12 17:25:32,990 INFO L750 eck$LassoCheckResult]: Loop: 106#[L35-1, L98, L58-1]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 106#[L35-1, L98, L58-1]true [2023-10-12 17:25:32,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:32,990 INFO L85 PathProgramCache]: Analyzing trace with hash -267468742, now seen corresponding path program 1 times [2023-10-12 17:25:32,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:32,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783238864] [2023-10-12 17:25:32,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:32,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:33,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:33,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:33,020 INFO L85 PathProgramCache]: Analyzing trace with hash 200, now seen corresponding path program 2 times [2023-10-12 17:25:33,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:33,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875457277] [2023-10-12 17:25:33,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:33,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:33,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:33,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:33,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash 298403759, now seen corresponding path program 1 times [2023-10-12 17:25:33,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:33,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060300838] [2023-10-12 17:25:33,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:33,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:33,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:33,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:33,282 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:33,283 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:33,283 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:33,283 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:33,283 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:33,283 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:33,283 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:33,283 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:33,283 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:25:33,284 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:33,284 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:33,302 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:33,317 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:33,320 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:33,322 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:33,324 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:33,326 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:33,383 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:33,385 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:33,580 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:33,583 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:33,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:33,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:33,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:33,598 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 [2023-10-12 17:25:33,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:33,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:33,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:33,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:33,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:33,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:33,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:25:33,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:33,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:33,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:33,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:33,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:33,639 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 [2023-10-12 17:25:33,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:25:33,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:33,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:33,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:33,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:33,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:33,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:33,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:33,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:33,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:33,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:33,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:33,685 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 [2023-10-12 17:25:33,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:33,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:33,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:33,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:33,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:33,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:33,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:25:33,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:33,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:33,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:33,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:33,713 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:33,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:25:33,721 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 [2023-10-12 17:25:33,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:33,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:33,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:33,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:33,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:33,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:33,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:33,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:33,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:33,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:33,744 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:33,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:25:33,747 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 [2023-10-12 17:25:33,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:33,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:33,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:33,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:33,758 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:33,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:33,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:33,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:33,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:33,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:33,786 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:33,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:25:33,794 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 [2023-10-12 17:25:33,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:33,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:33,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:33,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:33,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:33,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:33,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:33,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:25:33,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:33,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:33,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:33,833 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 [2023-10-12 17:25:33,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:33,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:33,842 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:25:33,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:33,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:25:33,870 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:25:33,870 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:25:33,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:33,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:33,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:33,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:33,917 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:33,927 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 [2023-10-12 17:25:33,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:33,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:33,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:33,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:33,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:33,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:33,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:25:33,946 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:33,960 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:25:33,960 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:25:33,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:33,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:33,967 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:33,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:25:33,969 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:33,986 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:25:33,986 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:33,987 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:25:33,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:33,996 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:25:34,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:34,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:25:34,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:34,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:34,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:25:34,044 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:25:34,045 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:34,169 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 440 transitions. [2023-10-12 17:25:34,170 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:25:34,176 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:25:34,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:25:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 254 transitions. [2023-10-12 17:25:34,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 254 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:25:34,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:34,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 254 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:25:34,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:34,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 254 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:25:34,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:34,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 570 transitions, 5022 flow [2023-10-12 17:25:34,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:25:34,315 INFO L124 PetriNetUnfolderBase]: 512/797 cut-off events. [2023-10-12 17:25:34,316 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-10-12 17:25:34,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 797 events. 512/797 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3024 event pairs, 7 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 2929. Up to 689 conditions per place. [2023-10-12 17:25:34,317 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 41 places, 570 transitions, 5022 flow [2023-10-12 17:25:34,324 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 41 places, 570 transitions, 5022 flow [2023-10-12 17:25:34,324 INFO L430 stractBuchiCegarLoop]: Abstraction has has 41 places, 570 transitions, 5022 flow [2023-10-12 17:25:34,324 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:25:34,324 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 places, 570 transitions, 5022 flow [2023-10-12 17:25:34,339 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:34,339 INFO L124 PetriNetUnfolderBase]: 63/113 cut-off events. [2023-10-12 17:25:34,339 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-10-12 17:25:34,339 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:34,340 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 59#[L98, $Ultimate##0, $Ultimate##0]true [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 61#[L98, L58-1, $Ultimate##0]true [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 104#[L34-1, L98, L58-1]true [168] L34-1-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_22 v_q1_back_38) 0) (<= v_N_12 v_i_20)) InVars {q1=v_q1_22, N=v_N_12, i=v_i_20, q1_back=v_q1_back_38} OutVars{q1=v_q1_22, N=v_N_12, i=v_i_20, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back] 163#[L98, L58-1, thread1EXIT]true [2023-10-12 17:25:34,340 INFO L750 eck$LassoCheckResult]: Loop: 163#[L98, L58-1, thread1EXIT]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 163#[L98, L58-1, thread1EXIT]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 163#[L98, L58-1, thread1EXIT]true [2023-10-12 17:25:34,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:34,340 INFO L85 PathProgramCache]: Analyzing trace with hash -267688215, now seen corresponding path program 1 times [2023-10-12 17:25:34,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:34,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148584967] [2023-10-12 17:25:34,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:34,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:34,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:34,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:34,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:34,354 INFO L85 PathProgramCache]: Analyzing trace with hash 6369, now seen corresponding path program 3 times [2023-10-12 17:25:34,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:34,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891519534] [2023-10-12 17:25:34,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:34,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:34,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:34,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:34,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash 449668553, now seen corresponding path program 1 times [2023-10-12 17:25:34,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:34,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157724444] [2023-10-12 17:25:34,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:25:34,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:34,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157724444] [2023-10-12 17:25:34,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157724444] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:25:34,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928987611] [2023-10-12 17:25:34,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:34,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:25:34,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:34,440 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:25:34,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-10-12 17:25:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:34,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:34,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:25:34,512 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:25:34,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928987611] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:34,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:25:34,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-10-12 17:25:34,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759047886] [2023-10-12 17:25:34,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:34,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:34,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:25:34,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-10-12 17:25:34,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 570 transitions, 5022 flow. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2023-10-12 17:25:34,657 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:34,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:34,850 INFO L124 PetriNetUnfolderBase]: 703/1139 cut-off events. [2023-10-12 17:25:34,851 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2023-10-12 17:25:34,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 1139 events. 703/1139 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4842 event pairs, 11 based on Foata normal form. 0/757 useless extension candidates. Maximal degree in co-relation 5214. Up to 1031 conditions per place. [2023-10-12 17:25:34,861 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 241 selfloop transitions, 39 changer transitions 30/310 dead transitions. [2023-10-12 17:25:34,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 310 transitions, 3289 flow [2023-10-12 17:25:34,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 310 transitions, 3289 flow [2023-10-12 17:25:34,960 INFO L124 PetriNetUnfolderBase]: 703/1139 cut-off events. [2023-10-12 17:25:34,960 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2023-10-12 17:25:34,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 1139 events. 703/1139 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4844 event pairs, 11 based on Foata normal form. 0/757 useless extension candidates. Maximal degree in co-relation 5214. Up to 1031 conditions per place. [2023-10-12 17:25:34,962 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 41 places, 310 transitions, 3289 flow [2023-10-12 17:25:34,966 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 41 places, 310 transitions, 3289 flow [2023-10-12 17:25:34,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:25:34,968 INFO L430 stractBuchiCegarLoop]: Abstraction has has 41 places, 310 transitions, 3289 flow [2023-10-12 17:25:34,968 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:25:34,968 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 places, 310 transitions, 3289 flow [2023-10-12 17:25:34,984 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:34,984 INFO L124 PetriNetUnfolderBase]: 78/140 cut-off events. [2023-10-12 17:25:34,984 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-10-12 17:25:34,984 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:34,985 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 59#[L98, $Ultimate##0, $Ultimate##0]true [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 205#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L99]true [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 207#[L78-1, $Ultimate##0, $Ultimate##0, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 207#[L78-1, $Ultimate##0, $Ultimate##0, L99]true [2023-10-12 17:25:34,985 INFO L750 eck$LassoCheckResult]: Loop: 207#[L78-1, $Ultimate##0, $Ultimate##0, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 207#[L78-1, $Ultimate##0, $Ultimate##0, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 207#[L78-1, $Ultimate##0, $Ultimate##0, L99]true [2023-10-12 17:25:34,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:34,985 INFO L85 PathProgramCache]: Analyzing trace with hash -267704302, now seen corresponding path program 1 times [2023-10-12 17:25:34,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:34,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19025828] [2023-10-12 17:25:34,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:34,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:25:35,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:35,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19025828] [2023-10-12 17:25:35,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19025828] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:35,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:25:35,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:25:35,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338686064] [2023-10-12 17:25:35,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:35,026 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:25:35,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:35,026 INFO L85 PathProgramCache]: Analyzing trace with hash 6401, now seen corresponding path program 1 times [2023-10-12 17:25:35,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:35,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523021585] [2023-10-12 17:25:35,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:35,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:35,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:35,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:35,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:35,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:25:35,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:25:35,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 310 transitions, 3289 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:35,207 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:35,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:35,306 INFO L124 PetriNetUnfolderBase]: 405/717 cut-off events. [2023-10-12 17:25:35,307 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2023-10-12 17:25:35,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4460 conditions, 717 events. 405/717 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2909 event pairs, 8 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 3915. Up to 667 conditions per place. [2023-10-12 17:25:35,313 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 185 selfloop transitions, 6 changer transitions 22/213 dead transitions. [2023-10-12 17:25:35,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 213 transitions, 2727 flow [2023-10-12 17:25:35,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 213 transitions, 2727 flow [2023-10-12 17:25:35,370 INFO L124 PetriNetUnfolderBase]: 405/717 cut-off events. [2023-10-12 17:25:35,371 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2023-10-12 17:25:35,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4460 conditions, 717 events. 405/717 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2901 event pairs, 8 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 3915. Up to 667 conditions per place. [2023-10-12 17:25:35,372 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 43 places, 213 transitions, 2727 flow [2023-10-12 17:25:35,376 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 43 places, 213 transitions, 2727 flow [2023-10-12 17:25:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:25:35,378 INFO L430 stractBuchiCegarLoop]: Abstraction has has 43 places, 213 transitions, 2727 flow [2023-10-12 17:25:35,378 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:25:35,378 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 places, 213 transitions, 2727 flow [2023-10-12 17:25:35,404 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:35,404 INFO L124 PetriNetUnfolderBase]: 148/279 cut-off events. [2023-10-12 17:25:35,404 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-10-12 17:25:35,404 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:35,405 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 59#[L98, $Ultimate##0, $Ultimate##0]true [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 205#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L99]true [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 224#[L34-1, $Ultimate##0, L99, $Ultimate##0]true [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 226#[L34-1, L58-1, L99, $Ultimate##0]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 228#[L35-1, L58-1, L99, $Ultimate##0]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 228#[L35-1, L58-1, L99, $Ultimate##0]true [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 231#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 231#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 231#[L35-1, L78-1, L58-1, L99]true [2023-10-12 17:25:35,405 INFO L750 eck$LassoCheckResult]: Loop: 231#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 231#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 231#[L35-1, L78-1, L58-1, L99]true [2023-10-12 17:25:35,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash 359485892, now seen corresponding path program 1 times [2023-10-12 17:25:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:35,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495576668] [2023-10-12 17:25:35,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:35,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:25:35,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:35,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495576668] [2023-10-12 17:25:35,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495576668] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:35,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:25:35,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:25:35,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692962390] [2023-10-12 17:25:35,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:35,448 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:25:35,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:35,449 INFO L85 PathProgramCache]: Analyzing trace with hash 6401, now seen corresponding path program 2 times [2023-10-12 17:25:35,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:35,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187837205] [2023-10-12 17:25:35,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:35,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:35,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:35,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:35,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:25:35,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:25:35,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 213 transitions, 2727 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2023-10-12 17:25:35,601 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:35,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:35,786 INFO L124 PetriNetUnfolderBase]: 700/1240 cut-off events. [2023-10-12 17:25:35,786 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-10-12 17:25:35,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8916 conditions, 1240 events. 700/1240 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5646 event pairs, 8 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 7898. Up to 1190 conditions per place. [2023-10-12 17:25:35,799 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 276 selfloop transitions, 25 changer transitions 27/328 dead transitions. [2023-10-12 17:25:35,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 328 transitions, 4868 flow [2023-10-12 17:25:35,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 328 transitions, 4868 flow [2023-10-12 17:25:35,918 INFO L124 PetriNetUnfolderBase]: 700/1240 cut-off events. [2023-10-12 17:25:35,918 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-10-12 17:25:35,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8916 conditions, 1240 events. 700/1240 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5663 event pairs, 8 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 7898. Up to 1190 conditions per place. [2023-10-12 17:25:35,920 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 46 places, 328 transitions, 4868 flow [2023-10-12 17:25:35,926 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 46 places, 328 transitions, 4868 flow [2023-10-12 17:25:35,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:25:35,928 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 328 transitions, 4868 flow [2023-10-12 17:25:35,929 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:25:35,929 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 places, 328 transitions, 4868 flow [2023-10-12 17:25:35,979 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:35,980 INFO L124 PetriNetUnfolderBase]: 257/502 cut-off events. [2023-10-12 17:25:35,980 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2023-10-12 17:25:35,980 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:35,980 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 59#[L98, $Ultimate##0, $Ultimate##0]true [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 205#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L99]true [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 224#[L34-1, $Ultimate##0, L99, $Ultimate##0]true [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 226#[L34-1, L58-1, L99, $Ultimate##0]true [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 253#[L34-1, L78-1, L58-1, L99]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 231#[L35-1, L78-1, L58-1, L99]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 231#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 231#[L35-1, L78-1, L58-1, L99]true [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 253#[L34-1, L78-1, L58-1, L99]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 231#[L35-1, L78-1, L58-1, L99]true [2023-10-12 17:25:35,981 INFO L750 eck$LassoCheckResult]: Loop: 231#[L35-1, L78-1, L58-1, L99]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 231#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 231#[L35-1, L78-1, L58-1, L99]true [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 253#[L34-1, L78-1, L58-1, L99]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 231#[L35-1, L78-1, L58-1, L99]true [2023-10-12 17:25:35,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:35,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1805187759, now seen corresponding path program 1 times [2023-10-12 17:25:35,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:35,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925526499] [2023-10-12 17:25:35,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:35,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:36,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:36,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:36,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:36,015 INFO L85 PathProgramCache]: Analyzing trace with hash 6126877, now seen corresponding path program 1 times [2023-10-12 17:25:36,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:36,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538978391] [2023-10-12 17:25:36,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:36,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:36,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:36,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:36,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:36,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1411471981, now seen corresponding path program 2 times [2023-10-12 17:25:36,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:36,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617273585] [2023-10-12 17:25:36,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:36,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:36,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:36,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:36,810 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:36,810 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:36,811 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:36,811 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:36,811 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:36,811 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:36,811 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:36,811 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:36,811 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:25:36,811 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:36,811 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:36,820 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:37,153 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:37,157 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:37,159 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:37,163 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:37,165 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:37,168 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:37,170 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:38,229 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:38,230 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:38,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:38,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:38,231 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:38,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:25:38,242 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 [2023-10-12 17:25:38,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:38,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:38,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:38,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:38,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:38,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:38,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:38,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:38,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:38,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:38,279 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:38,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:25:38,283 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 [2023-10-12 17:25:38,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:38,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:38,291 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:25:38,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:38,381 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:25:38,381 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:25:38,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:38,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:38,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:38,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:38,524 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:38,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:25:38,528 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 [2023-10-12 17:25:38,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:38,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:38,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:38,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:38,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:38,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:38,561 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:38,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:38,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:38,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:38,566 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:38,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:25:38,569 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 [2023-10-12 17:25:38,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:38,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:38,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:38,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:38,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:38,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:38,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:38,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:38,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:38,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:38,588 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:38,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:25:38,617 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 [2023-10-12 17:25:38,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:38,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:38,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:38,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:38,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:38,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:38,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:38,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:38,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:38,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:38,632 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:38,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:25:38,635 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 [2023-10-12 17:25:38,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:38,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:38,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:38,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:38,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:38,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:38,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:38,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:38,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:38,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:38,648 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:38,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:25:38,653 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 [2023-10-12 17:25:38,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:38,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:38,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:38,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:38,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:38,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:38,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:38,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:38,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:38,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:38,668 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:38,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:25:38,675 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 [2023-10-12 17:25:38,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:38,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:38,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:38,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:38,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:38,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:38,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:38,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-10-12 17:25:38,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:38,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:38,697 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:38,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:25:38,700 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 [2023-10-12 17:25:38,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:38,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:38,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:38,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:38,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:38,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:38,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:38,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:38,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:38,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:38,722 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:38,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:25:38,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:25:38,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:38,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:38,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:38,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:38,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:38,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:38,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:38,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:38,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:38,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:38,740 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:38,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:25:38,743 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 [2023-10-12 17:25:38,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:38,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:38,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:38,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:38,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:38,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:38,757 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:38,769 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:25:38,769 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:25:38,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:38,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:38,770 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:25:38,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:25:38,776 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:38,816 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:25:38,816 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:38,816 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:25:38,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:38,833 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2023-10-12 17:25:38,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:38,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:25:38,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:38,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:38,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:25:38,898 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 [2023-10-12 17:25:38,898 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2023-10-12 17:25:39,093 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 8 states and 577 transitions. [2023-10-12 17:25:39,094 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:25:39,133 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:25:39,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:25:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2023-10-12 17:25:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 324 transitions. [2023-10-12 17:25:39,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 324 transitions. Stem has 12 letters. Loop has 4 letters. [2023-10-12 17:25:39,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:39,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 324 transitions. Stem has 16 letters. Loop has 4 letters. [2023-10-12 17:25:39,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:39,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 324 transitions. Stem has 12 letters. Loop has 8 letters. [2023-10-12 17:25:39,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:39,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 5848 transitions, 98536 flow [2023-10-12 17:25:39,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:40,862 INFO L124 PetriNetUnfolderBase]: 1642/2783 cut-off events. [2023-10-12 17:25:40,862 INFO L125 PetriNetUnfolderBase]: For 537/537 co-relation queries the response was YES. [2023-10-12 17:25:40,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22679 conditions, 2783 events. 1642/2783 cut-off events. For 537/537 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 14961 event pairs, 6 based on Foata normal form. 0/1918 useless extension candidates. Maximal degree in co-relation 20775. Up to 2733 conditions per place. [2023-10-12 17:25:40,864 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 62 places, 5848 transitions, 98536 flow [2023-10-12 17:25:40,955 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 62 places, 5848 transitions, 98536 flow [2023-10-12 17:25:40,955 INFO L430 stractBuchiCegarLoop]: Abstraction has has 62 places, 5848 transitions, 98536 flow [2023-10-12 17:25:40,955 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:25:40,955 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 62 places, 5848 transitions, 98536 flow [2023-10-12 17:25:41,651 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:41,652 INFO L124 PetriNetUnfolderBase]: 542/1012 cut-off events. [2023-10-12 17:25:41,652 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2023-10-12 17:25:41,652 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:41,652 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L97]true [140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[L97-1, $Ultimate##0]true [143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 59#[L98, $Ultimate##0, $Ultimate##0]true [146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 205#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L99]true [151] $Ultimate##0-->L34-1: Formula: (and (= v_r_9 0) (= v_i_6 0)) InVars {} OutVars{i=v_i_6, r=v_r_9} AuxVars[] AssignedVars[i, r] 224#[L34-1, $Ultimate##0, L99, $Ultimate##0]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 371#[L35-1, $Ultimate##0, $Ultimate##0, L99]true [163] $Ultimate##0-->L58-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 228#[L35-1, L58-1, L99, $Ultimate##0]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 228#[L35-1, L58-1, L99, $Ultimate##0]true [159] $Ultimate##0-->L78-1: Formula: (and (= v_t_4 0) v_g_9) InVars {} OutVars{g=v_g_9, t=v_t_4} AuxVars[] AssignedVars[g, t] 231#[L35-1, L78-1, L58-1, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 231#[L35-1, L78-1, L58-1, L99]true [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 253#[L34-1, L78-1, L58-1, L99]true [161] L34-1-->L35-1: Formula: (and (< v_i_10 v_N_6) (= 2 (select v_q1_16 v_q1_back_26)) (= (+ 1 v_q1_back_26) v_q1_back_25)) InVars {q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_26} OutVars{q1=v_q1_16, N=v_N_6, i=v_i_10, q1_back=v_q1_back_25} AuxVars[] AssignedVars[q1_back] 231#[L35-1, L78-1, L58-1, L99]true [166] L35-1-->L34-1: Formula: (and (= v_i_14 (+ v_i_15 1)) (= v_q3_front_30 (+ v_q3_front_31 1)) (< v_q3_front_31 v_q3_back_30) (= (select v_q3_19 v_q3_front_31) v_l_15) (= v_r_23 (+ v_l_15 v_r_24))) InVars {i=v_i_15, q3_front=v_q3_front_31, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_24} OutVars{l=v_l_15, i=v_i_14, q3_front=v_q3_front_30, q3_back=v_q3_back_30, q3=v_q3_19, r=v_r_23} AuxVars[] AssignedVars[l, i, q3_front, r] 253#[L34-1, L78-1, L58-1, L99]true [168] L34-1-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_22 v_q1_back_38) 0) (<= v_N_12 v_i_20)) InVars {q1=v_q1_22, N=v_N_12, i=v_i_20, q1_back=v_q1_back_38} OutVars{q1=v_q1_22, N=v_N_12, i=v_i_20, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back] 380#[L78-1, L58-1, thread1EXIT, L99]true [2023-10-12 17:25:41,653 INFO L750 eck$LassoCheckResult]: Loop: 380#[L78-1, L58-1, thread1EXIT, L99]true [169] L58-1-->L58-1: Formula: (and v_f_22 (= (+ v_q2_back_33 1) v_q2_back_32) (= (+ (select v_q2_19 v_q2_back_33) 1) v_j_29) (= v_s_18 (+ v_j_29 v_s_19)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= (select v_q1_28 v_q1_front_35) v_j_29) (= (+ v_q1_front_35 1) v_q1_front_34) (< v_q1_front_35 v_q1_back_49)) InVars {q1_front=v_q1_front_35, q1=v_q1_28, q2=v_q2_19, q2_back=v_q2_back_33, f=v_f_22, s=v_s_19, q1_back=v_q1_back_49} OutVars{q1_front=v_q1_front_34, q1=v_q1_28, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_32, f=v_f_21, s=v_s_18, q1_back=v_q1_back_49} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 380#[L78-1, L58-1, thread1EXIT, L99]true [170] L78-1-->L78-1: Formula: (and (= v_t_18 (+ v_k_31 v_t_19)) v_g_22 (= v_k_31 (select v_q2_23 v_q2_front_29)) (or (and (not v_g_21) (<= v_k_31 0)) (and v_g_21 (< 0 v_k_31))) (< v_q2_front_29 v_q2_back_40) (= v_q3_back_36 (+ v_q3_back_37 1)) (= v_q2_front_28 (+ v_q2_front_29 1)) (= (+ (select v_q3_23 v_q3_back_37) 1) v_k_31)) InVars {q2=v_q2_23, q2_back=v_q2_back_40, g=v_g_22, q3_back=v_q3_back_37, t=v_t_19, q3=v_q3_23, q2_front=v_q2_front_29} OutVars{q2=v_q2_23, k=v_k_31, q2_back=v_q2_back_40, g=v_g_21, q3_back=v_q3_back_36, t=v_t_18, q3=v_q3_23, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 380#[L78-1, L58-1, thread1EXIT, L99]true [2023-10-12 17:25:41,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash 601375519, now seen corresponding path program 1 times [2023-10-12 17:25:41,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:41,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764740498] [2023-10-12 17:25:41,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:41,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:25:41,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:41,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764740498] [2023-10-12 17:25:41,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764740498] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:25:41,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731766971] [2023-10-12 17:25:41,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:41,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:25:41,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:41,697 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:25:41,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-10-12 17:25:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:41,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:41,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:25:41,761 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:25:41,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731766971] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:41,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:25:41,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2023-10-12 17:25:41,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952062387] [2023-10-12 17:25:41,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:41,762 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:25:41,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash 6370, now seen corresponding path program 1 times [2023-10-12 17:25:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430947125] [2023-10-12 17:25:41,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:41,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:41,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:41,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:41,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:41,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:25:41,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:25:41,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 5848 transitions, 98536 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-10-12 17:25:41,967 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:41,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:42,699 INFO L124 PetriNetUnfolderBase]: 445/924 cut-off events. [2023-10-12 17:25:42,699 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2023-10-12 17:25:42,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8552 conditions, 924 events. 445/924 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4873 event pairs, 6 based on Foata normal form. 41/760 useless extension candidates. Maximal degree in co-relation 7055. Up to 874 conditions per place. [2023-10-12 17:25:42,706 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 222 selfloop transitions, 26 changer transitions 132/380 dead transitions. [2023-10-12 17:25:42,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 380 transitions, 7101 flow [2023-10-12 17:25:42,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 380 transitions, 7101 flow [2023-10-12 17:25:42,795 INFO L124 PetriNetUnfolderBase]: 445/924 cut-off events. [2023-10-12 17:25:42,796 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2023-10-12 17:25:42,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8552 conditions, 924 events. 445/924 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4878 event pairs, 6 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 7055. Up to 874 conditions per place. [2023-10-12 17:25:42,796 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 61 places, 380 transitions, 7101 flow [2023-10-12 17:25:42,803 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 61 places, 380 transitions, 7101 flow [2023-10-12 17:25:42,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:25:42,803 INFO L430 stractBuchiCegarLoop]: Abstraction has has 61 places, 380 transitions, 7101 flow [2023-10-12 17:25:42,804 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:25:42,804 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 61 places, 380 transitions, 7101 flow [2023-10-12 17:25:42,897 INFO L124 PetriNetUnfolderBase]: 445/924 cut-off events. [2023-10-12 17:25:42,898 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2023-10-12 17:25:42,898 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:25:42,903 INFO L201 PluginConnector]: Adding new model ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:25:42 BoogieIcfgContainer [2023-10-12 17:25:42,903 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:25:42,903 INFO L158 Benchmark]: Toolchain (without parser) took 12035.36ms. Allocated memory was 182.5MB in the beginning and 400.6MB in the end (delta: 218.1MB). Free memory was 131.8MB in the beginning and 255.6MB in the end (delta: -123.8MB). Peak memory consumption was 254.3MB. Max. memory is 8.0GB. [2023-10-12 17:25:42,903 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 182.5MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:25:42,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.30ms. Allocated memory is still 182.5MB. Free memory was 131.8MB in the beginning and 130.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:25:42,904 INFO L158 Benchmark]: Boogie Preprocessor took 33.15ms. Allocated memory is still 182.5MB. Free memory was 130.2MB in the beginning and 129.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:25:42,904 INFO L158 Benchmark]: RCFGBuilder took 275.39ms. Allocated memory is still 182.5MB. Free memory was 129.0MB in the beginning and 117.2MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-10-12 17:25:42,904 INFO L158 Benchmark]: BuchiAutomizer took 11694.85ms. Allocated memory was 182.5MB in the beginning and 400.6MB in the end (delta: 218.1MB). Free memory was 117.0MB in the beginning and 255.6MB in the end (delta: -138.6MB). Peak memory consumption was 239.6MB. Max. memory is 8.0GB. [2023-10-12 17:25:42,906 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.26ms. Allocated memory is still 182.5MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.30ms. Allocated memory is still 182.5MB. Free memory was 131.8MB in the beginning and 130.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.15ms. Allocated memory is still 182.5MB. Free memory was 130.2MB in the beginning and 129.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 275.39ms. Allocated memory is still 182.5MB. Free memory was 129.0MB in the beginning and 117.2MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 11694.85ms. Allocated memory was 182.5MB in the beginning and 400.6MB in the end (delta: 218.1MB). Free memory was 117.0MB in the beginning and 255.6MB in the end (delta: -138.6MB). Peak memory consumption was 239.6MB. 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 8 terminating modules (6 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.5s and 9 iterations. TraceHistogramMax:0. Analysis of lassos took 5.3s. Construction of modules took 0.3s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 403 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 401 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 531 IncrementalHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 152 mSDtfsCounter, 531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital162 mio100 ax100 hnf100 lsp87 ukn92 mio100 lsp61 div100 bol114 ite100 ukn100 eq178 hnf90 smp100 dnf560 smp39 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 237ms VariablesStem: 20 VariablesLoop: 26 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 46 PlacesBefore, 26 PlacesAfterwards, 39 TransitionsBefore, 19 TransitionsAfterwards, 634 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 21 TotalNumberOfCompositions, 565 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 492, independent: 480, independent conditional: 0, independent unconditional: 480, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 393, independent: 383, independent conditional: 0, independent unconditional: 383, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 393, independent: 378, independent conditional: 0, independent unconditional: 378, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 63, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 492, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 393, unknown conditional: 0, unknown unconditional: 393] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:25:42,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:43,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-10-12 17:25:43,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...