/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 RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:38:44,505 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:44,568 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:38:44,592 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:44,593 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:44,593 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:44,594 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:44,594 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:44,594 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:44,597 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:44,597 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:44,597 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:44,598 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:44,599 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:44,599 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:44,599 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:44,599 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:44,600 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:44,600 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:44,600 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:44,601 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:44,602 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:44,602 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:44,602 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:44,602 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:44,602 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:44,602 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:44,602 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:44,603 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:44,603 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:44,603 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:44,604 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:44,604 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:44,605 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:44,605 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 -> RABIN_PETRI_NET [2023-10-12 17:38:44,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:44,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:44,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:44,838 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:44,839 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:44,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl [2023-10-12 17:38:44,840 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl' [2023-10-12 17:38:44,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:44,859 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:44,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:44,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:44,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:44,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:44" (1/1) ... [2023-10-12 17:38:44,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:44" (1/1) ... [2023-10-12 17:38:44,878 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:44,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:44,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:44,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:44,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:44,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:44" (1/1) ... [2023-10-12 17:38:44,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:44" (1/1) ... [2023-10-12 17:38:44,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:44" (1/1) ... [2023-10-12 17:38:44,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:44" (1/1) ... [2023-10-12 17:38:44,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:44" (1/1) ... [2023-10-12 17:38:44,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:44" (1/1) ... [2023-10-12 17:38:44,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:44" (1/1) ... [2023-10-12 17:38:44,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:44" (1/1) ... [2023-10-12 17:38:44,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:44,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:44,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:44,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:44,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:44" (1/1) ... [2023-10-12 17:38:44,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:44,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:44,917 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:38:44,962 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:38:44,982 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:44,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:44,983 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:44,983 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:44,983 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:44,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:44,984 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:38:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:38:44,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:38:44,984 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:38:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:38:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:38:44,985 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:38:45,039 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:45,041 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:45,158 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:45,174 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:45,175 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:38:45,176 INFO L201 PluginConnector]: Adding new model buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:45 BoogieIcfgContainer [2023-10-12 17:38:45,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:45,177 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:45,177 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:45,181 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:45,181 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:45,181 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:44" (1/2) ... [2023-10-12 17:38:45,182 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ea484a4 and model type buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:38:45, skipping insertion in model container [2023-10-12 17:38:45,182 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:45,183 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:45" (2/2) ... [2023-10-12 17:38:45,185 INFO L332 chiAutomizerObserver]: Analyzing ICFG buffer-mult-alt.wvr.bpl [2023-10-12 17:38:45,237 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:38:45,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:38:45,274 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:38:45,274 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:38:45,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:38:45,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:38:45,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2023-10-12 17:38:45,285 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:38:45,294 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:38:45,296 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:38:45,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 86 flow [2023-10-12 17:38:45,303 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:38:45,303 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:38:45,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:38:45,304 INFO L119 LiptonReduction]: Number of co-enabled transitions 350 [2023-10-12 17:38:45,473 INFO L134 LiptonReduction]: Checked pairs total: 553 [2023-10-12 17:38:45,473 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:38:45,482 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:38:45,482 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:38:45,482 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:38:45,482 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:38:45,482 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:38:45,483 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:38:45,483 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:38:45,483 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:38:45,483 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:38:45,486 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][9], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1]][5:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][18], 6:4A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][11]] [2023-10-12 17:38:45,487 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:45,487 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:38:45,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:45,488 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:45,490 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:38:45,490 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:38:45,492 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][9], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1]][5:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][18], 6:4A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][11]] [2023-10-12 17:38:45,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:45,493 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:38:45,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:45,494 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:45,499 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [2023-10-12 17:38:45,500 INFO L750 eck$LassoCheckResult]: Loop: 52#[L74-1, L25]true [126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back] 55#[L74-1, L26-1]true [90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i] 52#[L74-1, L25]true [2023-10-12 17:38:45,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:45,504 INFO L85 PathProgramCache]: Analyzing trace with hash 3454, now seen corresponding path program 1 times [2023-10-12 17:38:45,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:45,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394704106] [2023-10-12 17:38:45,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:45,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:45,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:45,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:45,608 INFO L85 PathProgramCache]: Analyzing trace with hash 4957, now seen corresponding path program 1 times [2023-10-12 17:38:45,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:45,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762878810] [2023-10-12 17:38:45,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:45,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:45,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:45,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:45,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash 3323290, now seen corresponding path program 1 times [2023-10-12 17:38:45,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:45,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809585322] [2023-10-12 17:38:45,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:45,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:45,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:45,742 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:45,742 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:45,743 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:45,743 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:45,743 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:45,743 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:45,743 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:45,743 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:45,743 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:38:45,743 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:45,743 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:45,754 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:38:45,766 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:38:45,777 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:38:45,780 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:38:45,782 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:38:45,784 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:38:45,852 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:45,855 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:45,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:45,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:45,859 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:38:45,901 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:38:45,902 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:38:45,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:45,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:45,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:45,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:45,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:45,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:45,937 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:45,957 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:38:45,958 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:38:45,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:45,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:46,070 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:38:46,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:46,085 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:38:46,095 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:46,095 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:46,096 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:38:46,102 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:38:46,104 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:46,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:46,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:46,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:46,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:46,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:46,168 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:38:46,196 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:38:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:38:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-10-12 17:38:46,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:38:46,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:46,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:38:46,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:46,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:38:46,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:46,323 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 115 transitions, 580 flow [2023-10-12 17:38:46,323 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:38:46,323 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 37 places, 115 transitions, 580 flow [2023-10-12 17:38:46,332 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][49], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][9], 3:3A:[109] L74-1-->L37: 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][50]][14:4A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][98], 17:5A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][43]] [2023-10-12 17:38:46,332 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:46,333 INFO L124 PetriNetUnfolderBase]: 7/16 cut-off events. [2023-10-12 17:38:46,333 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:38:46,333 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:46,333 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [109] L74-1-->L37: 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] 95#[L75, L37, L25]true [2023-10-12 17:38:46,334 INFO L750 eck$LassoCheckResult]: Loop: 95#[L75, L37, L25]true [122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back] 98#[L75, L38-1, L25]true [95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j] 95#[L75, L37, L25]true [2023-10-12 17:38:46,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:46,336 INFO L85 PathProgramCache]: Analyzing trace with hash 107183, now seen corresponding path program 1 times [2023-10-12 17:38:46,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:46,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597722798] [2023-10-12 17:38:46,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:46,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:46,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:46,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:46,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:46,359 INFO L85 PathProgramCache]: Analyzing trace with hash 4838, now seen corresponding path program 1 times [2023-10-12 17:38:46,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:46,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513894420] [2023-10-12 17:38:46,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:46,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:46,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:46,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:46,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:46,365 INFO L85 PathProgramCache]: Analyzing trace with hash 103006740, now seen corresponding path program 1 times [2023-10-12 17:38:46,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:46,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792501928] [2023-10-12 17:38:46,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:46,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:46,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:46,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:46,453 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:46,454 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:46,454 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:46,454 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:46,454 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:46,454 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:46,454 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:46,454 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:46,455 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:38:46,455 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:46,455 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:46,457 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:38:46,465 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:38:46,467 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:38:46,470 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:38:46,477 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:38:46,479 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:38:46,482 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:38:46,485 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:38:46,557 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:46,558 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:46,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:46,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:46,559 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:38:46,585 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:38:46,586 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:38:46,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:46,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:46,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:46,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:46,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:46,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:46,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:46,622 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:38:46,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:46,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:46,624 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:38:46,626 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:38:46,658 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:38:46,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:46,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:46,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:46,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:46,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:46,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:46,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:46,691 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:38:46,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:46,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:46,693 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:38:46,695 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:38:46,697 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:38:46,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:46,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:46,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:46,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:46,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:46,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:46,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:46,734 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:38:46,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:46,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:46,736 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:38:46,752 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:38:46,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:46,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:46,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:46,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:46,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:46,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:46,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:46,789 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:38:46,789 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:38:46,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:46,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:46,805 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:38:46,817 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:38:46,818 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:38:46,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:46,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:46,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:46,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:46,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:46,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:46,851 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:46,868 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:38:46,892 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:38:46,893 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:38:46,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:46,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:46,909 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:38:46,911 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:38:46,913 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:46,938 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:46,938 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:46,938 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:38:46,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:38:46,954 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:46,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:46,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:46,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:46,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:46,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:46,997 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:38:46,997 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:38:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:38:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-10-12 17:38:47,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:38:47,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:47,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:38:47,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:47,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:38:47,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:47,092 INFO L430 stractBuchiCegarLoop]: Abstraction has has 42 places, 575 transitions, 4050 flow [2023-10-12 17:38:47,092 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:38:47,092 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 42 places, 575 transitions, 4050 flow [2023-10-12 17:38:47,097 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][248], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][48], 3:3A:[109] L74-1-->L37: 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][253], 7:4A:[112] L75-->L50-1: 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][191]][30:5A:[97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[][67], 31:6A:[99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total][317]] [2023-10-12 17:38:47,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:47,098 INFO L124 PetriNetUnfolderBase]: 17/30 cut-off events. [2023-10-12 17:38:47,098 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:38:47,098 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:47,098 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [109] L74-1-->L37: 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] 95#[L75, L37, L25]true [112] L75-->L50-1: 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] 136#[L50-1, L37, L76, L25]true [2023-10-12 17:38:47,098 INFO L750 eck$LassoCheckResult]: Loop: 136#[L50-1, L37, L76, L25]true [97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 139#[L37, L50, L76, L25]true [99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total] 136#[L50-1, L37, L76, L25]true [2023-10-12 17:38:47,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 3322785, now seen corresponding path program 1 times [2023-10-12 17:38:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:47,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121057554] [2023-10-12 17:38:47,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:47,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:47,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:47,107 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2023-10-12 17:38:47,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:47,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482453007] [2023-10-12 17:38:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:47,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:47,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:47,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1101767805, now seen corresponding path program 1 times [2023-10-12 17:38:47,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:47,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651277646] [2023-10-12 17:38:47,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:47,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:47,150 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:38:47,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:47,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651277646] [2023-10-12 17:38:47,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651277646] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:47,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:47,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:38:47,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542001070] [2023-10-12 17:38:47,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:47,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:38:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:38:47,176 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 42 places, 575 transitions, 4050 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:47,176 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:47,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:47,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:47,377 INFO L124 PetriNetUnfolderBase]: 1507/2078 cut-off events. [2023-10-12 17:38:47,378 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2023-10-12 17:38:47,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8687 conditions, 2078 events. 1507/2078 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 7861 event pairs, 194 based on Foata normal form. 57/1444 useless extension candidates. Maximal degree in co-relation 6550. Up to 1484 conditions per place. [2023-10-12 17:38:47,397 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 226 selfloop transitions, 6 changer transitions 0/232 dead transitions. [2023-10-12 17:38:47,397 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 43 places, 232 transitions, 2039 flow [2023-10-12 17:38:47,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:38:47,398 INFO L430 stractBuchiCegarLoop]: Abstraction has has 43 places, 232 transitions, 2039 flow [2023-10-12 17:38:47,398 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:38:47,398 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 43 places, 232 transitions, 2039 flow [2023-10-12 17:38:47,399 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][2]][6:4A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][5], 7:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][13]] [2023-10-12 17:38:47,405 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][2], 8:4A:[109] L74-1-->L37: 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][6], 40:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][17]][92:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][49], 95:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][74]] [2023-10-12 17:38:47,405 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][2], 8:4A:[109] L74-1-->L37: 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][6], 42:5A:[121] L37-->thread2EXIT: Formula: (<= v_M_6 v_j_8) InVars {M=v_M_6, j=v_j_8} OutVars{M=v_M_6, j=v_j_8} AuxVars[] AssignedVars[][18]][98:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][21], 100:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][45]] [2023-10-12 17:38:47,406 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][2], 8:4A:[109] L74-1-->L37: 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][6], 43:5A:[112] L75-->L50-1: 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][19]][102:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][21], 107:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][45]] [2023-10-12 17:38:47,406 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][2], 8:4A:[109] L74-1-->L37: 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][6], 43:5A:[112] L75-->L50-1: 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][19]][117:6A:[97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[][52], 118:7A:[99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total][86]] [2023-10-12 17:38:47,407 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:47,407 INFO L124 PetriNetUnfolderBase]: 77/117 cut-off events. [2023-10-12 17:38:47,407 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-10-12 17:38:47,407 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:47,407 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back] 55#[L74-1, L26-1]true [109] L74-1-->L37: 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] 154#[L75, L37, L26-1]true [112] L75-->L50-1: 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] 156#[L50-1, L37, L26-1, L76]true [2023-10-12 17:38:47,407 INFO L750 eck$LassoCheckResult]: Loop: 156#[L50-1, L37, L26-1, L76]true [97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 159#[L37, L26-1, L50, L76]true [99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total] 156#[L50-1, L37, L26-1, L76]true [2023-10-12 17:38:47,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:47,408 INFO L85 PathProgramCache]: Analyzing trace with hash 103022691, now seen corresponding path program 1 times [2023-10-12 17:38:47,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:47,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170606007] [2023-10-12 17:38:47,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:47,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:47,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:47,417 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 2 times [2023-10-12 17:38:47,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:47,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313155267] [2023-10-12 17:38:47,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:47,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:47,423 INFO L85 PathProgramCache]: Analyzing trace with hash 220561349, now seen corresponding path program 1 times [2023-10-12 17:38:47,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:47,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799229298] [2023-10-12 17:38:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:47,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:47,566 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:47,566 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:47,566 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:47,566 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:47,566 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:47,566 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:47,566 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:47,566 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:47,566 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:38:47,566 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:47,566 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:47,567 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:38:47,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:38:47,588 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:38:47,592 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:38:47,594 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:38:47,596 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:38:47,598 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:38:47,600 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:38:47,602 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:38:47,604 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:38:47,606 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:38:47,717 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:47,718 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:47,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:47,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:47,733 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:47,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:38:47,737 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:38:47,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:47,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:47,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:47,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:47,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:47,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:47,756 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:47,761 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:38:47,761 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:38:47,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:47,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:47,762 INFO L229 MonitoredProcess]: Starting monitored process 11 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:38:47,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:38:47,765 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:47,784 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:47,784 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:47,784 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:38:47,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:38:47,796 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:47,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:47,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:47,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:47,822 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:47,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:47,824 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:38:47,824 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:38:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:38:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:47,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:38:47,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:38:47,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:47,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:38:47,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:47,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:38:47,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:47,877 INFO L430 stractBuchiCegarLoop]: Abstraction has has 48 places, 1160 transitions, 12515 flow [2023-10-12 17:38:47,877 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:38:47,877 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 48 places, 1160 transitions, 12515 flow [2023-10-12 17:38:47,880 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][1], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 3:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][11]][6:4A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][26], 7:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][66]] [2023-10-12 17:38:47,892 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][1], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 3:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][11], 8:4A:[109] L74-1-->L37: 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][31], 36:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][86]][101:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][246], 102:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][371]] [2023-10-12 17:38:47,893 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][1], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 3:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][11], 8:4A:[109] L74-1-->L37: 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][31], 38:5A:[121] L37-->thread2EXIT: Formula: (<= v_M_6 v_j_8) InVars {M=v_M_6, j=v_j_8} OutVars{M=v_M_6, j=v_j_8} AuxVars[] AssignedVars[][91]][107:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][106], 108:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][226]] [2023-10-12 17:38:47,899 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][1], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 5:3A:[109] L74-1-->L37: 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][21], 19:4A:[112] L75-->L50-1: 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][51], 48:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][138]][164:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][109], 165:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][229]] [2023-10-12 17:38:47,903 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][1], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 5:3A:[109] L74-1-->L37: 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][21], 19:4A:[112] L75-->L50-1: 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][51], 46:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][133]][188:6A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][175], 194:7A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][60]] [2023-10-12 17:38:47,905 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:47,905 INFO L124 PetriNetUnfolderBase]: 137/202 cut-off events. [2023-10-12 17:38:47,905 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-10-12 17:38:47,906 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:47,906 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [109] L74-1-->L37: 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] 95#[L75, L37, L25]true [112] L75-->L50-1: 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] 136#[L50-1, L37, L76, L25]true [97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 139#[L37, L50, L76, L25]true [126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back] 159#[L37, L26-1, L50, L76]true [99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total] 156#[L50-1, L37, L26-1, L76]true [2023-10-12 17:38:47,906 INFO L750 eck$LassoCheckResult]: Loop: 156#[L50-1, L37, L26-1, L76]true [97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 159#[L37, L26-1, L50, L76]true [99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total] 156#[L50-1, L37, L26-1, L76]true [2023-10-12 17:38:47,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:47,906 INFO L85 PathProgramCache]: Analyzing trace with hash 204937349, now seen corresponding path program 2 times [2023-10-12 17:38:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:47,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279593022] [2023-10-12 17:38:47,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:47,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:47,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:47,917 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 3 times [2023-10-12 17:38:47,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:47,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705953544] [2023-10-12 17:38:47,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:47,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:47,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash -623700121, now seen corresponding path program 3 times [2023-10-12 17:38:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:47,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014354852] [2023-10-12 17:38:47,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:47,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:47,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-10-12 17:38:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:38:48,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:48,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014354852] [2023-10-12 17:38:48,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014354852] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:38:48,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525690060] [2023-10-12 17:38:48,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-10-12 17:38:48,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:38:48,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:48,065 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:38:48,125 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:38:48,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-10-12 17:38:48,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:38:48,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:48,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:38:48,194 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:38:48,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525690060] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:48,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:38:48,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:38:48,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820337421] [2023-10-12 17:38:48,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:48,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:48,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:38:48,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:38:48,215 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 48 places, 1160 transitions, 12515 flow. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:48,215 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:48,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:49,067 INFO L124 PetriNetUnfolderBase]: 5988/8094 cut-off events. [2023-10-12 17:38:49,067 INFO L125 PetriNetUnfolderBase]: For 1334/1334 co-relation queries the response was YES. [2023-10-12 17:38:49,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49827 conditions, 8094 events. 5988/8094 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 36398 event pairs, 71 based on Foata normal form. 182/5547 useless extension candidates. Maximal degree in co-relation 47189. Up to 7479 conditions per place. [2023-10-12 17:38:49,133 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 999 selfloop transitions, 138 changer transitions 0/1137 dead transitions. [2023-10-12 17:38:49,133 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 50 places, 1137 transitions, 14295 flow [2023-10-12 17:38:49,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:38:49,134 INFO L430 stractBuchiCegarLoop]: Abstraction has has 50 places, 1137 transitions, 14295 flow [2023-10-12 17:38:49,134 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:38:49,134 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 50 places, 1137 transitions, 14295 flow [2023-10-12 17:38:49,148 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[109] L74-1-->L37: 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][2], 8:4A:[112] L75-->L50-1: 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][7], 35:5A:[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][20]][160:6A:[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][55], 161:7A:[103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front][144]] [2023-10-12 17:38:49,149 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:49,149 INFO L124 PetriNetUnfolderBase]: 104/160 cut-off events. [2023-10-12 17:38:49,149 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-10-12 17:38:49,149 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:49,149 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [109] L74-1-->L37: 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] 95#[L75, L37, L25]true [112] L75-->L50-1: 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] 136#[L50-1, L37, L76, L25]true [115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 248#[L50-1, L37, L62-1, L77, L25]true [2023-10-12 17:38:49,149 INFO L750 eck$LassoCheckResult]: Loop: 248#[L50-1, L37, L62-1, L77, L25]true [101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 251#[L62, L50-1, L37, L77, L25]true [103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front] 248#[L50-1, L37, L62-1, L77, L25]true [2023-10-12 17:38:49,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:49,150 INFO L85 PathProgramCache]: Analyzing trace with hash 103006450, now seen corresponding path program 1 times [2023-10-12 17:38:49,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:49,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266874159] [2023-10-12 17:38:49,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:49,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:49,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:49,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:49,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2023-10-12 17:38:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:49,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706671240] [2023-10-12 17:38:49,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:49,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:49,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:49,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:49,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:49,188 INFO L85 PathProgramCache]: Analyzing trace with hash 204953876, now seen corresponding path program 1 times [2023-10-12 17:38:49,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:49,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676933988] [2023-10-12 17:38:49,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:49,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:49,201 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:38:49,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:38:49,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676933988] [2023-10-12 17:38:49,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676933988] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:38:49,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:38:49,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:38:49,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099889366] [2023-10-12 17:38:49,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:38:49,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:38:49,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:38:49,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:38:49,220 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 50 places, 1137 transitions, 14295 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:49,220 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:38:49,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:38:50,614 INFO L124 PetriNetUnfolderBase]: 8475/11548 cut-off events. [2023-10-12 17:38:50,615 INFO L125 PetriNetUnfolderBase]: For 2000/2000 co-relation queries the response was YES. [2023-10-12 17:38:50,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82747 conditions, 11548 events. 8475/11548 cut-off events. For 2000/2000 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 56003 event pairs, 175 based on Foata normal form. 252/7740 useless extension candidates. Maximal degree in co-relation 77812. Up to 10680 conditions per place. [2023-10-12 17:38:50,693 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 1466 selfloop transitions, 43 changer transitions 0/1509 dead transitions. [2023-10-12 17:38:50,694 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 52 places, 1509 transitions, 22035 flow [2023-10-12 17:38:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:38:50,694 INFO L430 stractBuchiCegarLoop]: Abstraction has has 52 places, 1509 transitions, 22035 flow [2023-10-12 17:38:50,695 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:38:50,695 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 52 places, 1509 transitions, 22035 flow [2023-10-12 17:38:50,704 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[109] L74-1-->L37: 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][2], 8:4A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][7]][66:5A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][26], 67:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][72]] [2023-10-12 17:38:50,711 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[109] L74-1-->L37: 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][2], 6:4A:[112] L75-->L50-1: 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][5], 30:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][16]][121:6A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][53], 122:7A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][119]] [2023-10-12 17:38:50,716 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[109] L74-1-->L37: 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][2], 8:4A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][7], 57:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][23]][166:6A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][62], 167:7A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][127]] [2023-10-12 17:38:50,718 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[109] L74-1-->L37: 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][2], 8:4A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][7], 58:5A:[125] L25-->thread1EXIT: Formula: (<= v_N_20 v_i_26) InVars {N=v_N_20, i=v_i_26} OutVars{N=v_N_20, i=v_i_26} AuxVars[] AssignedVars[][24]][174:6A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][26], 175:7A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][72]] [2023-10-12 17:38:50,724 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 5:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][4], 19:4A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][11], 82:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][34]][243:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][91], 244:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][197]] [2023-10-12 17:38:50,736 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[109] L74-1-->L37: 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][2], 6:4A:[112] L75-->L50-1: 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][5], 25:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][13], 94:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][45]][343:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][111], 344:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][257]] [2023-10-12 17:38:50,738 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[109] L74-1-->L37: 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][2], 6:4A:[112] L75-->L50-1: 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][5], 26:5A:[125] L25-->thread1EXIT: Formula: (<= v_N_20 v_i_26) InVars {N=v_N_20, i=v_i_26} OutVars{N=v_N_20, i=v_i_26} AuxVars[] AssignedVars[][14], 98:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][46]][350:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][53], 351:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][119]] [2023-10-12 17:38:50,743 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[109] L74-1-->L37: 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][2], 6:4A:[112] L75-->L50-1: 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][5], 30:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][16], 123:6A:[120] L50-1-->thread3EXIT: Formula: (and (<= v_N_8 v_i_10) (<= v_q1_back_18 v_q1_front_18)) InVars {q1_front=v_q1_front_18, N=v_N_8, i=v_i_10, q1_back=v_q1_back_18} OutVars{q1_front=v_q1_front_18, N=v_N_8, i=v_i_10, q1_back=v_q1_back_18} AuxVars[] AssignedVars[][56]][396:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][53], 397:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][119]] [2023-10-12 17:38:50,743 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[109] L74-1-->L37: 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][2], 6:4A:[112] L75-->L50-1: 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][5], 30:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][16], 125:6A:[97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[][57]][399:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][53], 400:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][119]] [2023-10-12 17:38:50,744 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[109] L74-1-->L37: 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][2], 6:4A:[112] L75-->L50-1: 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][5], 30:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][16], 128:6A:[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][58]][403:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][53], 406:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][119]] [2023-10-12 17:38:50,749 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[109] L74-1-->L37: 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][2], 6:4A:[112] L75-->L50-1: 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][5], 30:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][16], 128:6A:[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][58]][461:7A:[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][122], 466:8A:[103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front][285]] [2023-10-12 17:38:50,749 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:50,749 INFO L124 PetriNetUnfolderBase]: 328/465 cut-off events. [2023-10-12 17:38:50,749 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-10-12 17:38:50,749 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:50,750 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [109] L74-1-->L37: 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] 95#[L75, L37, L25]true [112] L75-->L50-1: 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] 136#[L50-1, L37, L76, L25]true [122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back] 267#[L38-1, L50-1, L76, L25]true [115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 269#[L38-1, L50-1, L62-1, L25, L77]true [2023-10-12 17:38:50,750 INFO L750 eck$LassoCheckResult]: Loop: 269#[L38-1, L50-1, L62-1, L25, L77]true [101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 272#[L62, L38-1, L50-1, L25, L77]true [103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front] 269#[L38-1, L50-1, L62-1, L25, L77]true [2023-10-12 17:38:50,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:50,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1101767014, now seen corresponding path program 1 times [2023-10-12 17:38:50,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:50,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397068909] [2023-10-12 17:38:50,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:50,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:50,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:50,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:50,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 2 times [2023-10-12 17:38:50,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:50,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099197755] [2023-10-12 17:38:50,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:50,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:50,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:50,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:50,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:50,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2058824892, now seen corresponding path program 1 times [2023-10-12 17:38:50,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:50,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698104102] [2023-10-12 17:38:50,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:50,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:50,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:50,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:50,962 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:50,963 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:50,963 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:50,963 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:50,963 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:50,963 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:50,963 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:50,963 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:50,963 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:38:50,963 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:50,963 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:50,964 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:38:50,966 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:38:50,968 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:38:50,970 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:38:50,973 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:38:50,975 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:38:50,977 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:38:50,979 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:38:50,980 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:38:50,982 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:38:50,984 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:38:50,998 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:38:51,000 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:38:51,002 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:38:51,004 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:38:51,115 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:51,115 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:51,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,131 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:38:51,132 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:38:51,133 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:38:51,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:51,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:51,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:51,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:51,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:51,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:51,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:51,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:51,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,163 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:38:51,181 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:38:51,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:51,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:51,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:51,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:51,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:51,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:51,191 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:38:51,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:51,205 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:38:51,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,207 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:38:51,209 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:38:51,210 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:38:51,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:51,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:51,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:51,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:51,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:51,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:51,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:51,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:51,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,251 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:38:51,252 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:38:51,255 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:38:51,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:51,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:51,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:51,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:51,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:51,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:51,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:51,283 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:38:51,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,284 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:38:51,286 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:38:51,287 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:38:51,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:51,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:51,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:51,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:51,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:51,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:51,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:51,309 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:38:51,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,310 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:38:51,313 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:38:51,315 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:38:51,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:51,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:51,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:51,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:51,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:51,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:51,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:51,338 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:38:51,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,339 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:38:51,341 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:38:51,342 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:38:51,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:51,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:51,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:51,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:51,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:51,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:51,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:51,368 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:38:51,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,370 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:38:51,372 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:38:51,373 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:38:51,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:51,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:51,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:51,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:51,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:51,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:51,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:51,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:51,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,402 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:38:51,404 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:38:51,405 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:38:51,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:51,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:51,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:51,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:51,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:51,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:51,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:51,422 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:38:51,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,423 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:38:51,425 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:38:51,427 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:38:51,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:51,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:51,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:51,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:51,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:51,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:51,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:51,441 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:38:51,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,442 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:38:51,443 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:38:51,445 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:38:51,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:51,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:51,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:51,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:51,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:51,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:51,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:51,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:51,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,493 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:38:51,496 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:38:51,498 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:38:51,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:51,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:51,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:51,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:51,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:51,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:51,520 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:51,524 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:38:51,525 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:38:51,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:51,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:51,529 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:38:51,530 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:38:51,532 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:51,548 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:51,548 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:51,548 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2023-10-12 17:38:51,579 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:38:51,580 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:51,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:51,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:51,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:51,615 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:51,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:51,617 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:38:51,617 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:38:51,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:38:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:38:51,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:38:51,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:51,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:38:51,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:51,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:38:51,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:51,714 INFO L430 stractBuchiCegarLoop]: Abstraction has has 57 places, 7545 transitions, 125265 flow [2023-10-12 17:38:51,714 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:38:51,714 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 57 places, 7545 transitions, 125265 flow [2023-10-12 17:38:51,842 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[109] L74-1-->L37: 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][10], 8:4A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][35]][60:5A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][130], 61:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][360]] [2023-10-12 17:38:51,950 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[109] L74-1-->L37: 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][10], 6:4A:[112] L75-->L50-1: 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][25], 30:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][80]][105:6A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][265], 106:7A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][595]] [2023-10-12 17:38:52,041 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[109] L74-1-->L37: 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][10], 8:4A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][35], 51:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][115]][185:6A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][310], 186:7A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][635]] [2023-10-12 17:38:52,055 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[109] L74-1-->L37: 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][10], 8:4A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][35], 52:5A:[125] L25-->thread1EXIT: Formula: (<= v_N_20 v_i_26) InVars {N=v_N_20, i=v_i_26} OutVars{N=v_N_20, i=v_i_26} AuxVars[] AssignedVars[][120]][193:6A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][130], 194:7A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][360]] [2023-10-12 17:38:52,146 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 5:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][20], 19:4A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][55], 76:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][170]][258:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][455], 259:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][985]] [2023-10-12 17:38:52,321 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[109] L74-1-->L37: 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][10], 6:4A:[112] L75-->L50-1: 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][25], 25:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][65], 85:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][225]][365:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][555], 366:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][1285]] [2023-10-12 17:38:52,344 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[109] L74-1-->L37: 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][10], 6:4A:[112] L75-->L50-1: 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][25], 26:5A:[125] L25-->thread1EXIT: Formula: (<= v_N_20 v_i_26) InVars {N=v_N_20, i=v_i_26} OutVars{N=v_N_20, i=v_i_26} AuxVars[] AssignedVars[][70], 88:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][230]][370:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][265], 371:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][595]] [2023-10-12 17:38:52,424 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[109] L74-1-->L37: 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][10], 6:4A:[112] L75-->L50-1: 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][25], 30:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][80], 107:6A:[120] L50-1-->thread3EXIT: Formula: (and (<= v_N_8 v_i_10) (<= v_q1_back_18 v_q1_front_18)) InVars {q1_front=v_q1_front_18, N=v_N_8, i=v_i_10, q1_back=v_q1_back_18} OutVars{q1_front=v_q1_front_18, N=v_N_8, i=v_i_10, q1_back=v_q1_back_18} AuxVars[] AssignedVars[][280]][443:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][265], 444:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][595]] [2023-10-12 17:38:52,430 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[109] L74-1-->L37: 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][10], 6:4A:[112] L75-->L50-1: 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][25], 30:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][80], 109:6A:[97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[][285]][446:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][265], 447:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][595]] [2023-10-12 17:38:52,516 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[109] L74-1-->L37: 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][10], 6:4A:[112] L75-->L50-1: 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][25], 33:5A:[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][85], 113:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][232]][534:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][268], 535:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][598]] [2023-10-12 17:38:52,535 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[109] L74-1-->L37: 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][10], 6:4A:[112] L75-->L50-1: 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][25], 33:5A:[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][85], 113:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][232]][546:7A:[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][613], 547:8A:[103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front][1428]] [2023-10-12 17:38:52,535 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:52,535 INFO L124 PetriNetUnfolderBase]: 384/546 cut-off events. [2023-10-12 17:38:52,535 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2023-10-12 17:38:52,535 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:52,536 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [109] L74-1-->L37: 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] 95#[L75, L37, L25]true [112] L75-->L50-1: 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] 136#[L50-1, L37, L76, L25]true [115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 248#[L50-1, L37, L62-1, L77, L25]true [122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back] 269#[L38-1, L50-1, L62-1, L25, L77]true [2023-10-12 17:38:52,536 INFO L750 eck$LassoCheckResult]: Loop: 269#[L38-1, L50-1, L62-1, L25, L77]true [101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 272#[L62, L38-1, L50-1, L25, L77]true [103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front] 269#[L38-1, L50-1, L62-1, L25, L77]true [2023-10-12 17:38:52,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1101767224, now seen corresponding path program 2 times [2023-10-12 17:38:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:52,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900406266] [2023-10-12 17:38:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:52,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:52,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:52,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:52,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 3 times [2023-10-12 17:38:52,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:52,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286606222] [2023-10-12 17:38:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:52,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:52,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:52,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:52,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:52,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2058623082, now seen corresponding path program 2 times [2023-10-12 17:38:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:52,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484632455] [2023-10-12 17:38:52,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:52,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:52,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:52,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:52,714 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:52,714 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:52,715 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:52,715 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:52,715 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:52,715 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:52,715 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:52,715 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:52,715 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:38:52,715 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:52,715 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:52,716 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:38:52,718 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:38:52,720 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:38:52,736 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:38:52,738 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:38:52,740 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:38:52,742 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:38:52,744 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:38:52,747 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:38:52,749 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:38:52,751 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:38:52,753 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:38:52,754 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:38:52,756 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:38:52,758 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:38:52,885 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:52,885 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:52,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:52,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:52,889 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:38:52,891 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:38:52,892 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:38:52,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:52,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:52,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:52,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:52,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:52,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:52,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:52,904 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:38:52,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:52,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:52,906 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:38:52,907 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:38:52,909 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:38:52,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:52,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:52,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:52,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:52,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:52,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:52,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:52,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-10-12 17:38:52,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:52,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:52,936 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:38:52,938 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:38:52,940 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:38:52,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:52,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:52,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:52,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:52,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:52,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:52,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:52,969 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:38:52,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:52,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:52,970 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:38:52,972 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:38:52,974 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:38:52,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:52,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:52,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:52,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:52,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:52,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:53,002 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:53,009 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:38:53,009 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:38:53,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:53,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:53,012 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:38:53,013 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:38:53,014 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:53,035 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:53,035 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:53,035 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2023-10-12 17:38:53,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:53,041 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:53,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:53,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:53,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:53,076 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:53,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:53,078 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:38:53,078 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:38:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:38:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:38:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:38:53,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:38:53,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:53,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:38:53,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:53,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:38:53,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:53,395 INFO L430 stractBuchiCegarLoop]: Abstraction has has 62 places, 37725 transitions, 701775 flow [2023-10-12 17:38:53,395 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:38:53,395 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 62 places, 37725 transitions, 701775 flow [2023-10-12 17:38:53,649 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:38:53,666 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 0 [2023-10-12 17:38:55,457 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][3], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][28], 5:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][103], 17:4A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][278], 76:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][853]][265:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][2278], 266:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][4928]] [2023-10-12 17:38:57,810 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][3], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][28], 3:3A:[109] L74-1-->L37: 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][53], 8:4A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][178], 54:5A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][652], 214:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][1804]][682:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][651], 683:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][1801]] [2023-10-12 17:38:57,893 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][3], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][28], 3:3A:[109] L74-1-->L37: 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][53], 9:4A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][203], 55:5A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][678], 226:6A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][1878]][696:7A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][3878], 697:8A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][8403]] [2023-10-12 17:38:58,509 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:58,509 INFO L124 PetriNetUnfolderBase]: 564/810 cut-off events. [2023-10-12 17:38:58,509 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2023-10-12 17:38:58,509 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:58,510 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [109] L74-1-->L37: 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] 95#[L75, L37, L25]true [112] L75-->L50-1: 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] 136#[L50-1, L37, L76, L25]true [126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back] 156#[L50-1, L37, L26-1, L76]true [97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 159#[L37, L26-1, L50, L76]true [90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i] 139#[L37, L50, L76, L25]true [126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back] 159#[L37, L26-1, L50, L76]true [99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total] 156#[L50-1, L37, L26-1, L76]true [2023-10-12 17:38:58,510 INFO L750 eck$LassoCheckResult]: Loop: 156#[L50-1, L37, L26-1, L76]true [97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 159#[L37, L26-1, L50, L76]true [99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total] 156#[L50-1, L37, L26-1, L76]true [2023-10-12 17:38:58,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash -597789701, now seen corresponding path program 1 times [2023-10-12 17:38:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:58,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179424732] [2023-10-12 17:38:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:58,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:58,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:58,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:58,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 4 times [2023-10-12 17:38:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:58,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420239681] [2023-10-12 17:38:58,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:58,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:58,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:58,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:58,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:58,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1049718109, now seen corresponding path program 2 times [2023-10-12 17:38:58,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:58,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055698855] [2023-10-12 17:38:58,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:58,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:58,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:58,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:58,739 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:58,739 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:58,739 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:58,739 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:58,739 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:58,739 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:58,739 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:58,739 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:58,739 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration9_Lasso [2023-10-12 17:38:58,739 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:58,739 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:58,740 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:38:58,742 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:38:58,790 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:38:58,794 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:38:58,796 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:38:58,801 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:38:58,804 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:38:58,806 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:38:58,808 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:38:58,811 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:38:58,813 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:38:58,969 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:58,969 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:58,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:58,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:58,970 INFO L229 MonitoredProcess]: Starting monitored process 31 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:38:58,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-10-12 17:38:58,974 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:38:58,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:58,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:58,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:58,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:58,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:58,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:58,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:59,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:59,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:59,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:59,003 INFO L229 MonitoredProcess]: Starting monitored process 32 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:38:59,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-10-12 17:38:59,006 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:38:59,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:59,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:59,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:59,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:59,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:59,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:59,018 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:59,037 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:38:59,037 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:38:59,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:59,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:59,039 INFO L229 MonitoredProcess]: Starting monitored process 33 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:38:59,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-10-12 17:38:59,042 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:59,058 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:59,058 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:59,058 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:38:59,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:59,063 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:38:59,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:59,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:59,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:59,102 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:59,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:59,104 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:38:59,105 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:39:01,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:01,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:39:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:39:01,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:39:01,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:01,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:39:01,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:01,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 9 letters. Loop has 4 letters. [2023-10-12 17:39:01,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:01,369 INFO L430 stractBuchiCegarLoop]: Abstraction has has 67 places, 188625 transitions, 3886125 flow [2023-10-12 17:39:01,369 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:39:01,369 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 67 places, 188625 transitions, 3886125 flow [2023-10-12 17:39:15,804 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 5:3A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][515], 17:4A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][1390], 76:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][4265]][265:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][11390], 266:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][24640]] [2023-10-12 17:39:35,054 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 8:4A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][890], 54:5A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][3260], 214:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][9020]][680:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][3255], 681:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][9005]] [2023-10-12 17:39:35,667 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 9:4A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][1015], 55:5A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][3390], 226:6A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][9390]][694:7A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][19390], 695:8A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][42015]] [2023-10-12 17:39:44,780 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 23:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][1640], 78:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][5015], 287:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][12140]][884:8A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][28140], 886:9A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][51265]] [2023-10-12 17:40:02,968 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 28:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][2015], 101:6A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][6635], 471:7A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][14895]][1286:8A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][6630], 1287:9A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][14880]] [2023-10-12 17:40:07,673 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 28:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][2015], 118:6A:[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][7260], 535:7A:[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][15320]][1419:8A:[103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front][35745], 1422:9A:[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][15310]] [2023-10-12 17:40:13,391 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 7:4A:[121] L37-->thread2EXIT: Formula: (<= v_M_6 v_j_8) InVars {M=v_M_6, j=v_j_8} OutVars{M=v_M_6, j=v_j_8} AuxVars[] AssignedVars[][765], 43:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][2640], 192:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][3390], 621:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][9390]][1584:8A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][19390], 1585:9A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][42015]] [2023-10-12 17:40:16,333 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 8:4A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][890], 54:5A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][3260], 214:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][9020], 634:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][2880]][1632:8A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][7755], 1633:9A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][15880]] [2023-10-12 17:40:17,499 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 8:4A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][890], 45:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][2885], 194:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][7645], 636:7A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][15520]][1649:8A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][36395], 1650:9A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][61395]] [2023-10-12 17:40:23,029 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 8:4A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][890], 54:5A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][3260], 214:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][9020], 665:7A:[125] L25-->thread1EXIT: Formula: (<= v_N_20 v_i_26) InVars {N=v_N_20, i=v_i_26} OutVars{N=v_N_20, i=v_i_26} AuxVars[] AssignedVars[][3005]][1775:8A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][3255], 1776:9A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][9005]] [2023-10-12 17:40:36,467 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 23:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][1640], 80:6A:[97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[][5265], 276:7A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][5015], 806:8A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][12140]][2072:9A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][28140], 2073:10A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][51265]] [2023-10-12 17:40:39,757 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 23:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][1640], 82:6A:[121] L37-->thread2EXIT: Formula: (<= v_M_6 v_j_8) InVars {M=v_M_6, j=v_j_8} OutVars{M=v_M_6, j=v_j_8} AuxVars[] AssignedVars[][5515], 277:7A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][5015], 813:8A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][12140]][2155:9A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][28140], 2158:10A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][51265]] [2023-10-12 17:40:43,754 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 23:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][1640], 78:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][5015], 279:7A:[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][11765], 854:8A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][26815]][2251:9A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][28240], 2253:10A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][51365]] [2023-10-12 17:40:46,645 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 23:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][1640], 78:6A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][5015], 280:7A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][11890], 863:8A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][27135]][2323:9A:[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][50270], 2325:10A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][84645]] [2023-10-12 17:41:06,722 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 23:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][1640], 85:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][5640], 370:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][13885], 1103:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][32145]][2785:9A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][13880], 2786:10A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][32130]] [2023-10-12 17:41:09,128 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 23:5A:[126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back][1640], 85:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][5640], 371:7A:[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][14010], 1133:8A:[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][31195]][2852:9A:[103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front][55370], 2857:10A:[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][31185]] [2023-10-12 17:41:11,227 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 24:5A:[125] L25-->thread1EXIT: Formula: (<= v_N_20 v_i_26) InVars {N=v_N_20, i=v_i_26} OutVars{N=v_N_20, i=v_i_26} AuxVars[] AssignedVars[][1765], 86:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][5765], 374:7A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][6635], 1151:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][14895]][2887:9A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][6630], 2888:10A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][14880]] [2023-10-12 17:41:13,455 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 24:5A:[125] L25-->thread1EXIT: Formula: (<= v_N_20 v_i_26) InVars {N=v_N_20, i=v_i_26} OutVars{N=v_N_20, i=v_i_26} AuxVars[] AssignedVars[][1765], 86:6A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][5765], 381:7A:[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][7260], 1176:8A:[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][15320]][2955:9A:[103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front][35745], 2958:10A:[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][15310]] [2023-10-12 17:41:20,835 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 28:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][2015], 101:6A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][6635], 471:7A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][14895], 1288:8A:[120] L50-1-->thread3EXIT: Formula: (and (<= v_N_8 v_i_10) (<= v_q1_back_18 v_q1_front_18)) InVars {q1_front=v_q1_front_18, N=v_N_8, i=v_i_10, q1_back=v_q1_back_18} OutVars{q1_front=v_q1_front_18, N=v_N_8, i=v_i_10, q1_back=v_q1_back_18} AuxVars[] AssignedVars[][7005]][3117:9A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][6630], 3119:10A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][14880]] [2023-10-12 17:41:20,979 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 28:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][2015], 101:6A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][6635], 471:7A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][14895], 1290:8A:[97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[][7130]][3120:9A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][6630], 3123:10A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][14880]] [2023-10-12 17:41:22,331 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 28:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][2015], 101:6A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][6635], 476:7A:[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][15020], 1312:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][33945]][3165:9A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][6705], 3166:10A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][14955]] [2023-10-12 17:41:26,615 ERROR L47 etriNetUnfolderRabin]: [1:1A:[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[109] L74-1-->L37: 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][265], 6:4A:[112] L75-->L50-1: 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][640], 28:5A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][2015], 101:6A:[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][6635], 476:7A:[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][15020], 1312:8A:[122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back][33945]][3274:9A:[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][15330], 3279:10A:[103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front][35705]] [2023-10-12 17:41:26,615 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:26,623 INFO L124 PetriNetUnfolderBase]: 2396/3278 cut-off events. [2023-10-12 17:41:26,623 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2023-10-12 17:41:26,623 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:26,623 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]true [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]true [109] L74-1-->L37: 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] 95#[L75, L37, L25]true [112] L75-->L50-1: 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] 136#[L50-1, L37, L76, L25]true [122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back] 267#[L38-1, L50-1, L76, L25]true [95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j] 136#[L50-1, L37, L76, L25]true [115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 248#[L50-1, L37, L62-1, L77, L25]true [122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back] 269#[L38-1, L50-1, L62-1, L25, L77]true [2023-10-12 17:41:26,623 INFO L750 eck$LassoCheckResult]: Loop: 269#[L38-1, L50-1, L62-1, L25, L77]true [101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 272#[L62, L38-1, L50-1, L25, L77]true [103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front] 269#[L38-1, L50-1, L62-1, L25, L77]true [2023-10-12 17:41:26,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2058806125, now seen corresponding path program 1 times [2023-10-12 17:41:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:26,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073170530] [2023-10-12 17:41:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:26,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 4 times [2023-10-12 17:41:26,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:26,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551271212] [2023-10-12 17:41:26,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:26,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:26,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1467234097, now seen corresponding path program 1 times [2023-10-12 17:41:26,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:26,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051019730] [2023-10-12 17:41:26,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:26,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:26,885 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:26,885 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:26,885 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:26,885 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:26,885 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:26,885 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,885 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:26,885 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:26,886 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration10_Lasso [2023-10-12 17:41:26,886 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:26,886 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:26,886 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:41:26,891 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:41:26,894 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:41:26,895 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:41:26,897 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:41:26,899 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:41:26,901 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:41:26,925 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:41:26,927 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:41:26,929 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:41:26,930 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:41:26,932 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:41:26,935 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:41:26,937 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:41:26,939 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:41:27,057 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:27,057 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:27,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,060 INFO L229 MonitoredProcess]: Starting monitored process 34 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:41:27,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-10-12 17:41:27,067 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:41:27,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:27,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:27,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:27,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,080 INFO L229 MonitoredProcess]: Starting monitored process 35 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:41:27,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-10-12 17:41:27,084 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:41:27,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:27,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:27,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:27,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,099 INFO L229 MonitoredProcess]: Starting monitored process 36 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:41:27,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-10-12 17:41:27,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:41:27,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:27,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:27,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:27,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,114 INFO L229 MonitoredProcess]: Starting monitored process 37 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:41:27,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-10-12 17:41:27,118 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:41:27,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:27,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:27,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:27,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,132 INFO L229 MonitoredProcess]: Starting monitored process 38 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:41:27,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-10-12 17:41:27,135 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:41:27,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:27,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:27,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:27,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,178 INFO L229 MonitoredProcess]: Starting monitored process 39 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:41:27,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-10-12 17:41:27,182 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:41:27,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:27,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:27,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:27,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,217 INFO L229 MonitoredProcess]: Starting monitored process 40 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:41:27,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-10-12 17:41:27,238 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:41:27,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:27,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:27,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:27,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,269 INFO L229 MonitoredProcess]: Starting monitored process 41 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:41:27,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-10-12 17:41:27,272 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:41:27,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:27,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:27,295 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:27,301 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:41:27,301 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:41:27,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,304 INFO L229 MonitoredProcess]: Starting monitored process 42 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:41:27,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-10-12 17:41:27,306 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:27,327 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:41:27,327 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:27,327 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2023-10-12 17:41:27,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,332 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:41:27,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:27,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:27,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:27,367 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:27,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:27,369 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:41:27,369 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:28,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:38,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:41:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:41:38,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:41:38,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:38,290 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:41:38,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:38,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:38,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:38,336 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:38,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:38,337 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:41:38,338 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:48,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:41:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:41:48,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:41:48,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:48,683 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:41:48,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:48,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:48,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:48,718 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:48,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:48,726 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:41:48,726 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:41:48,727 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:48,813 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 366 transitions. [2023-10-12 17:41:48,816 INFO L79 BuchiIntersect]: Starting Intersection