/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-nondet.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:25:28,608 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:25:28,661 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:28,686 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:25:28,686 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:25:28,687 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:25:28,687 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:25:28,688 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:25:28,688 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:25:28,688 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:25:28,688 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:25:28,689 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:25:28,689 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:25:28,689 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:25:28,689 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:25:28,690 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:25:28,690 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:25:28,690 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:25:28,690 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:25:28,691 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:25:28,691 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:25:28,694 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:25:28,694 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:25:28,694 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:25:28,697 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:25:28,697 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:25:28,697 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:25:28,698 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:25:28,698 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:25:28,698 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:25:28,699 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:25:28,699 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:25:28,699 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:25:28,700 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:25:28,700 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:28,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:25:28,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:25:28,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:25:28,873 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:25:28,874 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:25:28,874 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-nondet.wvr.bpl [2023-10-12 17:25:28,875 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring-nondet.wvr.bpl' [2023-10-12 17:25:28,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:25:28,893 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:25:28,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:25:28,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:25:28,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:25:28,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:28" (1/1) ... [2023-10-12 17:25:28,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:28" (1/1) ... [2023-10-12 17:25:28,911 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:25:28,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:25:28,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:25:28,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:25:28,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:25:28,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:28" (1/1) ... [2023-10-12 17:25:28,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:28" (1/1) ... [2023-10-12 17:25:28,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:28" (1/1) ... [2023-10-12 17:25:28,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:28" (1/1) ... [2023-10-12 17:25:28,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:28" (1/1) ... [2023-10-12 17:25:28,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:28" (1/1) ... [2023-10-12 17:25:28,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:28" (1/1) ... [2023-10-12 17:25:28,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:28" (1/1) ... [2023-10-12 17:25:28,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:25:28,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:25:28,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:25:28,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:25:28,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:28" (1/1) ... [2023-10-12 17:25:28,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:28,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:28,945 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:28,951 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:28,976 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:25:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:25:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:25:28,976 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:25:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:25:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:25:28,976 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:25:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:25:28,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:25:28,977 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:25:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:25:28,978 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:25:28,978 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:29,022 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:25:29,023 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:25:29,110 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:25:29,153 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:25:29,153 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:25:29,155 INFO L201 PluginConnector]: Adding new model ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:25:29 BoogieIcfgContainer [2023-10-12 17:25:29,155 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:25:29,156 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:25:29,156 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:25:29,163 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:25:29,163 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:25:29,164 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:28" (1/2) ... [2023-10-12 17:25:29,165 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7af42e41 and model type ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:25:29, skipping insertion in model container [2023-10-12 17:25:29,165 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:25:29,165 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:25:29" (2/2) ... [2023-10-12 17:25:29,172 INFO L332 chiAutomizerObserver]: Analyzing ICFG ring-nondet.wvr.bpl [2023-10-12 17:25:29,221 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:25:29,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 36 transitions, 96 flow [2023-10-12 17:25:29,252 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2023-10-12 17:25:29,252 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:25:29,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-10-12 17:25:29,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 36 transitions, 96 flow [2023-10-12 17:25:29,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2023-10-12 17:25:29,278 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:25:29,286 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 78 flow [2023-10-12 17:25:29,288 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 78 flow [2023-10-12 17:25:29,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 78 flow [2023-10-12 17:25:29,294 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2023-10-12 17:25:29,294 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:25:29,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-10-12 17:25:29,295 INFO L119 LiptonReduction]: Number of co-enabled transitions 314 [2023-10-12 17:25:29,872 INFO L134 LiptonReduction]: Checked pairs total: 304 [2023-10-12 17:25:29,873 INFO L136 LiptonReduction]: Total number of compositions: 16 [2023-10-12 17:25:29,881 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:25:29,881 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:25:29,882 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:25:29,882 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:25:29,882 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:25:29,882 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:25:29,882 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:25:29,882 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:25:29,882 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:25:29,885 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:29,885 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:25:29,885 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:25:29,885 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:29,886 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:25:29,887 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:25:29,887 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:29,887 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:25:29,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:25:29,887 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:29,890 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [2023-10-12 17:25:29,890 INFO L750 eck$LassoCheckResult]: Loop: 48#[L41, L95-1]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 48#[L41, L95-1]true [2023-10-12 17:25:29,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:29,894 INFO L85 PathProgramCache]: Analyzing trace with hash 4057, now seen corresponding path program 1 times [2023-10-12 17:25:29,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:29,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583524063] [2023-10-12 17:25:29,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:29,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:30,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:30,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:30,009 INFO L85 PathProgramCache]: Analyzing trace with hash 163, now seen corresponding path program 1 times [2023-10-12 17:25:30,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:30,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765241236] [2023-10-12 17:25:30,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:30,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:30,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:30,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:30,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:30,046 INFO L85 PathProgramCache]: Analyzing trace with hash 125899, now seen corresponding path program 1 times [2023-10-12 17:25:30,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:30,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409247616] [2023-10-12 17:25:30,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:30,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:30,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:30,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:30,271 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:30,272 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:30,272 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:30,272 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:30,272 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:30,273 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:30,273 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:30,273 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:30,273 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:25:30,273 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:30,273 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:30,289 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:30,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:30,304 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:30,307 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:30,309 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:30,311 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:30,315 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:30,535 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2023-10-12 17:25:30,666 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:30,670 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:30,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:30,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:30,691 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:30,695 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:30,695 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:30,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:30,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:30,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:30,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:30,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:30,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:30,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:30,742 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:30,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:30,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:30,752 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:30,754 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:30,756 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:30,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:30,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:30,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:30,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:30,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:30,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:30,793 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:30,805 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:30,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:30,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:30,824 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:30,849 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:30,849 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:30,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:30,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:30,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:30,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:30,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:30,858 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:30,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:30,877 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:30,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:30,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:30,878 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:30,880 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:30,882 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:30,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:30,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:30,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:30,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:30,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:30,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:30,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:30,900 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:30,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:30,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:30,902 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:30,904 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:30,905 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:30,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:30,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:30,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:30,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:30,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:30,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:30,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:30,956 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:30,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:30,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:30,958 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:30,960 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:30,960 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:30,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:30,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:30,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:30,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:30,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:30,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:30,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:31,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:25:31,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:31,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:31,017 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:31,018 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:31,019 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:31,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:31,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:31,027 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:25:31,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:31,068 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:25:31,068 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:25:31,100 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:31,154 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:25:31,155 INFO L444 ModelExtractionUtils]: 44 out of 56 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:25:31,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:31,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:31,169 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:31,234 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:31,234 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:31,244 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-10-12 17:25:31,244 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:31,244 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i, q3_back, q3_front) = 1*N - 1*i + 1*q3_back - 1*q3_front Supporting invariants [1*q3_back - 1*q3_front >= 0] [2023-10-12 17:25:31,249 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:31,253 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:25:31,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:31,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:25:31,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:31,325 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:25:31,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:31,326 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:31,350 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2023-10-12 17:25:31,351 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:31,566 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 453 transitions. [2023-10-12 17:25:31,567 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:25:31,569 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:25:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 1 non-accepting loop states 2 accepting loop states [2023-10-12 17:25:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 256 transitions. [2023-10-12 17:25:31,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 256 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:25:31,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:31,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 256 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:25:31,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:31,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 256 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:25:31,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:31,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 260 transitions, 1364 flow [2023-10-12 17:25:31,604 INFO L124 PetriNetUnfolderBase]: 178/284 cut-off events. [2023-10-12 17:25:31,604 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2023-10-12 17:25:31,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 284 events. 178/284 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 898 event pairs, 12 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 428. Up to 62 conditions per place. [2023-10-12 17:25:31,605 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 38 places, 260 transitions, 1364 flow [2023-10-12 17:25:31,608 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 38 places, 260 transitions, 1364 flow [2023-10-12 17:25:31,609 INFO L430 stractBuchiCegarLoop]: Abstraction has has 38 places, 260 transitions, 1364 flow [2023-10-12 17:25:31,609 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:25:31,609 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 places, 260 transitions, 1364 flow [2023-10-12 17:25:31,613 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:31,614 INFO L124 PetriNetUnfolderBase]: 27/42 cut-off events. [2023-10-12 17:25:31,614 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:25:31,614 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:31,614 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 112#[L58, L96, L41]true [2023-10-12 17:25:31,614 INFO L750 eck$LassoCheckResult]: Loop: 112#[L58, L96, L41]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 112#[L58, L96, L41]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 112#[L58, L96, L41]true [2023-10-12 17:25:31,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:31,615 INFO L85 PathProgramCache]: Analyzing trace with hash 125890, now seen corresponding path program 1 times [2023-10-12 17:25:31,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:31,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023864252] [2023-10-12 17:25:31,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:31,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:31,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:31,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:31,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:31,622 INFO L85 PathProgramCache]: Analyzing trace with hash 5601, now seen corresponding path program 1 times [2023-10-12 17:25:31,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:31,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047403915] [2023-10-12 17:25:31,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:31,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:31,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:31,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:31,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash 120984930, now seen corresponding path program 1 times [2023-10-12 17:25:31,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:31,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594896781] [2023-10-12 17:25:31,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:31,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:31,671 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:31,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:31,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594896781] [2023-10-12 17:25:31,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594896781] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:31,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:25:31,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:25:31,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408086647] [2023-10-12 17:25:31,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:31,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:31,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:25:31,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:25:31,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 260 transitions, 1364 flow. Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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:31,794 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:31,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:31,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:25:31,869 INFO L124 PetriNetUnfolderBase]: 220/343 cut-off events. [2023-10-12 17:25:31,869 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-10-12 17:25:31,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 343 events. 220/343 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1046 event pairs, 12 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 814. Up to 312 conditions per place. [2023-10-12 17:25:31,873 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 77 selfloop transitions, 10 changer transitions 11/98 dead transitions. [2023-10-12 17:25:31,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 98 transitions, 678 flow [2023-10-12 17:25:31,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 98 transitions, 678 flow [2023-10-12 17:25:31,889 INFO L124 PetriNetUnfolderBase]: 220/343 cut-off events. [2023-10-12 17:25:31,889 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-10-12 17:25:31,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 343 events. 220/343 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1055 event pairs, 12 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 814. Up to 312 conditions per place. [2023-10-12 17:25:31,890 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 32 places, 98 transitions, 678 flow [2023-10-12 17:25:31,891 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 32 places, 98 transitions, 678 flow [2023-10-12 17:25:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:25:31,891 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 98 transitions, 678 flow [2023-10-12 17:25:31,891 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:25:31,892 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 98 transitions, 678 flow [2023-10-12 17:25:31,895 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:31,895 INFO L124 PetriNetUnfolderBase]: 33/54 cut-off events. [2023-10-12 17:25:31,895 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:25:31,895 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:31,896 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 112#[L58, L96, L41]true [2023-10-12 17:25:31,896 INFO L750 eck$LassoCheckResult]: Loop: 112#[L58, L96, L41]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 112#[L58, L96, L41]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 112#[L58, L96, L41]true [2023-10-12 17:25:31,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash 3902992, now seen corresponding path program 1 times [2023-10-12 17:25:31,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:31,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109133064] [2023-10-12 17:25:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:31,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:31,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:31,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:31,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash 5601, now seen corresponding path program 2 times [2023-10-12 17:25:31,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:31,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573251293] [2023-10-12 17:25:31,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:31,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:31,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:31,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:31,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:31,918 INFO L85 PathProgramCache]: Analyzing trace with hash -544187344, now seen corresponding path program 1 times [2023-10-12 17:25:31,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:31,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451684986] [2023-10-12 17:25:31,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:31,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:31,977 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:31,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:31,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451684986] [2023-10-12 17:25:31,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451684986] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:31,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:25:31,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:25:31,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343231358] [2023-10-12 17:25:31,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:32,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:32,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:25:32,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:25:32,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 98 transitions, 678 flow. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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,079 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:32,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:32,168 INFO L124 PetriNetUnfolderBase]: 489/804 cut-off events. [2023-10-12 17:25:32,168 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2023-10-12 17:25:32,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3444 conditions, 804 events. 489/804 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3501 event pairs, 3 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 2318. Up to 773 conditions per place. [2023-10-12 17:25:32,174 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 147 selfloop transitions, 35 changer transitions 27/209 dead transitions. [2023-10-12 17:25:32,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 209 transitions, 1888 flow [2023-10-12 17:25:32,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 209 transitions, 1888 flow [2023-10-12 17:25:32,235 INFO L124 PetriNetUnfolderBase]: 489/804 cut-off events. [2023-10-12 17:25:32,235 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2023-10-12 17:25:32,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3444 conditions, 804 events. 489/804 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3476 event pairs, 3 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 2318. Up to 773 conditions per place. [2023-10-12 17:25:32,236 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 36 places, 209 transitions, 1888 flow [2023-10-12 17:25:32,238 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 36 places, 209 transitions, 1888 flow [2023-10-12 17:25:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:25:32,239 INFO L430 stractBuchiCegarLoop]: Abstraction has has 36 places, 209 transitions, 1888 flow [2023-10-12 17:25:32,239 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:25:32,239 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 36 places, 209 transitions, 1888 flow [2023-10-12 17:25:32,246 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:32,246 INFO L124 PetriNetUnfolderBase]: 65/109 cut-off events. [2023-10-12 17:25:32,247 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-10-12 17:25:32,247 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:32,247 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 48#[L41, L95-1]true [142] L41-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_20 v_q1_back_38) 0) (<= v_N_10 v_i_22)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_38} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back] 147#[L95-1, thread1EXIT]true [123] L95-1-->L58: 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] 149#[L58, L96, thread1EXIT]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 149#[L58, L96, thread1EXIT]true [2023-10-12 17:25:32,247 INFO L750 eck$LassoCheckResult]: Loop: 149#[L58, L96, thread1EXIT]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 149#[L58, L96, thread1EXIT]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 149#[L58, L96, thread1EXIT]true [2023-10-12 17:25:32,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash -544169767, now seen corresponding path program 1 times [2023-10-12 17:25:32,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:32,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826039305] [2023-10-12 17:25:32,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:32,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:32,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:32,263 INFO L85 PathProgramCache]: Analyzing trace with hash 5601, now seen corresponding path program 3 times [2023-10-12 17:25:32,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:32,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880369125] [2023-10-12 17:25:32,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:32,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:32,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1038868665, now seen corresponding path program 2 times [2023-10-12 17:25:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:32,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027722043] [2023-10-12 17:25:32,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:32,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:32,331 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:32,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:32,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027722043] [2023-10-12 17:25:32,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027722043] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:25:32,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037697520] [2023-10-12 17:25:32,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:25:32,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:25:32,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:32,333 INFO L229 MonitoredProcess]: Starting monitored process 10 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:32,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-10-12 17:25:32,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:25:32,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:25:32,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2023-10-12 17:25:32,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:32,400 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-10-12 17:25:32,411 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:32,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:25:32,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 60 [2023-10-12 17:25:32,452 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2023-10-12 17:25:32,476 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:32,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037697520] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:25:32,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:25:32,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 5 [2023-10-12 17:25:32,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100310067] [2023-10-12 17:25:32,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:25:32,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:32,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-10-12 17:25:32,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-10-12 17:25:32,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 209 transitions, 1888 flow. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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,580 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:32,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:32,747 INFO L124 PetriNetUnfolderBase]: 927/1532 cut-off events. [2023-10-12 17:25:32,747 INFO L125 PetriNetUnfolderBase]: For 521/521 co-relation queries the response was YES. [2023-10-12 17:25:32,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8088 conditions, 1532 events. 927/1532 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7745 event pairs, 3 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 5632. Up to 1501 conditions per place. [2023-10-12 17:25:32,755 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 257 selfloop transitions, 74 changer transitions 51/382 dead transitions. [2023-10-12 17:25:32,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 382 transitions, 4222 flow [2023-10-12 17:25:32,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 382 transitions, 4222 flow [2023-10-12 17:25:32,853 INFO L124 PetriNetUnfolderBase]: 927/1532 cut-off events. [2023-10-12 17:25:32,853 INFO L125 PetriNetUnfolderBase]: For 521/521 co-relation queries the response was YES. [2023-10-12 17:25:32,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8088 conditions, 1532 events. 927/1532 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7734 event pairs, 3 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 5632. Up to 1501 conditions per place. [2023-10-12 17:25:32,855 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 41 places, 382 transitions, 4222 flow [2023-10-12 17:25:32,859 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 41 places, 382 transitions, 4222 flow [2023-10-12 17:25:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-10-12 17:25:32,860 INFO L430 stractBuchiCegarLoop]: Abstraction has has 41 places, 382 transitions, 4222 flow [2023-10-12 17:25:32,860 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:25:32,860 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 places, 382 transitions, 4222 flow [2023-10-12 17:25:32,889 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:32,890 INFO L124 PetriNetUnfolderBase]: 147/237 cut-off events. [2023-10-12 17:25:32,890 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-10-12 17:25:32,890 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:32,890 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 112#[L58, L96, L41]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 112#[L58, L96, L41]true [126] L96-->L76: 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] 214#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 214#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 214#[L58, L41, L97, L76]true [2023-10-12 17:25:32,890 INFO L750 eck$LassoCheckResult]: Loop: 214#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 214#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 214#[L58, L41, L97, L76]true [2023-10-12 17:25:32,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:32,891 INFO L85 PathProgramCache]: Analyzing trace with hash 301999804, now seen corresponding path program 1 times [2023-10-12 17:25:32,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:32,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936606645] [2023-10-12 17:25:32,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:32,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:32,907 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,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:32,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936606645] [2023-10-12 17:25:32,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936606645] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:32,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:25:32,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:25:32,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324184023] [2023-10-12 17:25:32,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:32,908 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:25:32,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:32,908 INFO L85 PathProgramCache]: Analyzing trace with hash 5569, now seen corresponding path program 1 times [2023-10-12 17:25:32,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:32,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664452309] [2023-10-12 17:25:32,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:32,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:32,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:33,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:33,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:25:33,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:25:33,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 382 transitions, 4222 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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:33,023 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:33,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:33,208 INFO L124 PetriNetUnfolderBase]: 1164/1934 cut-off events. [2023-10-12 17:25:33,209 INFO L125 PetriNetUnfolderBase]: For 638/638 co-relation queries the response was YES. [2023-10-12 17:25:33,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12163 conditions, 1934 events. 1164/1934 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 10301 event pairs, 30 based on Foata normal form. 0/1267 useless extension candidates. Maximal degree in co-relation 8142. Up to 1917 conditions per place. [2023-10-12 17:25:33,220 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 398 selfloop transitions, 16 changer transitions 71/485 dead transitions. [2023-10-12 17:25:33,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 485 transitions, 6345 flow [2023-10-12 17:25:33,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 485 transitions, 6345 flow [2023-10-12 17:25:33,366 INFO L124 PetriNetUnfolderBase]: 1164/1934 cut-off events. [2023-10-12 17:25:33,366 INFO L125 PetriNetUnfolderBase]: For 638/638 co-relation queries the response was YES. [2023-10-12 17:25:33,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12163 conditions, 1934 events. 1164/1934 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 10280 event pairs, 30 based on Foata normal form. 0/1267 useless extension candidates. Maximal degree in co-relation 8142. Up to 1917 conditions per place. [2023-10-12 17:25:33,369 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 43 places, 485 transitions, 6345 flow [2023-10-12 17:25:33,375 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 43 places, 485 transitions, 6345 flow [2023-10-12 17:25:33,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:25:33,375 INFO L430 stractBuchiCegarLoop]: Abstraction has has 43 places, 485 transitions, 6345 flow [2023-10-12 17:25:33,375 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:25:33,375 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 places, 485 transitions, 6345 flow [2023-10-12 17:25:33,401 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:33,402 INFO L124 PetriNetUnfolderBase]: 213/346 cut-off events. [2023-10-12 17:25:33,402 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-10-12 17:25:33,402 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:33,402 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 48#[L41, L95-1]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 112#[L58, L96, L41]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 112#[L58, L96, L41]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 112#[L58, L96, L41]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 112#[L58, L96, L41]true [2023-10-12 17:25:33,402 INFO L750 eck$LassoCheckResult]: Loop: 112#[L58, L96, L41]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 112#[L58, L96, L41]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 112#[L58, L96, L41]true [2023-10-12 17:25:33,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:33,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1029620962, now seen corresponding path program 2 times [2023-10-12 17:25:33,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:33,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195082243] [2023-10-12 17:25:33,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:33,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:33,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:33,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:33,439 INFO L85 PathProgramCache]: Analyzing trace with hash 5601, now seen corresponding path program 4 times [2023-10-12 17:25:33,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:33,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303944265] [2023-10-12 17:25:33,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:33,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:33,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:33,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:33,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1623271042, now seen corresponding path program 3 times [2023-10-12 17:25:33,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:33,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557265836] [2023-10-12 17:25:33,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:33,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:25:33,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:33,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557265836] [2023-10-12 17:25:33,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557265836] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:25:33,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810620975] [2023-10-12 17:25:33,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-10-12 17:25:33,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:25:33,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:33,589 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:33,598 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:33,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-10-12 17:25:33,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:25:33,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2023-10-12 17:25:33,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:33,708 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-10-12 17:25:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:25:33,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:25:33,867 INFO L322 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2023-10-12 17:25:33,868 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 110 [2023-10-12 17:25:33,873 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2023-10-12 17:25:33,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:25:33,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810620975] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:25:33,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:25:33,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 11 [2023-10-12 17:25:33,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695964322] [2023-10-12 17:25:33,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:25:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:34,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-10-12 17:25:34,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-10-12 17:25:34,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 485 transitions, 6345 flow. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 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,073 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:34,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:34,572 INFO L124 PetriNetUnfolderBase]: 1956/3275 cut-off events. [2023-10-12 17:25:34,573 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2023-10-12 17:25:34,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23870 conditions, 3275 events. 1956/3275 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 19392 event pairs, 22 based on Foata normal form. 0/2155 useless extension candidates. Maximal degree in co-relation 15668. Up to 3258 conditions per place. [2023-10-12 17:25:34,593 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 564 selfloop transitions, 191 changer transitions 154/909 dead transitions. [2023-10-12 17:25:34,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 909 transitions, 13677 flow [2023-10-12 17:25:34,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 909 transitions, 13677 flow [2023-10-12 17:25:34,966 INFO L124 PetriNetUnfolderBase]: 1956/3275 cut-off events. [2023-10-12 17:25:34,966 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2023-10-12 17:25:34,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23870 conditions, 3275 events. 1956/3275 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 19396 event pairs, 22 based on Foata normal form. 0/2155 useless extension candidates. Maximal degree in co-relation 15668. Up to 3258 conditions per place. [2023-10-12 17:25:34,969 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 56 places, 909 transitions, 13677 flow [2023-10-12 17:25:35,011 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 56 places, 909 transitions, 13677 flow [2023-10-12 17:25:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-10-12 17:25:35,012 INFO L430 stractBuchiCegarLoop]: Abstraction has has 56 places, 909 transitions, 13677 flow [2023-10-12 17:25:35,012 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:25:35,012 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 56 places, 909 transitions, 13677 flow [2023-10-12 17:25:35,066 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:35,066 INFO L124 PetriNetUnfolderBase]: 322/534 cut-off events. [2023-10-12 17:25:35,066 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2023-10-12 17:25:35,066 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:35,067 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 112#[L58, L96, L41]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 112#[L58, L96, L41]true [126] L96-->L76: 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] 214#[L58, L41, L97, L76]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 214#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 214#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 214#[L58, L41, L97, L76]true [2023-10-12 17:25:35,067 INFO L750 eck$LassoCheckResult]: Loop: 214#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 214#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 214#[L58, L41, L97, L76]true [2023-10-12 17:25:35,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:35,067 INFO L85 PathProgramCache]: Analyzing trace with hash 772060437, now seen corresponding path program 1 times [2023-10-12 17:25:35,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:35,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724583871] [2023-10-12 17:25:35,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:35,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:35,091 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,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:35,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724583871] [2023-10-12 17:25:35,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724583871] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:25:35,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:25:35,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:25:35,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565548024] [2023-10-12 17:25:35,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:25:35,092 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:25:35,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:35,092 INFO L85 PathProgramCache]: Analyzing trace with hash 5569, now seen corresponding path program 2 times [2023-10-12 17:25:35,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:35,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377370174] [2023-10-12 17:25:35,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:35,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:35,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:35,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:35,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:35,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:25:35,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:25:35,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 909 transitions, 13677 flow. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:35,212 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:35,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:35,966 INFO L124 PetriNetUnfolderBase]: 3382/5734 cut-off events. [2023-10-12 17:25:35,966 INFO L125 PetriNetUnfolderBase]: For 2045/2045 co-relation queries the response was YES. [2023-10-12 17:25:35,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47390 conditions, 5734 events. 3382/5734 cut-off events. For 2045/2045 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 38012 event pairs, 2 based on Foata normal form. 0/3790 useless extension candidates. Maximal degree in co-relation 39110. Up to 5717 conditions per place. [2023-10-12 17:25:36,071 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 1201 selfloop transitions, 131 changer transitions 234/1566 dead transitions. [2023-10-12 17:25:36,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 1566 transitions, 26661 flow [2023-10-12 17:25:36,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 1566 transitions, 26661 flow [2023-10-12 17:25:37,192 INFO L124 PetriNetUnfolderBase]: 3382/5734 cut-off events. [2023-10-12 17:25:37,193 INFO L125 PetriNetUnfolderBase]: For 2045/2045 co-relation queries the response was YES. [2023-10-12 17:25:37,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47390 conditions, 5734 events. 3382/5734 cut-off events. For 2045/2045 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 37986 event pairs, 2 based on Foata normal form. 0/3790 useless extension candidates. Maximal degree in co-relation 39110. Up to 5717 conditions per place. [2023-10-12 17:25:37,196 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 59 places, 1566 transitions, 26661 flow [2023-10-12 17:25:37,218 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 59 places, 1566 transitions, 26661 flow [2023-10-12 17:25:37,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:25:37,219 INFO L430 stractBuchiCegarLoop]: Abstraction has has 59 places, 1566 transitions, 26661 flow [2023-10-12 17:25:37,219 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:25:37,219 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 59 places, 1566 transitions, 26661 flow [2023-10-12 17:25:37,462 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:37,462 INFO L124 PetriNetUnfolderBase]: 853/1409 cut-off events. [2023-10-12 17:25:37,462 INFO L125 PetriNetUnfolderBase]: For 493/493 co-relation queries the response was YES. [2023-10-12 17:25:37,462 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:37,463 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 112#[L58, L96, L41]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 112#[L58, L96, L41]true [142] L41-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_20 v_q1_back_38) 0) (<= v_N_10 v_i_22)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_38} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back] 149#[L58, L96, thread1EXIT]true [126] L96-->L76: 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] 343#[L58, L97, thread1EXIT, L76]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 343#[L58, L97, thread1EXIT, L76]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 343#[L58, L97, thread1EXIT, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 343#[L58, L97, thread1EXIT, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 343#[L58, L97, thread1EXIT, L76]true [2023-10-12 17:25:37,463 INFO L750 eck$LassoCheckResult]: Loop: 343#[L58, L97, thread1EXIT, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 343#[L58, L97, thread1EXIT, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 343#[L58, L97, thread1EXIT, L76]true [2023-10-12 17:25:37,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:37,463 INFO L85 PathProgramCache]: Analyzing trace with hash -638707374, now seen corresponding path program 1 times [2023-10-12 17:25:37,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:37,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289185199] [2023-10-12 17:25:37,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:37,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:37,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:37,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:37,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:37,481 INFO L85 PathProgramCache]: Analyzing trace with hash 5569, now seen corresponding path program 3 times [2023-10-12 17:25:37,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:37,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666488985] [2023-10-12 17:25:37,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:37,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:37,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:37,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:37,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:37,486 INFO L85 PathProgramCache]: Analyzing trace with hash 382541522, now seen corresponding path program 2 times [2023-10-12 17:25:37,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:37,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010531989] [2023-10-12 17:25:37,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:37,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:25:37,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:25:37,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010531989] [2023-10-12 17:25:37,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010531989] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:25:37,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186389799] [2023-10-12 17:25:37,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:25:37,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:25:37,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:37,544 INFO L229 MonitoredProcess]: Starting monitored process 12 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:37,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-10-12 17:25:37,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:25:37,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:25:37,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2023-10-12 17:25:37,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:25:37,595 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:25:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:25:37,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186389799] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:25:37,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:25:37,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-10-12 17:25:37,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818862120] [2023-10-12 17:25:37,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:25:37,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:25:37,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-10-12 17:25:37,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2023-10-12 17:25:37,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 1566 transitions, 26661 flow. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:37,744 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:25:37,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:25:40,446 INFO L124 PetriNetUnfolderBase]: 7077/12007 cut-off events. [2023-10-12 17:25:40,446 INFO L125 PetriNetUnfolderBase]: For 4285/4285 co-relation queries the response was YES. [2023-10-12 17:25:40,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111120 conditions, 12007 events. 7077/12007 cut-off events. For 4285/4285 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 87975 event pairs, 2 based on Foata normal form. 0/7902 useless extension candidates. Maximal degree in co-relation 93734. Up to 11990 conditions per place. [2023-10-12 17:25:40,501 INFO L140 encePairwiseOnDemand]: 49/52 looper letters, 2361 selfloop transitions, 408 changer transitions 463/3232 dead transitions. [2023-10-12 17:25:40,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 3232 transitions, 61449 flow [2023-10-12 17:25:40,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 3232 transitions, 61449 flow [2023-10-12 17:25:45,091 INFO L124 PetriNetUnfolderBase]: 7077/12007 cut-off events. [2023-10-12 17:25:45,091 INFO L125 PetriNetUnfolderBase]: For 4285/4285 co-relation queries the response was YES. [2023-10-12 17:25:45,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111120 conditions, 12007 events. 7077/12007 cut-off events. For 4285/4285 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 88020 event pairs, 2 based on Foata normal form. 0/7902 useless extension candidates. Maximal degree in co-relation 93734. Up to 11990 conditions per place. [2023-10-12 17:25:45,099 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 64 places, 3232 transitions, 61449 flow [2023-10-12 17:25:45,145 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 64 places, 3232 transitions, 61449 flow [2023-10-12 17:25:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-10-12 17:25:45,146 INFO L430 stractBuchiCegarLoop]: Abstraction has has 64 places, 3232 transitions, 61449 flow [2023-10-12 17:25:45,146 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:25:45,146 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 64 places, 3232 transitions, 61449 flow [2023-10-12 17:25:45,951 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:45,952 INFO L124 PetriNetUnfolderBase]: 1415/2323 cut-off events. [2023-10-12 17:25:45,952 INFO L125 PetriNetUnfolderBase]: For 824/824 co-relation queries the response was YES. [2023-10-12 17:25:45,952 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:45,952 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]true [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L41, L95-1]true [123] L95-1-->L58: 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] 112#[L58, L96, L41]true [126] L96-->L76: 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] 214#[L58, L41, L97, L76]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 214#[L58, L41, L97, L76]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 214#[L58, L41, L97, L76]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 214#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 214#[L58, L41, L97, L76]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 214#[L58, L41, L97, L76]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 214#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 214#[L58, L41, L97, L76]true [2023-10-12 17:25:45,953 INFO L750 eck$LassoCheckResult]: Loop: 214#[L58, L41, L97, L76]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 214#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 214#[L58, L41, L97, L76]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 214#[L58, L41, L97, L76]true [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 214#[L58, L41, L97, L76]true [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 214#[L58, L41, L97, L76]true [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 214#[L58, L41, L97, L76]true [2023-10-12 17:25:45,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:45,953 INFO L85 PathProgramCache]: Analyzing trace with hash 54797288, now seen corresponding path program 2 times [2023-10-12 17:25:45,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:45,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098184636] [2023-10-12 17:25:45,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:45,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:45,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:45,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:45,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash 880826297, now seen corresponding path program 1 times [2023-10-12 17:25:45,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:45,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362813153] [2023-10-12 17:25:45,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:45,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:45,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:45,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:45,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:45,988 INFO L85 PathProgramCache]: Analyzing trace with hash -358763936, now seen corresponding path program 3 times [2023-10-12 17:25:45,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:45,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869092661] [2023-10-12 17:25:45,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:45,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:46,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:46,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:47,730 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:47,730 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:47,731 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:47,731 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:47,731 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:47,731 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:47,731 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:47,731 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:47,731 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration9_Lasso [2023-10-12 17:25:47,731 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:47,731 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:47,863 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:47,865 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:26:00,580 WARN L223 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 907 DAG size of output: 147 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.setFormulaAndSimplify) [2023-10-12 17:26:00,582 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:26:00,583 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:26:00,584 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:26:00,585 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:26:00,587 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:26:01,042 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2023-10-12 17:26:01,044 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 28 [2023-10-12 17:26:05,862 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 89664 conjunctions. This might take some time... [2023-10-12 17:26:54,688 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 2576 conjunctions. [2023-10-12 17:29:05,053 WARN L223 SmtUtils]: Spent 2.16m on a formula simplification. DAG size of input: 2723 DAG size of output: 159 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2023-10-12 17:29:05,104 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:29:05,104 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:29:05,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:05,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:05,106 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:29:05,109 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:29:05,112 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:29:05,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:05,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:05,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:05,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:05,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:05,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:05,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:05,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:29:05,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:05,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:05,138 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:29:05,140 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:29:05,142 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:29:05,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:05,149 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-10-12 17:29:05,149 INFO L204 nArgumentSynthesizer]: 12 loop disjuncts [2023-10-12 17:29:05,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:06,383 INFO L401 nArgumentSynthesizer]: We have 360 Motzkin's Theorem applications. [2023-10-12 17:29:06,384 INFO L402 nArgumentSynthesizer]: A total of 24 supporting invariants were added. [2023-10-12 17:29:19,806 INFO L525 LassoAnalysis]: Proving termination failed: SMT Solver returned 'unknown'. [2023-10-12 17:29:19,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-10-12 17:29:19,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:19,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:19,876 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:29:19,877 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:29:19,884 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:29:19,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:19,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:19,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:19,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:19,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:19,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:19,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:19,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:29:19,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:19,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:19,904 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:29:19,905 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:29:19,908 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:29:19,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:19,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:19,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:19,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:19,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:19,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:19,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:19,956 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:29:19,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:19,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:19,957 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:29:19,959 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:29:19,961 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:29:19,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:19,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:19,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:19,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:19,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:19,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:19,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:19,974 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:29:19,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:19,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:19,975 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:29:19,977 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:29:19,980 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:29:19,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:19,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:19,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:19,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:20,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:20,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:20,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:20,025 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:29:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:20,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:20,041 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:29:20,042 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:29:20,046 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:29:20,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:20,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:20,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:20,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:20,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:20,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:20,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:20,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:20,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:20,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:20,061 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:29:20,062 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:29:20,064 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:29:20,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:20,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:20,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:20,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:20,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:20,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:20,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:20,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-10-12 17:29:20,078 INFO L490 LassoAnalysis]: Using template '2-nested'. [2023-10-12 17:29:20,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:20,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:20,079 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:29:20,079 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:29:20,083 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:29:20,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:20,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:20,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:20,089 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-10-12 17:29:20,091 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2023-10-12 17:29:20,091 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2023-10-12 17:29:20,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:20,097 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:29:20,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:20,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:20,098 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:29:20,100 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:29:20,102 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:29:20,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:20,111 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-10-12 17:29:20,111 INFO L204 nArgumentSynthesizer]: 12 loop disjuncts [2023-10-12 17:29:20,111 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-10-12 17:29:21,637 INFO L401 nArgumentSynthesizer]: We have 540 Motzkin's Theorem applications. [2023-10-12 17:29:21,638 INFO L402 nArgumentSynthesizer]: A total of 36 supporting invariants were added. [2023-10-12 17:29:35,839 INFO L525 LassoAnalysis]: Proving termination failed: SMT Solver returned 'unknown'. [2023-10-12 17:29:35,942 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:29:35,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:35,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:35,944 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:29:35,945 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:29:35,952 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:29:35,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:35,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:35,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:35,959 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-10-12 17:29:35,962 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2023-10-12 17:29:35,962 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2023-10-12 17:29:35,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:35,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-10-12 17:29:35,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:35,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:35,973 INFO L229 MonitoredProcess]: Starting monitored process 24 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:29:35,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:29:35,977 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:29:35,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:35,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:35,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:35,984 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-10-12 17:29:35,986 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2023-10-12 17:29:35,986 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2023-10-12 17:29:35,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:35,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:35,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:35,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:35,996 INFO L229 MonitoredProcess]: Starting monitored process 25 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:29:35,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:29:36,000 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:29:36,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:36,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:36,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:36,008 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-10-12 17:29:36,009 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2023-10-12 17:29:36,009 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2023-10-12 17:29:36,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:36,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:36,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:36,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:36,025 INFO L229 MonitoredProcess]: Starting monitored process 26 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:29:36,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:29:36,028 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:29:36,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:36,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:36,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:36,035 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-10-12 17:29:36,036 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2023-10-12 17:29:36,036 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2023-10-12 17:29:36,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:36,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:36,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:36,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:36,043 INFO L229 MonitoredProcess]: Starting monitored process 27 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:29:36,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:29:36,046 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:29:36,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:36,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:36,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:36,053 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-10-12 17:29:36,054 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2023-10-12 17:29:36,054 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2023-10-12 17:29:36,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:36,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:36,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:36,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:36,065 INFO L229 MonitoredProcess]: Starting monitored process 28 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:29:36,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:29:36,069 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:29:36,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:36,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:36,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:36,076 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2023-10-12 17:29:36,077 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2023-10-12 17:29:36,077 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2023-10-12 17:29:36,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:36,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:36,086 INFO L490 LassoAnalysis]: Using template '3-nested'. [2023-10-12 17:29:36,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:36,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:36,087 INFO L229 MonitoredProcess]: Starting monitored process 29 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:29:36,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-10-12 17:29:36,098 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:29:36,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:36,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:36,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:36,105 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-10-12 17:29:36,107 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2023-10-12 17:29:36,107 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:29:36,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:36,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-10-12 17:29:36,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:36,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:36,115 INFO L229 MonitoredProcess]: Starting monitored process 30 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:29:36,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-10-12 17:29:36,119 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:29:36,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:36,130 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-10-12 17:29:36,130 INFO L204 nArgumentSynthesizer]: 12 loop disjuncts [2023-10-12 17:29:36,130 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2023-10-12 17:29:38,319 INFO L401 nArgumentSynthesizer]: We have 720 Motzkin's Theorem applications. [2023-10-12 17:29:38,319 INFO L402 nArgumentSynthesizer]: A total of 48 supporting invariants were added. Received shutdown request... [2023-10-12 17:29:53,897 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:29:53,897 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:29:53,898 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:29:53,898 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:29:53,898 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:29:54,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:54,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:54,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:54,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:55,098 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forcibly destroying the process [2023-10-12 17:29:55,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 137 [2023-10-12 17:29:55,140 INFO L201 PluginConnector]: Adding new model ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:29:55 BoogieIcfgContainer [2023-10-12 17:29:55,140 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:29:55,141 INFO L158 Benchmark]: Toolchain (without parser) took 266247.79ms. Allocated memory was 164.6MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 118.8MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2023-10-12 17:29:55,141 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 164.6MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:29:55,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.99ms. Allocated memory is still 164.6MB. Free memory was 118.6MB in the beginning and 117.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:29:55,141 INFO L158 Benchmark]: Boogie Preprocessor took 13.01ms. Allocated memory is still 164.6MB. Free memory was 117.2MB in the beginning and 116.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:29:55,141 INFO L158 Benchmark]: RCFGBuilder took 229.29ms. Allocated memory is still 164.6MB. Free memory was 116.0MB in the beginning and 103.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-10-12 17:29:55,141 INFO L158 Benchmark]: BuchiAutomizer took 265984.55ms. Allocated memory was 164.6MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 103.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2023-10-12 17:29:55,142 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.22ms. Allocated memory is still 164.6MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.99ms. Allocated memory is still 164.6MB. Free memory was 118.6MB in the beginning and 117.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.01ms. Allocated memory is still 164.6MB. Free memory was 117.2MB in the beginning and 116.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 229.29ms. Allocated memory is still 164.6MB. Free memory was 116.0MB in the beginning and 103.2MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 265984.55ms. Allocated memory was 164.6MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 103.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Decomposition not yet finished - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 265.9s and 9 iterations. TraceHistogramMax:0. Analysis of lassos took 252.4s. Construction of modules took 0.4s. Büchi inclusion checks took 11.1s. 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 473 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 473 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 748 IncrementalHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 92 mSDtfsCounter, 748 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU2 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital85 mio100 ax100 hnf100 lsp404 ukn28 mio100 lsp100 div100 bol100 ite100 ukn100 eq201 hnf97 smp100 dnf205 smp30 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 228ms VariablesStem: 7 VariablesLoop: 14 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.6s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while BuchiPetriNetCegarLoop was analyzing lasso (stem: length 12 TraceHistMax 3 loop: length 7 TraceHistMax 2),while executing Executor. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 37 PlacesBefore, 22 PlacesAfterwards, 30 TransitionsBefore, 15 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 304 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 281, independent: 275, independent conditional: 0, independent unconditional: 275, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 212, independent: 206, independent conditional: 0, independent unconditional: 206, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 212, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 281, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 212, unknown conditional: 0, unknown unconditional: 212] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown