/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-more/queue-add-3-nl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:40:43,332 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:40:43,387 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:40:43,414 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:40:43,414 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:40:43,415 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:40:43,416 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:40:43,416 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:40:43,416 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:40:43,419 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:40:43,419 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:40:43,419 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:40:43,420 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:40:43,420 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:40:43,421 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:40:43,421 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:40:43,421 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:40:43,422 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:40:43,422 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:40:43,422 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:40:43,422 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:40:43,423 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:40:43,423 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:40:43,424 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:40:43,424 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:40:43,424 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:40:43,424 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:40:43,424 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:40:43,424 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:40:43,425 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:40:43,425 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:40:43,426 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:40:43,426 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:40:43,427 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:40:43,427 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:40:43,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:40:43,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:40:43,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:40:43,612 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:40:43,613 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:40:43,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl [2023-10-12 17:40:43,614 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl' [2023-10-12 17:40:43,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:40:43,632 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:40:43,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:43,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:40:43,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:40:43,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,649 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:40:43,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:43,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:40:43,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:40:43,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:40:43,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:40:43,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:40:43,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:40:43,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:40:43,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/1) ... [2023-10-12 17:40:43,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:43,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:43,683 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:40:43,704 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:40:43,709 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:40:43,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:40:43,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:40:43,710 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:40:43,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:40:43,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:40:43,719 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:40:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:40:43,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:40:43,719 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:40:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:40:43,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:40:43,720 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:40:43,759 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:40:43,760 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:40:43,856 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:40:43,872 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:40:43,872 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:40:43,874 INFO L201 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:43 BoogieIcfgContainer [2023-10-12 17:40:43,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:40:43,875 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:40:43,875 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:40:43,895 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:40:43,896 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:43,896 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:43" (1/2) ... [2023-10-12 17:40:43,897 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6779634c and model type queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:40:43, skipping insertion in model container [2023-10-12 17:40:43,897 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:43,897 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:43" (2/2) ... [2023-10-12 17:40:43,898 INFO L332 chiAutomizerObserver]: Analyzing ICFG queue-add-3-nl.wvr.bpl [2023-10-12 17:40:43,973 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:40:43,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 114 flow [2023-10-12 17:40:44,010 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-10-12 17:40:44,010 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:44,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:40:44,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 114 flow [2023-10-12 17:40:44,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 96 flow [2023-10-12 17:40:44,020 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:40:44,029 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 96 flow [2023-10-12 17:40:44,031 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 96 flow [2023-10-12 17:40:44,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 96 flow [2023-10-12 17:40:44,039 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-10-12 17:40:44,039 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:44,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:40:44,040 INFO L119 LiptonReduction]: Number of co-enabled transitions 634 [2023-10-12 17:40:44,733 INFO L134 LiptonReduction]: Checked pairs total: 535 [2023-10-12 17:40:44,733 INFO L136 LiptonReduction]: Total number of compositions: 22 [2023-10-12 17:40:44,742 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:40:44,742 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:40:44,742 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:40:44,742 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:40:44,742 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:40:44,742 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:40:44,743 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:40:44,743 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:40:44,743 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:40:44,745 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][7], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0], 3:3A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][1]][4:4A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][14]] [2023-10-12 17:40:44,746 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:44,746 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:40:44,746 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:44,747 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:44,748 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:40:44,748 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:40:44,749 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][7], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0], 3:3A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][1]][4:4A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][14]] [2023-10-12 17:40:44,749 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:44,749 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:40:44,749 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:44,749 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:44,752 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 59#[L32-1, L89-1]true [2023-10-12 17:40:44,752 INFO L750 eck$LassoCheckResult]: Loop: 59#[L32-1, L89-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 59#[L32-1, L89-1]true [2023-10-12 17:40:44,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:44,755 INFO L85 PathProgramCache]: Analyzing trace with hash 132071, now seen corresponding path program 1 times [2023-10-12 17:40:44,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:44,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321759008] [2023-10-12 17:40:44,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:44,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:44,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:44,860 INFO L85 PathProgramCache]: Analyzing trace with hash 194, now seen corresponding path program 1 times [2023-10-12 17:40:44,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:44,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737810005] [2023-10-12 17:40:44,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:44,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:44,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash 4094364, now seen corresponding path program 1 times [2023-10-12 17:40:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798622143] [2023-10-12 17:40:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:44,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,008 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:45,008 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:45,008 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:45,008 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:45,009 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:45,009 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,009 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:45,009 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:45,009 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:40:45,009 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:45,009 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:45,019 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:40:45,036 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:40:45,046 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:40:45,053 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:40:45,055 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:40:45,057 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:40:45,060 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:40:45,128 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:45,131 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:45,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:45,134 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:40:45,140 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:40:45,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:45,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:45,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:45,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:45,154 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:40:45,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:45,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:45,172 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:45,180 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:40:45,180 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:40:45,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:45,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:45,192 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:40:45,194 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:40:45,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:45,203 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:45,204 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:45,204 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:40:45,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:40:45,210 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:45,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:45,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:45,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:45,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:45,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:45,247 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:40:45,267 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:40:45,351 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:40:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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:40:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 266 transitions. [2023-10-12 17:40:45,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 266 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:45,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:45,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 266 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:45,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:45,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 266 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:40:45,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:45,358 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 90 transitions, 450 flow [2023-10-12 17:40:45,359 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:40:45,359 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 30 places, 90 transitions, 450 flow [2023-10-12 17:40:45,361 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][35], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0], 5:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][20], 16:4A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][45]][18:5A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][80]] [2023-10-12 17:40:45,362 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:45,362 INFO L124 PetriNetUnfolderBase]: 8/17 cut-off events. [2023-10-12 17:40:45,362 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:40:45,362 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:45,362 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 99#[$Ultimate##0, $Ultimate##0, L90]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 101#[$Ultimate##0, L90, L52-1]true [2023-10-12 17:40:45,362 INFO L750 eck$LassoCheckResult]: Loop: 101#[$Ultimate##0, L90, L52-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 101#[$Ultimate##0, L90, L52-1]true [2023-10-12 17:40:45,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash 4095378, now seen corresponding path program 1 times [2023-10-12 17:40:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896396459] [2023-10-12 17:40:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 1 times [2023-10-12 17:40:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408472556] [2023-10-12 17:40:45,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash 126956883, now seen corresponding path program 1 times [2023-10-12 17:40:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889161698] [2023-10-12 17:40:45,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:45,419 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:40:45,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:40:45,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889161698] [2023-10-12 17:40:45,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889161698] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:40:45,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:40:45,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:40:45,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260720397] [2023-10-12 17:40:45,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:40:45,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:40:45,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:40:45,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:40:45,493 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 30 places, 90 transitions, 450 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:40:45,493 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:40:45,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:40:45,538 INFO L124 PetriNetUnfolderBase]: 195/286 cut-off events. [2023-10-12 17:40:45,538 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-10-12 17:40:45,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 286 events. 195/286 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 751 event pairs, 6 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 818. Up to 210 conditions per place. [2023-10-12 17:40:45,542 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 46 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-10-12 17:40:45,542 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 29 places, 51 transitions, 345 flow [2023-10-12 17:40:45,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:40:45,543 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 51 transitions, 345 flow [2023-10-12 17:40:45,544 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:40:45,544 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 51 transitions, 345 flow [2023-10-12 17:40:45,548 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][3], 17:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][8], 46:5A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][20]][48:6A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][31]] [2023-10-12 17:40:45,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:45,548 INFO L124 PetriNetUnfolderBase]: 27/47 cut-off events. [2023-10-12 17:40:45,548 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-10-12 17:40:45,548 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:45,548 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 99#[$Ultimate##0, $Ultimate##0, L90]true [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 117#[$Ultimate##0, $Ultimate##0, L91, $Ultimate##0]true [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 119#[$Ultimate##0, L73-1, $Ultimate##0, L91]true [2023-10-12 17:40:45,549 INFO L750 eck$LassoCheckResult]: Loop: 119#[$Ultimate##0, L73-1, $Ultimate##0, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 119#[$Ultimate##0, L73-1, $Ultimate##0, L91]true [2023-10-12 17:40:45,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,549 INFO L85 PathProgramCache]: Analyzing trace with hash 126956435, now seen corresponding path program 1 times [2023-10-12 17:40:45,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171598646] [2023-10-12 17:40:45,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,556 INFO L85 PathProgramCache]: Analyzing trace with hash 193, now seen corresponding path program 1 times [2023-10-12 17:40:45,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190349714] [2023-10-12 17:40:45,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash -359317649, now seen corresponding path program 1 times [2023-10-12 17:40:45,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076050501] [2023-10-12 17:40:45,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:45,598 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:40:45,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:40:45,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076050501] [2023-10-12 17:40:45,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076050501] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:40:45,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:40:45,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:40:45,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165961356] [2023-10-12 17:40:45,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:40:45,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:40:45,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:40:45,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:40:45,651 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 29 places, 51 transitions, 345 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:40:45,651 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:40:45,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:40:45,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:40:45,727 INFO L124 PetriNetUnfolderBase]: 244/370 cut-off events. [2023-10-12 17:40:45,727 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-10-12 17:40:45,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 370 events. 244/370 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1084 event pairs, 6 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 1403. Up to 303 conditions per place. [2023-10-12 17:40:45,733 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 63 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2023-10-12 17:40:45,733 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 31 places, 66 transitions, 582 flow [2023-10-12 17:40:45,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:40:45,735 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 66 transitions, 582 flow [2023-10-12 17:40:45,735 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:40:45,735 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 31 places, 66 transitions, 582 flow [2023-10-12 17:40:45,743 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][3], 16:4A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][7], 23:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][2], 48:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][4], 109:7A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][32]][111:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][44]] [2023-10-12 17:40:45,743 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:45,743 INFO L124 PetriNetUnfolderBase]: 71/110 cut-off events. [2023-10-12 17:40:45,743 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-10-12 17:40:45,743 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:45,743 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 99#[$Ultimate##0, $Ultimate##0, L90]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 101#[$Ultimate##0, L90, L52-1]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 136#[L90, L52-1, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 136#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 136#[L90, L52-1, L32-1]true [2023-10-12 17:40:45,744 INFO L750 eck$LassoCheckResult]: Loop: 136#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 136#[L90, L52-1, L32-1]true [2023-10-12 17:40:45,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1746426872, now seen corresponding path program 1 times [2023-10-12 17:40:45,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250364585] [2023-10-12 17:40:45,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,758 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 2 times [2023-10-12 17:40:45,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607798376] [2023-10-12 17:40:45,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1695341651, now seen corresponding path program 2 times [2023-10-12 17:40:45,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983940393] [2023-10-12 17:40:45,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:45,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:40:45,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983940393] [2023-10-12 17:40:45,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983940393] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:40:45,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:40:45,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:40:45,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057375713] [2023-10-12 17:40:45,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:40:45,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:40:45,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:40:45,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:40:45,865 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 31 places, 66 transitions, 582 flow. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:40:45,865 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:40:45,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:40:45,937 INFO L124 PetriNetUnfolderBase]: 441/680 cut-off events. [2023-10-12 17:40:45,938 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-10-12 17:40:45,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3562 conditions, 680 events. 441/680 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2454 event pairs, 6 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 3189. Up to 613 conditions per place. [2023-10-12 17:40:45,943 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 100 selfloop transitions, 19 changer transitions 0/119 dead transitions. [2023-10-12 17:40:45,943 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 34 places, 119 transitions, 1292 flow [2023-10-12 17:40:45,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:40:45,944 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 119 transitions, 1292 flow [2023-10-12 17:40:45,944 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:40:45,944 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 119 transitions, 1292 flow [2023-10-12 17:40:45,961 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][2], 7:4A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][5], 18:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][3], 66:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][6], 153:7A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][14], 265:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][56]][268:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][69]] [2023-10-12 17:40:45,961 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:45,961 INFO L124 PetriNetUnfolderBase]: 174/267 cut-off events. [2023-10-12 17:40:45,961 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-10-12 17:40:45,961 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:45,961 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 99#[$Ultimate##0, $Ultimate##0, L90]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 101#[$Ultimate##0, L90, L52-1]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 136#[L90, L52-1, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 136#[L90, L52-1, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 136#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 136#[L90, L52-1, L32-1]true [2023-10-12 17:40:45,962 INFO L750 eck$LassoCheckResult]: Loop: 136#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 136#[L90, L52-1, L32-1]true [2023-10-12 17:40:45,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1695341713, now seen corresponding path program 3 times [2023-10-12 17:40:45,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466536798] [2023-10-12 17:40:45,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 3 times [2023-10-12 17:40:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434664039] [2023-10-12 17:40:45,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:45,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:45,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1015985386, now seen corresponding path program 4 times [2023-10-12 17:40:45,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:45,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805304528] [2023-10-12 17:40:45,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:45,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:45,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:46,312 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:46,312 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:46,312 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:46,312 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:46,312 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:46,312 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,312 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:46,312 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:46,312 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:40:46,313 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:46,313 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:46,315 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:46,322 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:46,325 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:40:46,399 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:40:46,402 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:40:46,404 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:40:46,406 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:40:46,409 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:40:46,656 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:46,657 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:46,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,658 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:40:46,660 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:40:46,661 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:40:46,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:46,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:46,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:46,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:46,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:46,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:46,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:46,694 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:40:46,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,709 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:40:46,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:40:46,719 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:40:46,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:46,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:46,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:46,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:46,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:46,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:46,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:46,761 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:40:46,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,777 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:40:46,825 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:40:46,826 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:40:46,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:46,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:46,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:46,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:46,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:46,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:46,848 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:46,863 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:40:46,863 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:40:46,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:46,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:46,877 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:40:46,893 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:40:46,905 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:46,933 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:46,934 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:46,934 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:40:46,941 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:40:46,945 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:40:46,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:46,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:46,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:46,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:46,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:46,985 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:40:46,986 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:40:47,064 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:40:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:40:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2023-10-12 17:40:47,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 252 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:40:47,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:47,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 252 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:40:47,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:47,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 252 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:40:47,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:47,067 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 595 transitions, 7650 flow [2023-10-12 17:40:47,067 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:40:47,067 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 595 transitions, 7650 flow [2023-10-12 17:40:47,107 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][3], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][8], 3:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][13], 6:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][23], 34:5A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][28], 49:6A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][18], 104:7A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][33], 197:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][208], 339:9A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][324]][342:10A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][407]] [2023-10-12 17:40:47,108 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:47,108 INFO L124 PetriNetUnfolderBase]: 221/341 cut-off events. [2023-10-12 17:40:47,108 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-10-12 17:40:47,108 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:47,108 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 99#[$Ultimate##0, $Ultimate##0, L90]true [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 117#[$Ultimate##0, $Ultimate##0, L91, $Ultimate##0]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 218#[$Ultimate##0, L52-1, L91, $Ultimate##0]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 220#[L52-1, L32-1, L91, $Ultimate##0]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 220#[L52-1, L32-1, L91, $Ultimate##0]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 220#[L52-1, L32-1, L91, $Ultimate##0]true [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 224#[L73-1, L52-1, L32-1, L91]true [2023-10-12 17:40:47,109 INFO L750 eck$LassoCheckResult]: Loop: 224#[L73-1, L52-1, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 224#[L73-1, L52-1, L32-1, L91]true [2023-10-12 17:40:47,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:47,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1372375133, now seen corresponding path program 1 times [2023-10-12 17:40:47,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:47,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739961737] [2023-10-12 17:40:47,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:47,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:47,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:47,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:47,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:47,122 INFO L85 PathProgramCache]: Analyzing trace with hash 193, now seen corresponding path program 2 times [2023-10-12 17:40:47,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:47,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620950894] [2023-10-12 17:40:47,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:47,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:47,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:47,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:47,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:47,127 INFO L85 PathProgramCache]: Analyzing trace with hash 406043999, now seen corresponding path program 1 times [2023-10-12 17:40:47,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:47,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647363828] [2023-10-12 17:40:47,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:47,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:47,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:47,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:47,429 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:47,429 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:47,429 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:47,429 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:47,429 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:47,429 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,429 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:47,429 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:47,429 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:40:47,430 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:47,430 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:47,431 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:40:47,437 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:40:47,439 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:40:47,441 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:40:47,442 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:40:47,444 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:40:47,445 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:40:47,447 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:40:47,448 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:40:47,449 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:40:47,507 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:40:47,803 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:47,803 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:47,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:47,804 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:40:47,823 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:40:47,828 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:40:47,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:47,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:47,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:47,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:47,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:47,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:47,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:47,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:47,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:47,865 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:40:47,866 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:40:47,868 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:40:47,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:47,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:47,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:47,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:47,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:47,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:47,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:47,900 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:40:47,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:47,902 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:40:47,904 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:40:47,906 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:40:47,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:47,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:47,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:47,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:47,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:47,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:47,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:47,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:47,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:47,929 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:40:47,932 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:40:47,933 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:40:47,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:47,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:47,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:47,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:47,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:47,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:47,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:47,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:47,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:47,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:48,001 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:48,012 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:40:48,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:48,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:48,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:48,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:48,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:48,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:48,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:48,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:40:48,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:48,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:48,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:48,052 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:40:48,053 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:40:48,055 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:40:48,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:48,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:48,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:48,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:48,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:48,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:48,082 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:48,089 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:40:48,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:48,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:48,091 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:40:48,093 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:40:48,094 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:40:48,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:48,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:48,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:48,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:48,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:48,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:48,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:48,109 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:40:48,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:48,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:48,111 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:40:48,113 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:40:48,114 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:40:48,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:48,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:48,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:48,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:48,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:48,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:48,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:48,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:40:48,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:48,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:48,141 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:40:48,143 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:40:48,144 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:40:48,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:48,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:48,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:48,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:48,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:48,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:48,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:48,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-10-12 17:40:48,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:48,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:48,181 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:40:48,209 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:40:48,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:40:48,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:48,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:48,217 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:40:48,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:48,234 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:40:48,269 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:40:48,269 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:40:48,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:48,313 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:40:48,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:48,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:48,314 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:40:48,316 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:40:48,318 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:40:48,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:48,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:48,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:48,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:48,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:48,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:48,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:48,335 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:40:48,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:48,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:48,336 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:40:48,338 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:40:48,339 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:40:48,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:48,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:48,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:48,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:48,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:48,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:48,351 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:48,356 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:40:48,356 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:40:48,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:48,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:48,357 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:40:48,359 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:40:48,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:48,367 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:48,367 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:48,367 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:40:48,371 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:40:48,379 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:40:48,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:48,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:48,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:48,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:48,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:48,410 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:40:48,411 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:40:48,490 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:40:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:40:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2023-10-12 17:40:48,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 260 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:40:48,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:48,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 260 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:40:48,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:48,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 260 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:40:48,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:48,491 INFO L430 stractBuchiCegarLoop]: Abstraction has has 44 places, 2975 transitions, 44200 flow [2023-10-12 17:40:48,491 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:40:48,492 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 44 places, 2975 transitions, 44200 flow [2023-10-12 17:40:48,601 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][40], 3:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][65], 7:4A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][140], 18:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][90], 58:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][165], 148:7A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][365], 275:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][1415], 427:9A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][1820]][429:10A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][1725]] [2023-10-12 17:40:48,602 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:48,602 INFO L124 PetriNetUnfolderBase]: 274/428 cut-off events. [2023-10-12 17:40:48,602 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-10-12 17:40:48,602 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:48,602 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 99#[$Ultimate##0, $Ultimate##0, L90]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 101#[$Ultimate##0, L90, L52-1]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 136#[L90, L52-1, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 136#[L90, L52-1, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 136#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 136#[L90, L52-1, L32-1]true [164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back] 286#[L90, L52-1, thread1EXIT]true [2023-10-12 17:40:48,602 INFO L750 eck$LassoCheckResult]: Loop: 286#[L90, L52-1, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 286#[L90, L52-1, thread1EXIT]true [2023-10-12 17:40:48,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:48,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1015985387, now seen corresponding path program 1 times [2023-10-12 17:40:48,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:48,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916060078] [2023-10-12 17:40:48,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:48,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:48,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:48,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:48,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 4 times [2023-10-12 17:40:48,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:48,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979258533] [2023-10-12 17:40:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:48,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:48,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:48,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:48,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:48,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1430775760, now seen corresponding path program 2 times [2023-10-12 17:40:48,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:48,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101242868] [2023-10-12 17:40:48,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:48,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:48,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:48,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:48,913 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:48,913 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:48,913 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:48,913 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:48,913 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:48,913 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:48,913 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:48,913 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:48,913 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:40:48,913 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:48,913 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:48,915 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:40:48,917 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:40:48,918 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:40:48,920 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:40:48,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:40:48,997 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:40:49,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:40:49,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:40:49,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-10-12 17:40:49,228 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:49,228 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:49,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:49,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:49,230 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:40:49,251 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:40:49,252 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:40:49,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:49,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:49,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:49,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:49,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:49,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:49,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:49,306 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:40:49,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:49,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:49,307 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:40:49,344 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:40:49,344 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:40:49,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:49,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:49,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:49,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:49,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:49,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:49,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:49,361 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:40:49,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:49,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:49,362 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:40:49,365 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:40:49,367 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:40:49,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:49,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:49,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:49,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:49,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:49,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:49,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:49,395 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:40:49,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:49,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:49,396 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:40:49,398 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:40:49,400 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:40:49,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:49,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:49,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:49,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:49,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:49,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:49,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:49,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-10-12 17:40:49,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:49,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:49,418 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:40:49,420 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:40:49,424 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:40:49,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:49,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:49,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:49,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:49,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:49,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:49,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:49,444 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:40:49,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:49,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:49,445 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:40:49,447 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:40:49,449 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:40:49,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:49,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:49,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:49,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:49,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:49,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:49,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:49,467 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:40:49,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:49,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:49,468 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:40:49,471 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:40:49,473 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:40:49,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:49,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:49,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:49,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:49,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:49,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:49,486 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:49,493 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:40:49,493 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:40:49,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:49,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:49,494 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:40:49,497 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:40:49,497 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:49,506 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:49,506 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:49,506 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:40:49,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:49,519 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:40:49,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:49,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:49,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:49,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:49,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:49,571 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:40:49,572 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:40:49,797 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:40:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:40:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2023-10-12 17:40:49,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 252 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:40:49,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:49,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 252 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:40:49,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:49,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 252 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:40:49,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:49,801 INFO L430 stractBuchiCegarLoop]: Abstraction has has 49 places, 14875 transitions, 250750 flow [2023-10-12 17:40:49,801 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:40:49,801 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 49 places, 14875 transitions, 250750 flow [2023-10-12 17:40:50,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-10-12 17:40:51,778 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][78], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][203], 3:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][328], 6:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][578], 31:5A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][703], 47:6A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][453], 110:7A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][828], 210:8A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][4578], 371:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][5463], 575:10A:[155] L52-1-->thread2EXIT: Formula: (not v_f_9) InVars {f=v_f_9} OutVars{f=v_f_9} AuxVars[] AssignedVars[][7743]][576:11A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][10193]] [2023-10-12 17:40:51,779 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:51,779 INFO L124 PetriNetUnfolderBase]: 367/575 cut-off events. [2023-10-12 17:40:51,779 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2023-10-12 17:40:51,779 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:51,781 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 99#[$Ultimate##0, $Ultimate##0, L90]true [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 117#[$Ultimate##0, $Ultimate##0, L91, $Ultimate##0]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 218#[$Ultimate##0, L52-1, L91, $Ultimate##0]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 220#[L52-1, L32-1, L91, $Ultimate##0]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 220#[L52-1, L32-1, L91, $Ultimate##0]true [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 224#[L73-1, L52-1, L32-1, L91]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 224#[L73-1, L52-1, L32-1, L91]true [155] L52-1-->thread2EXIT: Formula: (not v_f_9) InVars {f=v_f_9} OutVars{f=v_f_9} AuxVars[] AssignedVars[] 353#[L73-1, thread2EXIT, L32-1, L91]true [2023-10-12 17:40:51,781 INFO L750 eck$LassoCheckResult]: Loop: 353#[L73-1, thread2EXIT, L32-1, L91]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 353#[L73-1, thread2EXIT, L32-1, L91]true [2023-10-12 17:40:51,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash 406030972, now seen corresponding path program 1 times [2023-10-12 17:40:51,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:51,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562712317] [2023-10-12 17:40:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:51,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:40:51,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562712317] [2023-10-12 17:40:51,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562712317] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:40:51,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439290196] [2023-10-12 17:40:51,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:51,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:40:51,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:51,879 INFO L229 MonitoredProcess]: Starting monitored process 29 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:40:51,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-10-12 17:40:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:51,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2023-10-12 17:40:51,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:51,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:40:51,951 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-10-12 17:40:51,952 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-10-12 17:40:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:51,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439290196] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:40:51,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:40:51,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-10-12 17:40:51,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370670529] [2023-10-12 17:40:51,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:40:51,959 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:40:51,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:51,960 INFO L85 PathProgramCache]: Analyzing trace with hash 193, now seen corresponding path program 3 times [2023-10-12 17:40:51,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:51,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764763426] [2023-10-12 17:40:51,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:51,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:51,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:51,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:52,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:40:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-10-12 17:40:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-10-12 17:40:52,008 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 49 places, 14875 transitions, 250750 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:40:52,008 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:40:52,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:40:54,803 INFO L124 PetriNetUnfolderBase]: 919/1424 cut-off events. [2023-10-12 17:40:54,803 INFO L125 PetriNetUnfolderBase]: For 425/425 co-relation queries the response was YES. [2023-10-12 17:40:54,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13124 conditions, 1424 events. 919/1424 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5969 event pairs, 2 based on Foata normal form. 23/1039 useless extension candidates. Maximal degree in co-relation 12004. Up to 1379 conditions per place. [2023-10-12 17:40:54,825 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 624 selfloop transitions, 109 changer transitions 0/733 dead transitions. [2023-10-12 17:40:54,825 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 51 places, 733 transitions, 13659 flow [2023-10-12 17:40:54,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-10-12 17:40:54,828 INFO L430 stractBuchiCegarLoop]: Abstraction has has 51 places, 733 transitions, 13659 flow [2023-10-12 17:40:54,828 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:40:54,829 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 51 places, 733 transitions, 13659 flow [2023-10-12 17:40:54,937 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][3], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][7], 18:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][2], 44:6A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][4], 96:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][22], 166:8A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][92], 262:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][149], 379:10A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][220]][382:11A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][305]] [2023-10-12 17:40:54,938 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:54,938 INFO L124 PetriNetUnfolderBase]: 232/381 cut-off events. [2023-10-12 17:40:54,938 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-10-12 17:40:54,938 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:54,938 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 99#[$Ultimate##0, $Ultimate##0, L90]true [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 117#[$Ultimate##0, $Ultimate##0, L91, $Ultimate##0]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 429#[$Ultimate##0, L32-1, L91, $Ultimate##0]true [164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back] 431#[$Ultimate##0, L91, $Ultimate##0, thread1EXIT]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 433#[L52-1, L91, $Ultimate##0, thread1EXIT]true [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 435#[L73-1, L52-1, L91, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 435#[L73-1, L52-1, L91, thread1EXIT]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 435#[L73-1, L52-1, L91, thread1EXIT]true [2023-10-12 17:40:54,938 INFO L750 eck$LassoCheckResult]: Loop: 435#[L73-1, L52-1, L91, thread1EXIT]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 435#[L73-1, L52-1, L91, thread1EXIT]true [2023-10-12 17:40:54,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:54,939 INFO L85 PathProgramCache]: Analyzing trace with hash -970283430, now seen corresponding path program 1 times [2023-10-12 17:40:54,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:54,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682533418] [2023-10-12 17:40:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:54,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:54,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:54,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:54,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash 193, now seen corresponding path program 4 times [2023-10-12 17:40:54,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:54,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369303176] [2023-10-12 17:40:54,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:54,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:54,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:54,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:54,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash -14015096, now seen corresponding path program 2 times [2023-10-12 17:40:54,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:54,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697151745] [2023-10-12 17:40:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:54,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:55,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:40:55,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697151745] [2023-10-12 17:40:55,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697151745] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:40:55,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036710964] [2023-10-12 17:40:55,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:40:55,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:40:55,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:55,094 INFO L229 MonitoredProcess]: Starting monitored process 30 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:40:55,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-10-12 17:40:55,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:40:55,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:40:55,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:55,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:55,160 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:40:55,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036710964] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:40:55,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:40:55,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2023-10-12 17:40:55,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378424857] [2023-10-12 17:40:55,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:40:55,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:40:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:40:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-10-12 17:40:55,207 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 51 places, 733 transitions, 13659 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:40:55,207 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:40:55,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:40:55,493 INFO L124 PetriNetUnfolderBase]: 1243/1993 cut-off events. [2023-10-12 17:40:55,493 INFO L125 PetriNetUnfolderBase]: For 655/655 co-relation queries the response was YES. [2023-10-12 17:40:55,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20343 conditions, 1993 events. 1243/1993 cut-off events. For 655/655 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9479 event pairs, 15 based on Foata normal form. 0/1434 useless extension candidates. Maximal degree in co-relation 18515. Up to 1948 conditions per place. [2023-10-12 17:40:55,514 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 840 selfloop transitions, 152 changer transitions 0/992 dead transitions. [2023-10-12 17:40:55,515 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 54 places, 992 transitions, 20458 flow [2023-10-12 17:40:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:40:55,515 INFO L430 stractBuchiCegarLoop]: Abstraction has has 54 places, 992 transitions, 20458 flow [2023-10-12 17:40:55,515 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:40:55,515 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 54 places, 992 transitions, 20458 flow [2023-10-12 17:40:55,576 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][3], 5:4A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][2], 17:5A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][6], 53:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][18], 118:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][58], 224:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][112], 326:9A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][196], 470:10A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][274]][472:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][389]] [2023-10-12 17:40:55,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:55,577 INFO L124 PetriNetUnfolderBase]: 282/471 cut-off events. [2023-10-12 17:40:55,577 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2023-10-12 17:40:55,577 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:55,577 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 99#[$Ultimate##0, $Ultimate##0, L90]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 488#[$Ultimate##0, L90, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 488#[$Ultimate##0, L90, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 488#[$Ultimate##0, L90, L32-1]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 136#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 136#[L90, L52-1, L32-1]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 136#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 136#[L90, L52-1, L32-1]true [2023-10-12 17:40:55,578 INFO L750 eck$LassoCheckResult]: Loop: 136#[L90, L52-1, L32-1]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 136#[L90, L52-1, L32-1]true [2023-10-12 17:40:55,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:55,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1167435091, now seen corresponding path program 5 times [2023-10-12 17:40:55,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:55,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567986264] [2023-10-12 17:40:55,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:55,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:55,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:55,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 5 times [2023-10-12 17:40:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:55,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309021321] [2023-10-12 17:40:55,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:55,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:55,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:55,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:55,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1830749288, now seen corresponding path program 6 times [2023-10-12 17:40:55,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:55,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097728287] [2023-10-12 17:40:55,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:55,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:55,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:55,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:56,017 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:56,017 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:56,017 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:56,018 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:56,018 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:56,018 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:56,018 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:56,018 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:56,018 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration10_Lasso [2023-10-12 17:40:56,018 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:56,018 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:56,021 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:40:56,023 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:40:56,025 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:40:56,027 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:40:56,030 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:40:56,128 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:40:56,130 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:40:56,131 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:40:56,427 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:56,427 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:56,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:56,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:56,435 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:40:56,436 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:40:56,437 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:40:56,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:56,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:56,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:56,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:56,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:56,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:56,448 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:56,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-10-12 17:40:56,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:56,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:56,455 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:40:56,456 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:40:56,458 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:40:56,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:56,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:56,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:56,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:56,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:56,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:56,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:56,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-10-12 17:40:56,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:56,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:56,472 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:40:56,474 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:40:56,476 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:40:56,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:56,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:56,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:56,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:56,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:56,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:56,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:56,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-10-12 17:40:56,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:56,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:56,492 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:40:56,499 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:40:56,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:56,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:56,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:56,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:56,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:56,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:56,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:56,511 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:40:56,514 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:40:56,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:56,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:56,515 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:40:56,517 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:40:56,518 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:40:56,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:56,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:56,525 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:40:56,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:56,556 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:40:56,556 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:40:56,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:56,607 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:40:56,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:56,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:56,609 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:40:56,611 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:40:56,612 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:40:56,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:56,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:56,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:56,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:56,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:56,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:56,629 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:56,633 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:40:56,634 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:40:56,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:56,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:56,636 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:40:56,636 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:40:56,654 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:56,661 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:56,661 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:56,661 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2023-10-12 17:40:56,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-10-12 17:40:56,670 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-10-12 17:40:56,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:56,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:56,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:56,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:56,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:56,704 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:40:56,704 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:40:56,813 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:40:56,817 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:40:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:40:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2023-10-12 17:40:56,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 252 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:40:56,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:56,819 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:40:56,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:56,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:56,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:56,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:56,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:56,849 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:40:56,849 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:40:56,938 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:40:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:40:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2023-10-12 17:40:56,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 252 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:40:56,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:56,939 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:40:56,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:56,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:56,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:56,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:56,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:56,971 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:40:56,972 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:40:56,973 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:40:57,051 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 5 states and 372 transitions. [2023-10-12 17:40:57,052 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:40:57,121 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:40:57,122 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:40:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:40:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2023-10-12 17:40:57,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 253 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:40:57,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:57,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 253 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:40:57,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:57,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 253 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:40:57,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:57,123 INFO L430 stractBuchiCegarLoop]: Abstraction has has 64 places, 10440 transitions, 237096 flow [2023-10-12 17:40:57,123 INFO L337 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-10-12 17:40:57,123 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 64 places, 10440 transitions, 237096 flow [2023-10-12 17:40:59,062 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 3:3A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 5:4A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][59], 18:5A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][138], 54:6A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][275], 147:7A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][654], 280:8A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][1279], 430:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][2183]][726:10A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][3066], 727:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][4407]] [2023-10-12 17:40:59,091 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 3:3A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 5:4A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][59], 18:5A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][138], 54:6A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][275], 147:7A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][654], 280:8A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][1279], 437:9A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][2211], 753:10A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][2894]][756:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][4087]] [2023-10-12 17:40:59,570 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 102:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][274], 198:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][655], 357:9A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][1278], 588:10A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][2183]][1019:11A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][3066], 1020:12A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][4407]] [2023-10-12 17:40:59,611 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 102:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][274], 198:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][655], 357:9A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][1278], 590:10A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][2211], 1040:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][2894]][1041:12A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][4087]] [2023-10-12 17:41:00,203 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 100:7A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][194], 188:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][611], 304:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][1182], 503:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][2379], 862:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3365], 1422:12A:[155] L52-1-->thread2EXIT: Formula: (not v_f_9) InVars {f=v_f_9} OutVars{f=v_f_9} AuxVars[] AssignedVars[][4591]][1424:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][6351]] [2023-10-12 17:41:00,213 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 100:7A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][194], 188:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][611], 304:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][1182], 503:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][2379], 862:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3365], 1426:12A:[141] thread1EXIT-->L92: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][4611]][1428:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][6351]] [2023-10-12 17:41:00,230 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 100:7A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][194], 188:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][611], 304:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][1182], 503:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][2379], 862:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3365], 1440:12A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][4635]][1443:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][6351]] [2023-10-12 17:41:00,362 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 101:7A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][202], 196:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][647], 329:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][1226], 558:10A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][2095], 939:11A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][3435], 1511:12A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][4762]][1514:13A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][6479]] [2023-10-12 17:41:00,532 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 101:7A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][202], 196:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][647], 329:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][1226], 564:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][2503], 959:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3477], 1602:12A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][4959]][1603:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][6987]] [2023-10-12 17:41:00,554 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 101:7A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][202], 196:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][647], 329:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][1226], 564:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][2503], 959:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3477], 1614:12A:[155] L52-1-->thread2EXIT: Formula: (not v_f_9) InVars {f=v_f_9} OutVars{f=v_f_9} AuxVars[] AssignedVars[][4987]][1615:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][6987]] [2023-10-12 17:41:00,777 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 102:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][274], 198:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][655], 356:9A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][1270], 587:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][2635], 1016:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3634], 1750:12A:[155] L52-1-->thread2EXIT: Formula: (not v_f_9) InVars {f=v_f_9} OutVars{f=v_f_9} AuxVars[] AssignedVars[][5435]][1752:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][7567]] [2023-10-12 17:41:00,786 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 102:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][274], 198:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][655], 356:9A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][1270], 587:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][2635], 1016:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3634], 1755:12A:[141] thread1EXIT-->L92: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][5447]][1757:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][7567]] [2023-10-12 17:41:00,807 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 102:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][274], 198:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][655], 356:9A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][1270], 587:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][2635], 1016:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3634], 1767:12A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][5471]][1769:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][7567]] [2023-10-12 17:41:00,920 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 102:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][274], 198:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][655], 357:9A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][1278], 593:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][2647], 1063:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3670], 1857:12A:[155] L52-1-->thread2EXIT: Formula: (not v_f_9) InVars {f=v_f_9} OutVars{f=v_f_9} AuxVars[] AssignedVars[][5587]][1858:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][5615]] [2023-10-12 17:41:00,939 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 102:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][274], 198:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][655], 357:9A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][1278], 593:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][2647], 1063:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3670], 1864:12A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][5611]][1867:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][5615]] [2023-10-12 17:41:01,622 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 100:7A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][194], 188:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][611], 304:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][1182], 503:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][2379], 862:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3365], 1422:12A:[155] L52-1-->thread2EXIT: Formula: (not v_f_9) InVars {f=v_f_9} OutVars{f=v_f_9} AuxVars[] AssignedVars[][4591], 2250:13A:[141] thread1EXIT-->L92: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][6339]][2252:14A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][6351]] [2023-10-12 17:41:01,634 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][10], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][23], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][46], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][87], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][34], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][75], 100:7A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][194], 188:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][611], 304:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][1182], 503:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][2379], 862:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3365], 1425:12A:[155] L52-1-->thread2EXIT: Formula: (not v_f_9) InVars {f=v_f_9} OutVars{f=v_f_9} AuxVars[] AssignedVars[][4593]][2256:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][6353], 2258:14A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][6352]] [2023-10-12 17:41:01,635 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:01,635 INFO L124 PetriNetUnfolderBase]: 1398/2257 cut-off events. [2023-10-12 17:41:01,635 INFO L125 PetriNetUnfolderBase]: For 830/830 co-relation queries the response was YES. [2023-10-12 17:41:01,635 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:01,636 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 99#[$Ultimate##0, $Ultimate##0, L90]true [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 117#[$Ultimate##0, $Ultimate##0, L91, $Ultimate##0]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 429#[$Ultimate##0, L32-1, L91, $Ultimate##0]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 429#[$Ultimate##0, L32-1, L91, $Ultimate##0]true [164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back] 431#[$Ultimate##0, L91, $Ultimate##0, thread1EXIT]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 433#[L52-1, L91, $Ultimate##0, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 433#[L52-1, L91, $Ultimate##0, thread1EXIT]true [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 435#[L73-1, L52-1, L91, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 435#[L73-1, L52-1, L91, thread1EXIT]true [155] L52-1-->thread2EXIT: Formula: (not v_f_9) InVars {f=v_f_9} OutVars{f=v_f_9} AuxVars[] AssignedVars[] 649#[L73-1, thread2EXIT, L91, thread1EXIT]true [2023-10-12 17:41:01,636 INFO L750 eck$LassoCheckResult]: Loop: 649#[L73-1, thread2EXIT, L91, thread1EXIT]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 649#[L73-1, thread2EXIT, L91, thread1EXIT]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 649#[L73-1, thread2EXIT, L91, thread1EXIT]true [2023-10-12 17:41:01,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1032919907, now seen corresponding path program 1 times [2023-10-12 17:41:01,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:01,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450919530] [2023-10-12 17:41:01,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:01,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:01,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:01,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:01,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:01,659 INFO L85 PathProgramCache]: Analyzing trace with hash 6145, now seen corresponding path program 5 times [2023-10-12 17:41:01,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:01,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318864531] [2023-10-12 17:41:01,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:01,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:01,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:01,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:01,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:01,664 INFO L85 PathProgramCache]: Analyzing trace with hash -498580067, now seen corresponding path program 1 times [2023-10-12 17:41:01,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:01,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182099036] [2023-10-12 17:41:01,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:01,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:01,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:01,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:02,119 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:02,119 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:02,119 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:02,119 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:02,119 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:02,119 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:02,119 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:02,119 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:02,119 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration11_Lasso [2023-10-12 17:41:02,119 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:02,119 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:02,121 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:02,123 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:02,125 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:02,127 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:02,131 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:02,238 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:02,240 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:02,242 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:02,243 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:02,245 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:02,248 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:02,567 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:02,567 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:02,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:02,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:02,569 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:02,570 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:02,572 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:02,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:02,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:02,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:02,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:02,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:02,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:02,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:02,584 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:02,584 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2023-10-12 17:41:02,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:02,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:02,586 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:02,587 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:02,588 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:02,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:02,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:02,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:02,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:02,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:02,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:02,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:02,607 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:02,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:02,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:02,608 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:02,610 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:02,613 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:02,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:02,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:02,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:02,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:02,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:02,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:02,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:02,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-10-12 17:41:02,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:02,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:02,626 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:02,628 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:02,629 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:02,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:02,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:02,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:02,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:02,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:02,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:02,640 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:02,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2023-10-12 17:41:02,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:02,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:02,643 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:02,645 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:02,646 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:02,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:02,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:02,654 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2023-10-12 17:41:02,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:02,739 INFO L401 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2023-10-12 17:41:02,739 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2023-10-12 17:41:02,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:02,939 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:02,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:02,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:02,940 INFO L229 MonitoredProcess]: Starting monitored process 43 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:02,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-10-12 17:41:02,969 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:02,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:02,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:02,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:02,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:02,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:02,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:02,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:02,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:02,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:02,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:02,997 INFO L229 MonitoredProcess]: Starting monitored process 44 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:03,004 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:03,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:03,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:03,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:03,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:03,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:03,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:03,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-10-12 17:41:03,024 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:03,034 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:41:03,035 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:41:03,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:03,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:03,043 INFO L229 MonitoredProcess]: Starting monitored process 45 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:03,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-10-12 17:41:03,046 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:03,063 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:41:03,063 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:03,063 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:41:03,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:03,074 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2023-10-12 17:41:03,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:03,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:03,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:03,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:41:03,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:41:03,129 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:41:03,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:03,856 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:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2023-10-12 17:41:03,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 260 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:41:03,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:03,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 260 transitions. Stem has 14 letters. Loop has 2 letters. [2023-10-12 17:41:03,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:03,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 260 transitions. Stem has 12 letters. Loop has 4 letters. [2023-10-12 17:41:03,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:03,859 INFO L430 stractBuchiCegarLoop]: Abstraction has has 69 places, 52200 transitions, 1289880 flow [2023-10-12 17:41:03,859 INFO L337 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-10-12 17:41:03,859 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 69 places, 52200 transitions, 1289880 flow [2023-10-12 17:41:14,593 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][52], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][117], 3:3A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][172], 5:4A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][297], 18:5A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][692], 54:6A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][1377], 147:7A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3272], 278:8A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][6397], 431:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][10917]][720:10A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][15332], 721:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][22037]] [2023-10-12 17:41:14,960 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][52], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][117], 3:3A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][172], 5:4A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][297], 18:5A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][692], 54:6A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][1377], 147:7A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3272], 278:8A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][6397], 438:9A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][11057], 745:10A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][14472]][751:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][20437]] [2023-10-12 17:41:20,122 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][52], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][117], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][232], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][437], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][172], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][377], 102:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][1372], 198:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3277], 353:9A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][6392], 587:10A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][10917]][1017:11A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][15332], 1018:12A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][22037]] [2023-10-12 17:41:20,454 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][52], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][117], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][232], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][437], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][172], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][377], 102:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][1372], 198:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3277], 353:9A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][6392], 589:10A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][11057], 1038:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][14472]][1044:12A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][20437]] [2023-10-12 17:41:27,747 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][52], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][117], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][232], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][437], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][172], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][377], 100:7A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][972], 188:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][3057], 300:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][5912], 502:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][11897], 862:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][16827], 1464:12A:[141] thread1EXIT-->L92: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][23057]][1467:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][31757]] [2023-10-12 17:41:27,882 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][52], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][117], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][232], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][437], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][172], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][377], 100:7A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][972], 188:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][3057], 300:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][5912], 502:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][11897], 862:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][16827], 1475:12A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][23177]][1480:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][31757]] [2023-10-12 17:41:28,940 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][52], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][117], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][232], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][437], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][172], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][377], 101:7A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][1012], 196:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][3237], 325:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][6132], 557:10A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][10477], 939:11A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][17177], 1546:12A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][23812]][1547:13A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][32397]] [2023-10-12 17:41:30,099 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][52], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][117], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][232], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][437], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][172], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][377], 101:7A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][1012], 196:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][3237], 325:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][6132], 563:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][12517], 959:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][17387], 1630:12A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][24797]][1631:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][34937]] [2023-10-12 17:41:32,010 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][52], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][117], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][232], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][437], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][172], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][377], 102:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][1372], 198:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3277], 352:9A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][6352], 586:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][13177], 1014:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][18172], 1779:12A:[141] thread1EXIT-->L92: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][27237]][1781:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][37837]] [2023-10-12 17:41:32,145 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][52], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][117], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][232], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][437], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][172], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][377], 102:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][1372], 198:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3277], 352:9A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][6352], 586:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][13177], 1014:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][18172], 1789:12A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][27357]][1791:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][37837]] [2023-10-12 17:41:33,204 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][52], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][117], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][232], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][437], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][172], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][377], 102:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][1372], 198:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][3277], 353:9A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][6392], 592:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][13237], 1061:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][18352], 1879:12A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][28057]][1882:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][28077]] [2023-10-12 17:41:39,529 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][52], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][117], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][232], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][437], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][172], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][377], 100:7A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][972], 188:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][3057], 300:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][5912], 502:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][11897], 862:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][16827], 1468:12A:[141] thread1EXIT-->L92: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][23067]][2330:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][31767], 2332:14A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][31762]] [2023-10-12 17:41:39,530 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:39,530 INFO L124 PetriNetUnfolderBase]: 1400/2331 cut-off events. [2023-10-12 17:41:39,530 INFO L125 PetriNetUnfolderBase]: For 936/936 co-relation queries the response was YES. [2023-10-12 17:41:39,530 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:39,531 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]true [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]true [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]true [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 99#[$Ultimate##0, $Ultimate##0, L90]true [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 117#[$Ultimate##0, $Ultimate##0, L91, $Ultimate##0]true [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 429#[$Ultimate##0, L32-1, L91, $Ultimate##0]true [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 429#[$Ultimate##0, L32-1, L91, $Ultimate##0]true [164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back] 431#[$Ultimate##0, L91, $Ultimate##0, thread1EXIT]true [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 433#[L52-1, L91, $Ultimate##0, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 433#[L52-1, L91, $Ultimate##0, thread1EXIT]true [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 435#[L73-1, L52-1, L91, thread1EXIT]true [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 435#[L73-1, L52-1, L91, thread1EXIT]true [141] thread1EXIT-->L92: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[] 744#[L92, L73-1, L52-1]true [2023-10-12 17:41:39,531 INFO L750 eck$LassoCheckResult]: Loop: 744#[L92, L73-1, L52-1]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 744#[L92, L73-1, L52-1]true [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 744#[L92, L73-1, L52-1]true [2023-10-12 17:41:39,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:39,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1032919921, now seen corresponding path program 1 times [2023-10-12 17:41:39,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:39,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482522133] [2023-10-12 17:41:39,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:39,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:39,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:39,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:39,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash 6145, now seen corresponding path program 6 times [2023-10-12 17:41:39,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:39,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400669612] [2023-10-12 17:41:39,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:39,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:39,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:39,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:39,563 INFO L85 PathProgramCache]: Analyzing trace with hash -498593521, now seen corresponding path program 1 times [2023-10-12 17:41:39,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:39,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705696227] [2023-10-12 17:41:39,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:39,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:39,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:39,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:40,215 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:40,215 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:40,215 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:40,215 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:40,215 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:40,215 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:40,215 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:40,215 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:40,215 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration12_Lasso [2023-10-12 17:41:40,215 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:40,215 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:40,216 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:40,315 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:40,317 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:40,320 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:40,322 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:40,324 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:40,331 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:40,333 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:40,335 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:40,337 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:40,339 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:40,725 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:40,726 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:40,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:40,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:40,745 INFO L229 MonitoredProcess]: Starting monitored process 46 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:40,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-10-12 17:41:40,754 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:40,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:40,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:40,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:40,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:40,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:40,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:40,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:40,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:40,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:40,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:40,780 INFO L229 MonitoredProcess]: Starting monitored process 47 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:40,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-10-12 17:41:40,784 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:40,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:40,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:40,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:40,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:40,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:40,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:40,798 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:40,805 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:41:40,805 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:41:40,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:40,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:40,806 INFO L229 MonitoredProcess]: Starting monitored process 48 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:40,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-10-12 17:41:40,809 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:40,823 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:41:40,823 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:40,823 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:40,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:40,835 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2023-10-12 17:41:40,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:40,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:40,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:40,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:41:40,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:41:40,901 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:41:41,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-10-12 17:41:44,183 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:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2023-10-12 17:41:44,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 260 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:41:44,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:44,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 260 transitions. Stem has 14 letters. Loop has 2 letters. [2023-10-12 17:41:44,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:44,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 260 transitions. Stem has 12 letters. Loop has 4 letters. [2023-10-12 17:41:44,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:44,185 INFO L430 stractBuchiCegarLoop]: Abstraction has has 74 places, 261000 transitions, 6971400 flow [2023-10-12 17:41:44,185 INFO L337 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-10-12 17:41:44,185 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 74 places, 261000 transitions, 6971400 flow [2023-10-12 17:43:08,889 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][264], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][589], 3:3A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][864], 5:4A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][1489], 18:5A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][3464], 54:6A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][6889], 146:7A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][16364], 277:8A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][31989], 430:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][54589]][719:10A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][76664], 722:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][110189]] [2023-10-12 17:43:11,023 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][264], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][589], 3:3A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][864], 5:4A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][1489], 18:5A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][3464], 54:6A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][6889], 146:7A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][16364], 277:8A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][31989], 437:9A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][55289], 744:10A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][72364]][747:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][102189]] [2023-10-12 17:43:46,776 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][264], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][589], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][1164], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2189], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][864], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][1889], 101:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][6864], 197:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][16389], 354:9A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][31964], 586:10A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][54589]][1021:11A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][76664], 1024:12A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][110189]] [2023-10-12 17:43:48,838 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][264], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][589], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][1164], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2189], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][864], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][1889], 101:7A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][6864], 197:8A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][16389], 354:9A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][31964], 588:10A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][55289], 1042:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][72364]][1047:12A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][102189]] [2023-10-12 17:44:40,154 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][264], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][589], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][1164], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2189], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][864], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][1889], 99:7A:[164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back][4864], 188:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][15289], 301:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][29564], 497:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][59489], 870:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][84139], 1516:12A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][115889]][1521:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][158789]] [2023-10-12 17:44:50,659 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][264], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][589], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][1164], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2189], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][864], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][1889], 100:7A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][5064], 195:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][16189], 326:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][30664], 556:10A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][52389], 946:11A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][85889], 1599:12A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][119064]][1600:13A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][161989]] [2023-10-12 17:44:58,913 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][264], 2:2A:[134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][589], 4:3A:[137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][1164], 13:4A:[140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2189], 16:5A:[104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i][864], 43:6A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][1889], 100:7A:[163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back][5064], 195:8A:[154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s][16189], 326:9A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][30664], 562:10A:[151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t][62589], 966:11A:[165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s][86939], 1680:12A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][123989]][1681:13A:[162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front][174689]] Received shutdown request... [2023-10-12 17:45:00,959 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:45:00,959 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:45:00,959 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:45:01,167 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:45:01,170 INFO L201 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:45:01 BoogieIcfgContainer [2023-10-12 17:45:01,171 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:45:01,171 INFO L158 Benchmark]: Toolchain (without parser) took 257539.20ms. Allocated memory was 213.9MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 164.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2023-10-12 17:45:01,171 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 213.9MB. Free memory is still 165.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:45:01,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.49ms. Allocated memory is still 213.9MB. Free memory was 164.6MB in the beginning and 163.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:45:01,171 INFO L158 Benchmark]: Boogie Preprocessor took 12.69ms. Allocated memory is still 213.9MB. Free memory was 163.0MB in the beginning and 162.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:45:01,172 INFO L158 Benchmark]: RCFGBuilder took 210.16ms. Allocated memory was 213.9MB in the beginning and 256.9MB in the end (delta: 43.0MB). Free memory was 161.8MB in the beginning and 220.0MB in the end (delta: -58.2MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2023-10-12 17:45:01,172 INFO L158 Benchmark]: BuchiAutomizer took 257295.97ms. Allocated memory was 256.9MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 220.0MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2023-10-12 17:45:01,172 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25ms. Allocated memory is still 213.9MB. Free memory is still 165.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.49ms. Allocated memory is still 213.9MB. Free memory was 164.6MB in the beginning and 163.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.69ms. Allocated memory is still 213.9MB. Free memory was 163.0MB in the beginning and 162.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 210.16ms. Allocated memory was 213.9MB in the beginning and 256.9MB in the end (delta: 43.0MB). Free memory was 161.8MB in the beginning and 220.0MB in the end (delta: -58.2MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 257295.97ms. Allocated memory was 256.9MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 220.0MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (5 trivial, 6 deterministic, 1 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 4 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 4 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 4 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 4 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 4 locations. One nondeterministic module has affine ranking function -1 * q1_front + q1_back and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 6971400 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 257.1s and 13 iterations. TraceHistogramMax:0. Analysis of lassos took 8.3s. Construction of modules took 0.6s. Büchi inclusion checks took 7.9s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1168 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1159 mSDsluCounter, 911 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 319 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1184 IncrementalHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 592 mSDtfsCounter, 1184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU1 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax100 hnf100 lsp63 ukn95 mio100 lsp68 div100 bol110 ite100 ukn100 eq191 hnf90 smp100 dnf280 smp64 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 286ms VariablesStem: 16 VariablesLoop: 11 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.7s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderRabin. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 46 PlacesBefore, 25 PlacesAfterwards, 39 TransitionsBefore, 18 TransitionsAfterwards, 634 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 22 TotalNumberOfCompositions, 535 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 503, independent: 497, independent conditional: 0, independent unconditional: 497, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 395, independent: 389, independent conditional: 0, independent unconditional: 389, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 395, independent: 384, independent conditional: 0, independent unconditional: 384, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 503, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 395, unknown conditional: 0, unknown unconditional: 395] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown