/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/buffer-mult.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:39:03,826 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:39:03,872 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:39:03,894 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:39:03,894 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:39:03,894 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:39:03,895 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:39:03,896 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:39:03,896 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:39:03,902 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:39:03,903 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:39:03,903 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:39:03,904 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:39:03,907 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:39:03,908 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:39:03,908 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:39:03,909 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:39:03,910 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:39:03,910 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:39:03,910 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:39:03,910 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:39:03,911 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:39:03,911 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:39:03,911 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:39:03,911 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:39:03,911 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:39:03,912 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:39:03,912 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:39:03,912 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:39:03,912 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:39:03,913 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:39:03,913 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:39:03,913 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:39:03,915 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:39:03,915 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:39:04,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:39:04,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:39:04,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:39:04,152 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:39:04,153 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:39:04,154 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/buffer-mult.wvr.bpl [2023-10-12 17:39:04,154 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-mult.wvr.bpl' [2023-10-12 17:39:04,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:39:04,190 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:39:04,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:39:04,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:39:04,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:39:04,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:04" (1/1) ... [2023-10-12 17:39:04,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:04" (1/1) ... [2023-10-12 17:39:04,220 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:39:04,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:39:04,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:39:04,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:39:04,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:39:04,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:04" (1/1) ... [2023-10-12 17:39:04,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:04" (1/1) ... [2023-10-12 17:39:04,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:04" (1/1) ... [2023-10-12 17:39:04,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:04" (1/1) ... [2023-10-12 17:39:04,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:04" (1/1) ... [2023-10-12 17:39:04,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:04" (1/1) ... [2023-10-12 17:39:04,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:04" (1/1) ... [2023-10-12 17:39:04,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:04" (1/1) ... [2023-10-12 17:39:04,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:39:04,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:39:04,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:39:04,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:39:04,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:04" (1/1) ... [2023-10-12 17:39:04,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:04,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:04,282 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:39:04,293 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:39:04,327 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:39:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:39:04,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:39:04,328 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:39:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:39:04,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:39:04,328 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:39:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:39:04,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:39:04,329 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:39:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:39:04,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:39:04,330 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:39:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:39:04,330 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:39:04,331 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:39:04,379 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:39:04,381 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:39:04,491 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:39:04,512 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:39:04,518 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:39:04,520 INFO L201 PluginConnector]: Adding new model buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:39:04 BoogieIcfgContainer [2023-10-12 17:39:04,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:39:04,521 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:39:04,521 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:39:04,526 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:39:04,526 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:39:04,526 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:39:04" (1/2) ... [2023-10-12 17:39:04,528 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@422931c5 and model type buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:39:04, skipping insertion in model container [2023-10-12 17:39:04,528 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:39:04,528 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:39:04" (2/2) ... [2023-10-12 17:39:04,529 INFO L332 chiAutomizerObserver]: Analyzing ICFG buffer-mult.wvr.bpl [2023-10-12 17:39:04,588 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:39:04,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:39:04,662 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:39:04,662 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:39:04,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 55 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:39:04,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:39:04,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2023-10-12 17:39:04,679 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:39:04,691 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:39:04,693 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:39:04,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 86 flow [2023-10-12 17:39:04,704 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:39:04,704 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:39:04,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 55 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:39:04,705 INFO L119 LiptonReduction]: Number of co-enabled transitions 350 [2023-10-12 17:39:04,954 INFO L134 LiptonReduction]: Checked pairs total: 505 [2023-10-12 17:39:04,954 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:39:04,972 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:39:04,972 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:39:04,972 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:39:04,972 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:39:04,973 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:39:04,973 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:39:04,973 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:39:04,973 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:39:04,974 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:39:04,977 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][12], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][13]][5:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][17], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][4]] [2023-10-12 17:39:04,978 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:04,979 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:39:04,979 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:39:04,979 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:04,983 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:39:04,983 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:39:04,984 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][12], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][13]][5:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][17], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][4]] [2023-10-12 17:39:04,985 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:04,985 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:39:04,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:39:04,985 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:04,989 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [2023-10-12 17:39:04,989 INFO L750 eck$LassoCheckResult]: Loop: 52#[L73-1, L24]true [126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back] 55#[L73-1, L25-1]true [90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i] 52#[L73-1, L24]true [2023-10-12 17:39:04,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:04,997 INFO L85 PathProgramCache]: Analyzing trace with hash 3578, now seen corresponding path program 1 times [2023-10-12 17:39:05,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:05,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534210489] [2023-10-12 17:39:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:05,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:05,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:05,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:05,078 INFO L85 PathProgramCache]: Analyzing trace with hash 4957, now seen corresponding path program 1 times [2023-10-12 17:39:05,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:05,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842979725] [2023-10-12 17:39:05,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:05,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:05,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:05,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:05,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:05,095 INFO L85 PathProgramCache]: Analyzing trace with hash 3442454, now seen corresponding path program 1 times [2023-10-12 17:39:05,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:05,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029891301] [2023-10-12 17:39:05,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:05,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:05,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:05,206 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:05,207 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:05,207 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:05,207 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:05,207 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:05,207 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:05,208 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:05,208 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:05,208 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:39:05,208 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:05,208 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:05,227 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:39:05,255 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:39:05,264 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:39:05,269 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:39:05,273 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:39:05,277 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:39:05,375 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:05,379 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:05,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:05,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:05,387 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:39:05,395 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:39:05,398 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:39:05,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:05,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:39:05,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:05,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:05,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:05,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:39:05,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:39:05,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:05,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:05,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:05,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:05,417 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:39:05,420 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:39:05,422 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:39:05,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:05,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:05,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:05,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:05,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:05,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:05,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:05,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:05,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:05,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:05,463 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:39:05,465 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:39:05,467 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:39:05,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:05,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:05,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:05,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:05,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:05,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:05,501 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:05,531 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:39:05,531 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:39:05,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:05,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:05,536 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:39:05,537 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:39:05,538 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:05,570 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:05,570 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:05,571 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:39:05,577 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:39:05,579 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:39:05,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:05,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:05,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:05,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:05,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:05,650 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:39:05,690 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:39:05,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:39:05,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:39:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-10-12 17:39:05,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:39:05,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:05,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:39:05,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:05,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:39:05,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:05,892 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 115 transitions, 580 flow [2023-10-12 17:39:05,892 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:39:05,893 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 37 places, 115 transitions, 580 flow [2023-10-12 17:39:05,898 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][64], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][69], 3:3A:[109] L73-1-->L36: 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][30]][18:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][103], 19:5A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][48]] [2023-10-12 17:39:05,898 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:05,898 INFO L124 PetriNetUnfolderBase]: 8/18 cut-off events. [2023-10-12 17:39:05,898 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:39:05,898 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:05,899 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [109] L73-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 95#[L36, L74, L24]true [2023-10-12 17:39:05,899 INFO L750 eck$LassoCheckResult]: Loop: 95#[L36, L74, L24]true [121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back] 98#[L74, L37-1, L24]true [95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j] 95#[L36, L74, L24]true [2023-10-12 17:39:05,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:05,900 INFO L85 PathProgramCache]: Analyzing trace with hash 111027, now seen corresponding path program 1 times [2023-10-12 17:39:05,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:05,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732362289] [2023-10-12 17:39:05,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:05,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:05,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:05,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:05,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash 4807, now seen corresponding path program 1 times [2023-10-12 17:39:05,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:05,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501678399] [2023-10-12 17:39:05,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:05,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:05,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:05,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:05,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:05,921 INFO L85 PathProgramCache]: Analyzing trace with hash 106700793, now seen corresponding path program 1 times [2023-10-12 17:39:05,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:05,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024634236] [2023-10-12 17:39:05,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:05,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:05,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:05,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:06,013 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:06,014 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:06,014 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:06,014 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:06,014 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:06,014 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:06,014 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:06,014 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:06,014 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:39:06,015 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:06,015 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:06,016 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:39:06,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:39:06,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:39:06,033 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:39:06,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:39:06,043 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:39:06,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:39:06,049 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:39:06,141 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:06,141 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:06,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:06,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:06,145 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:39:06,154 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:39:06,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:06,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:06,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:06,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:06,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:06,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:06,168 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:39:06,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:06,182 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:39:06,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:06,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:06,185 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:39:06,196 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:39:06,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:06,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:06,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:06,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:06,208 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:39:06,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:06,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:06,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:06,236 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:39:06,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:06,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:06,238 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:39:06,241 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:39:06,243 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:39:06,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:06,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:06,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:06,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:06,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:06,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:06,280 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:06,288 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:39:06,289 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:39:06,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:06,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:06,290 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:39:06,293 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:39:06,295 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:06,329 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:06,329 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:06,329 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, N) = -1*j + 1*N Supporting invariants [] [2023-10-12 17:39:06,335 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:39:06,336 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:39:06,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:06,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:06,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:06,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:06,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:06,389 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:39:06,391 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:39:06,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:39:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2023-10-12 17:39:06,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:39:06,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:06,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:39:06,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:06,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 240 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:39:06,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:06,554 INFO L430 stractBuchiCegarLoop]: Abstraction has has 42 places, 575 transitions, 4050 flow [2023-10-12 17:39:06,555 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:39:06,555 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 42 places, 575 transitions, 4050 flow [2023-10-12 17:39:06,563 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][323], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][348], 3:3A:[109] L73-1-->L36: 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][153], 7:4A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][41]][31:5A:[97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[][192], 33:6A:[99] L49-->L49-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (+ (select v_q1_7 v_q1_front_11) v_total_16) v_total_15) (< v_q1_front_11 v_q1_back_14)) InVars {q1_front=v_q1_front_11, q1=v_q1_7, total=v_total_16, q1_back=v_q1_back_14} OutVars{q1_front=v_q1_front_10, q1=v_q1_7, total=v_total_15, q1_back=v_q1_back_14} AuxVars[] AssignedVars[q1_front, total][142]] [2023-10-12 17:39:06,563 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:06,564 INFO L124 PetriNetUnfolderBase]: 18/32 cut-off events. [2023-10-12 17:39:06,564 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:39:06,564 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:06,564 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [109] L73-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 95#[L36, L74, L24]true [112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 136#[L75, L36, L24, L49-1]true [2023-10-12 17:39:06,566 INFO L750 eck$LassoCheckResult]: Loop: 136#[L75, L36, L24, L49-1]true [97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 139#[L49, L75, L36, L24]true [99] L49-->L49-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (+ (select v_q1_7 v_q1_front_11) v_total_16) v_total_15) (< v_q1_front_11 v_q1_back_14)) InVars {q1_front=v_q1_front_11, q1=v_q1_7, total=v_total_16, q1_back=v_q1_back_14} OutVars{q1_front=v_q1_front_10, q1=v_q1_7, total=v_total_15, q1_back=v_q1_back_14} AuxVars[] AssignedVars[q1_front, total] 136#[L75, L36, L24, L49-1]true [2023-10-12 17:39:06,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:06,567 INFO L85 PathProgramCache]: Analyzing trace with hash 3441949, now seen corresponding path program 1 times [2023-10-12 17:39:06,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:06,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451520285] [2023-10-12 17:39:06,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:06,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:06,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:06,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:06,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:06,590 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2023-10-12 17:39:06,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:06,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301519109] [2023-10-12 17:39:06,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:06,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:06,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:06,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:06,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:06,617 INFO L85 PathProgramCache]: Analyzing trace with hash -987251201, now seen corresponding path program 1 times [2023-10-12 17:39:06,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:06,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038278596] [2023-10-12 17:39:06,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:06,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:06,665 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:39:06,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:39:06,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038278596] [2023-10-12 17:39:06,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038278596] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:39:06,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:39:06,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:39:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238065337] [2023-10-12 17:39:06,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:39:06,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:39:06,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:39:06,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:39:06,702 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 42 places, 575 transitions, 4050 flow. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:06,702 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:39:06,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:39:06,951 INFO L124 PetriNetUnfolderBase]: 1507/2078 cut-off events. [2023-10-12 17:39:06,951 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2023-10-12 17:39:06,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8687 conditions, 2078 events. 1507/2078 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7834 event pairs, 194 based on Foata normal form. 57/1444 useless extension candidates. Maximal degree in co-relation 6550. Up to 1484 conditions per place. [2023-10-12 17:39:06,980 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 226 selfloop transitions, 6 changer transitions 0/232 dead transitions. [2023-10-12 17:39:06,980 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 43 places, 232 transitions, 2039 flow [2023-10-12 17:39:06,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:39:06,981 INFO L430 stractBuchiCegarLoop]: Abstraction has has 43 places, 232 transitions, 2039 flow [2023-10-12 17:39:06,982 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:39:06,982 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 43 places, 232 transitions, 2039 flow [2023-10-12 17:39:06,984 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][3]][7:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][6], 8:5A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][14]] [2023-10-12 17:39:06,995 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][3], 9:4A:[109] L73-1-->L36: 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][7], 40:5A:[120] L36-->thread2EXIT: Formula: (<= v_N_10 v_j_8) InVars {N=v_N_10, j=v_j_8} OutVars{N=v_N_10, j=v_j_8} AuxVars[] AssignedVars[][16]][105:6A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][31], 107:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][48]] [2023-10-12 17:39:06,996 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][3], 9:4A:[109] L73-1-->L36: 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][7], 41:5A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][17]][110:6A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][44], 112:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][77]] [2023-10-12 17:39:06,997 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][3], 9:4A:[109] L73-1-->L36: 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][7], 49:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][19]][115:6A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][31], 121:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][48]] [2023-10-12 17:39:06,998 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][3], 9:4A:[109] L73-1-->L36: 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][7], 49:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][19]][126:6A:[97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[][51], 128:7A:[99] L49-->L49-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (+ (select v_q1_7 v_q1_front_11) v_total_16) v_total_15) (< v_q1_front_11 v_q1_back_14)) InVars {q1_front=v_q1_front_11, q1=v_q1_7, total=v_total_16, q1_back=v_q1_back_14} OutVars{q1_front=v_q1_front_10, q1=v_q1_7, total=v_total_15, q1_back=v_q1_back_14} AuxVars[] AssignedVars[q1_front, total][83]] [2023-10-12 17:39:06,999 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:06,999 INFO L124 PetriNetUnfolderBase]: 83/127 cut-off events. [2023-10-12 17:39:06,999 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-10-12 17:39:06,999 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:07,000 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back] 55#[L73-1, L25-1]true [109] L73-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 154#[L36, L74, L25-1]true [112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 156#[L75, L36, L25-1, L49-1]true [2023-10-12 17:39:07,000 INFO L750 eck$LassoCheckResult]: Loop: 156#[L75, L36, L25-1, L49-1]true [97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 159#[L49, L75, L36, L25-1]true [99] L49-->L49-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (+ (select v_q1_7 v_q1_front_11) v_total_16) v_total_15) (< v_q1_front_11 v_q1_back_14)) InVars {q1_front=v_q1_front_11, q1=v_q1_7, total=v_total_16, q1_back=v_q1_back_14} OutVars{q1_front=v_q1_front_10, q1=v_q1_7, total=v_total_15, q1_back=v_q1_back_14} AuxVars[] AssignedVars[q1_front, total] 156#[L75, L36, L25-1, L49-1]true [2023-10-12 17:39:07,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash 106716775, now seen corresponding path program 1 times [2023-10-12 17:39:07,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:07,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825392737] [2023-10-12 17:39:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:07,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:07,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:07,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:07,011 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 2 times [2023-10-12 17:39:07,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:07,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790755672] [2023-10-12 17:39:07,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:07,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:07,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:07,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:07,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:07,019 INFO L85 PathProgramCache]: Analyzing trace with hash -524391223, now seen corresponding path program 1 times [2023-10-12 17:39:07,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:07,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668449978] [2023-10-12 17:39:07,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:07,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:07,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:07,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:07,171 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:07,171 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:07,171 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:07,171 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:07,171 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:07,171 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:07,171 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:07,171 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:07,171 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:39:07,171 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:07,171 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:07,175 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:39:07,178 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:39:07,197 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:39:07,201 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:39:07,203 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:39:07,206 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:39:07,208 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:39:07,212 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:39:07,214 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:39:07,217 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:39:07,220 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:39:07,239 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:39:07,348 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:07,348 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:07,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:07,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:07,349 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:39:07,361 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:39:07,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:07,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:07,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:07,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:07,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:07,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:07,374 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:39:07,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:07,382 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:39:07,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:07,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:07,384 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:39:07,387 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:39:07,387 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:39:07,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:07,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:07,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:07,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:07,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:07,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:07,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:07,416 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:39:07,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:07,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:07,418 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:39:07,421 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:39:07,422 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:39:07,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:07,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:07,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:07,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:07,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:07,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:07,449 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:07,468 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:39:07,468 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:39:07,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:07,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:07,473 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:39:07,476 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:39:07,497 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:07,518 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:07,518 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:07,518 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:39:07,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-10-12 17:39:07,523 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:39:07,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:07,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:07,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:07,555 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:07,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:07,558 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:39:07,558 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:39:07,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:39:07,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:39:07,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:39:07,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:07,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:39:07,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:07,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:39:07,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:07,618 INFO L430 stractBuchiCegarLoop]: Abstraction has has 48 places, 1160 transitions, 12515 flow [2023-10-12 17:39:07,619 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:39:07,619 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 48 places, 1160 transitions, 12515 flow [2023-10-12 17:39:07,623 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][1], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 4:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][16]][7:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][31], 8:5A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][71]] [2023-10-12 17:39:07,647 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][1], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 4:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][16], 9:4A:[109] L73-1-->L36: 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][36], 34:5A:[120] L36-->thread2EXIT: Formula: (<= v_N_10 v_j_8) InVars {N=v_N_10, j=v_j_8} OutVars{N=v_N_10, j=v_j_8} AuxVars[] AssignedVars[][81]][123:6A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][156], 124:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][241]] [2023-10-12 17:39:07,649 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][1], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 4:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][16], 9:4A:[109] L73-1-->L36: 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][36], 35:5A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][86]][128:6A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][221], 129:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][386]] [2023-10-12 17:39:07,655 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:07,656 INFO L124 PetriNetUnfolderBase]: 112/168 cut-off events. [2023-10-12 17:39:07,656 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-10-12 17:39:07,656 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:07,658 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [109] L73-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 95#[L36, L74, L24]true [112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 136#[L75, L36, L24, L49-1]true [97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 139#[L49, L75, L36, L24]true [126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back] 159#[L49, L75, L36, L25-1]true [99] L49-->L49-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (+ (select v_q1_7 v_q1_front_11) v_total_16) v_total_15) (< v_q1_front_11 v_q1_back_14)) InVars {q1_front=v_q1_front_11, q1=v_q1_7, total=v_total_16, q1_back=v_q1_back_14} OutVars{q1_front=v_q1_front_10, q1=v_q1_7, total=v_total_15, q1_back=v_q1_back_14} AuxVars[] AssignedVars[q1_front, total] 156#[L75, L36, L25-1, L49-1]true [2023-10-12 17:39:07,658 INFO L750 eck$LassoCheckResult]: Loop: 156#[L75, L36, L25-1, L49-1]true [97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 159#[L49, L75, L36, L25-1]true [99] L49-->L49-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (+ (select v_q1_7 v_q1_front_11) v_total_16) v_total_15) (< v_q1_front_11 v_q1_back_14)) InVars {q1_front=v_q1_front_11, q1=v_q1_7, total=v_total_16, q1_back=v_q1_back_14} OutVars{q1_front=v_q1_front_10, q1=v_q1_7, total=v_total_15, q1_back=v_q1_back_14} AuxVars[] AssignedVars[q1_front, total] 156#[L75, L36, L25-1, L49-1]true [2023-10-12 17:39:07,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:07,658 INFO L85 PathProgramCache]: Analyzing trace with hash -540015223, now seen corresponding path program 2 times [2023-10-12 17:39:07,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:07,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790567177] [2023-10-12 17:39:07,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:07,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:07,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:07,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:07,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:07,690 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 3 times [2023-10-12 17:39:07,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:07,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134699501] [2023-10-12 17:39:07,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:07,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:07,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:07,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:07,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:07,711 INFO L85 PathProgramCache]: Analyzing trace with hash 736416619, now seen corresponding path program 3 times [2023-10-12 17:39:07,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:07,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622993380] [2023-10-12 17:39:07,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:07,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:39:07,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:39:07,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622993380] [2023-10-12 17:39:07,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622993380] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:39:07,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774245036] [2023-10-12 17:39:07,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-10-12 17:39:07,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:39:07,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:07,790 INFO L229 MonitoredProcess]: Starting monitored process 14 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:39:07,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-10-12 17:39:07,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-10-12 17:39:07,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:39:07,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:07,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:39:07,854 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:39:07,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774245036] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:39:07,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:39:07,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:39:07,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88025598] [2023-10-12 17:39:07,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:39:07,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:39:07,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:39:07,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:39:07,876 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 48 places, 1160 transitions, 12515 flow. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:07,876 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:39:07,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:39:08,261 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:39:09,299 INFO L124 PetriNetUnfolderBase]: 5988/8094 cut-off events. [2023-10-12 17:39:09,299 INFO L125 PetriNetUnfolderBase]: For 1410/1410 co-relation queries the response was YES. [2023-10-12 17:39:09,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49827 conditions, 8094 events. 5988/8094 cut-off events. For 1410/1410 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 36501 event pairs, 136 based on Foata normal form. 182/5547 useless extension candidates. Maximal degree in co-relation 47189. Up to 7479 conditions per place. [2023-10-12 17:39:09,407 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 999 selfloop transitions, 138 changer transitions 0/1137 dead transitions. [2023-10-12 17:39:09,407 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 50 places, 1137 transitions, 14295 flow [2023-10-12 17:39:09,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:39:09,410 INFO L430 stractBuchiCegarLoop]: Abstraction has has 50 places, 1137 transitions, 14295 flow [2023-10-12 17:39:09,410 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:39:09,410 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 50 places, 1137 transitions, 14295 flow [2023-10-12 17:39:09,439 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[109] L73-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][2], 8:4A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][7], 35:5A:[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][20]][180:6A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][61], 181:7A:[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front][148]] [2023-10-12 17:39:09,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:09,440 INFO L124 PetriNetUnfolderBase]: 119/180 cut-off events. [2023-10-12 17:39:09,440 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-10-12 17:39:09,440 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:09,441 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [109] L73-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 95#[L36, L74, L24]true [112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 136#[L75, L36, L24, L49-1]true [115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 248#[L36, L24, L76, L61-1, L49-1]true [2023-10-12 17:39:09,441 INFO L750 eck$LassoCheckResult]: Loop: 248#[L36, L24, L76, L61-1, L49-1]true [101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 251#[L36, L61, L24, L76, L49-1]true [103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front] 248#[L36, L24, L76, L61-1, L49-1]true [2023-10-12 17:39:09,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:09,441 INFO L85 PathProgramCache]: Analyzing trace with hash 106700534, now seen corresponding path program 1 times [2023-10-12 17:39:09,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:09,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342262777] [2023-10-12 17:39:09,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:09,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:09,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:09,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:09,467 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2023-10-12 17:39:09,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:09,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836902966] [2023-10-12 17:39:09,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:09,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:09,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:09,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:09,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:09,473 INFO L85 PathProgramCache]: Analyzing trace with hash -539998696, now seen corresponding path program 1 times [2023-10-12 17:39:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:09,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979494720] [2023-10-12 17:39:09,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:09,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:09,512 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:39:09,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:39:09,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979494720] [2023-10-12 17:39:09,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979494720] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:39:09,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:39:09,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:39:09,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11116389] [2023-10-12 17:39:09,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:39:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:39:09,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:39:09,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:39:09,538 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 50 places, 1137 transitions, 14295 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:09,539 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:39:09,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:39:11,484 INFO L124 PetriNetUnfolderBase]: 8475/11548 cut-off events. [2023-10-12 17:39:11,485 INFO L125 PetriNetUnfolderBase]: For 2078/2078 co-relation queries the response was YES. [2023-10-12 17:39:11,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82747 conditions, 11548 events. 8475/11548 cut-off events. For 2078/2078 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 56035 event pairs, 225 based on Foata normal form. 252/7740 useless extension candidates. Maximal degree in co-relation 63967. Up to 10680 conditions per place. [2023-10-12 17:39:11,608 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 1466 selfloop transitions, 43 changer transitions 0/1509 dead transitions. [2023-10-12 17:39:11,608 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 52 places, 1509 transitions, 22035 flow [2023-10-12 17:39:11,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:39:11,611 INFO L430 stractBuchiCegarLoop]: Abstraction has has 52 places, 1509 transitions, 22035 flow [2023-10-12 17:39:11,611 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:39:11,611 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 52 places, 1509 transitions, 22035 flow [2023-10-12 17:39:11,625 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 5:3A:[109] L73-1-->L36: 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][4], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][9]][44:5A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][24], 45:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][69]] [2023-10-12 17:39:11,634 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][2], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][5], 27:5A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][15]][97:6A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][46], 98:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][115]] [2023-10-12 17:39:11,638 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][2], 7:4A:[109] L73-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][6], 29:5A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][17]][115:6A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][50], 116:7A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][131]] [2023-10-12 17:39:11,644 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[125] L24-->thread1EXIT: Formula: (<= v_N_22 v_i_18) InVars {N=v_N_22, i=v_i_18} OutVars{N=v_N_22, i=v_i_18} AuxVars[] AssignedVars[][3], 8:4A:[109] L73-1-->L36: 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][7], 38:5A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][9]][149:6A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][24], 150:7A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][69]] [2023-10-12 17:39:11,663 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][2], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][5], 25:5A:[109] L73-1-->L36: 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], 85:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][41]][257:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][97], 258:8A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][205]] [2023-10-12 17:39:11,666 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][2], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][5], 25:5A:[109] L73-1-->L36: 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], 86:6A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][42]][262:7A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][103], 263:8A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][219]] [2023-10-12 17:39:11,705 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 5:3A:[109] L73-1-->L36: 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][4], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][9], 42:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][23], 182:6A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][63]][464:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][164], 465:8A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][321]] [2023-10-12 17:39:11,707 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 5:3A:[109] L73-1-->L36: 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][4], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][9], 42:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][23], 183:6A:[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][64]][471:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][91], 472:8A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][171]] [2023-10-12 17:39:11,709 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 5:3A:[109] L73-1-->L36: 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][4], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][9], 42:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][23], 183:6A:[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][64]][480:7A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][166], 485:8A:[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front][330]] [2023-10-12 17:39:11,709 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:11,709 INFO L124 PetriNetUnfolderBase]: 330/484 cut-off events. [2023-10-12 17:39:11,709 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2023-10-12 17:39:11,709 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:11,711 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [109] L73-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 95#[L36, L74, L24]true [121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back] 98#[L74, L37-1, L24]true [112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 267#[L75, L37-1, L24, L49-1]true [115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 269#[L37-1, L24, L76, L61-1, L49-1]true [2023-10-12 17:39:11,711 INFO L750 eck$LassoCheckResult]: Loop: 269#[L37-1, L24, L76, L61-1, L49-1]true [101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 272#[L37-1, L61, L24, L76, L49-1]true [103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front] 269#[L37-1, L24, L76, L61-1, L49-1]true [2023-10-12 17:39:11,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:11,711 INFO L85 PathProgramCache]: Analyzing trace with hash -987242071, now seen corresponding path program 1 times [2023-10-12 17:39:11,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:11,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166478889] [2023-10-12 17:39:11,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:11,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:11,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:11,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 2 times [2023-10-12 17:39:11,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:11,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509325390] [2023-10-12 17:39:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:11,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:11,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:11,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:11,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:11,742 INFO L85 PathProgramCache]: Analyzing trace with hash 448145419, now seen corresponding path program 1 times [2023-10-12 17:39:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:11,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974045537] [2023-10-12 17:39:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:11,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:11,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:11,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:11,959 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:11,959 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:11,959 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:11,959 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:11,959 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:11,960 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:11,960 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:11,960 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:11,960 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:39:11,960 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:11,960 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:11,963 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:39:11,965 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:39:11,967 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:39:11,969 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:39:11,971 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:39:11,974 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:39:11,976 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:39:11,978 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:39:11,981 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:39:11,983 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:39:11,985 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:39:11,987 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:39:11,989 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:39:11,992 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:39:12,010 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:39:12,163 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:12,163 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:12,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,165 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:39:12,177 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:39:12,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,190 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:39:12,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:12,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,207 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:39:12,215 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:39:12,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,227 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:39:12,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:12,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,243 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:39:12,246 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:39:12,248 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:39:12,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,280 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:39:12,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,282 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:39:12,360 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:39:12,361 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:39:12,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,390 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:39:12,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,392 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:39:12,407 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:39:12,408 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:39:12,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,437 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,443 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:39:12,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,444 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:39:12,447 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:39:12,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:39:12,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,457 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,457 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:12,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,479 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:39:12,485 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:39:12,486 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:39:12,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,513 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:39:12,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,514 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:39:12,524 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:39:12,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,535 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:39:12,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,558 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:39:12,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,560 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:39:12,562 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:39:12,565 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:39:12,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,596 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:39:12,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,597 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:39:12,602 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:39:12,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,614 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:39:12,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:12,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,632 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:39:12,638 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:39:12,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,648 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:39:12,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,676 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:39:12,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,677 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:39:12,679 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:39:12,681 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:39:12,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,712 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:39:12,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,714 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:39:12,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:39:12,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,733 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:39:12,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,758 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:39:12,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,760 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:39:12,761 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:39:12,763 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:39:12,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:12,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:12,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,807 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:39:12,813 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:39:12,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:12,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:12,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:12,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:12,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:12,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:12,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-10-12 17:39:12,836 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:12,846 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:39:12,846 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:39:12,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:12,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:12,851 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:39:12,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-10-12 17:39:12,853 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:12,874 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:12,874 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:12,874 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:39:12,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:12,884 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:39:12,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:12,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:12,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:12,923 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:12,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:12,927 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:39:12,928 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:39:13,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:39:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:39:13,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:39:13,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:13,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:39:13,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:13,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:39:13,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:13,038 INFO L430 stractBuchiCegarLoop]: Abstraction has has 57 places, 7545 transitions, 125265 flow [2023-10-12 17:39:13,038 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:39:13,038 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 57 places, 7545 transitions, 125265 flow [2023-10-12 17:39:13,113 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 5:3A:[109] L73-1-->L36: 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], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][45]][44:5A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][120], 45:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][345]] [2023-10-12 17:39:13,151 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][10], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][25], 27:5A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][75]][91:6A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][230], 92:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][575]] [2023-10-12 17:39:13,170 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][10], 7:4A:[109] L73-1-->L36: 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][30], 29:5A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][85]][109:6A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][250], 110:7A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][655]] [2023-10-12 17:39:13,200 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 4:3A:[125] L24-->thread1EXIT: Formula: (<= v_N_22 v_i_18) InVars {N=v_N_22, i=v_i_18} OutVars{N=v_N_22, i=v_i_18} AuxVars[] AssignedVars[][15], 8:4A:[109] L73-1-->L36: 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][35], 38:5A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][45]][139:6A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][120], 140:7A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][345]] [2023-10-12 17:39:13,374 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][10], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][25], 25:5A:[109] L73-1-->L36: 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], 79:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][205]][272:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][485], 273:8A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1025]] [2023-10-12 17:39:13,396 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][10], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][25], 25:5A:[109] L73-1-->L36: 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], 80:6A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][210]][277:7A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][515], 278:8A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][1095]] [2023-10-12 17:39:13,779 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 5:3A:[109] L73-1-->L36: 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], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][45], 42:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][115], 165:6A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][315]][514:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][820], 515:8A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1605]] [2023-10-12 17:39:13,819 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 5:3A:[109] L73-1-->L36: 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], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][45], 42:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][115], 167:6A:[97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[][325]][554:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][455], 557:8A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][855]] [2023-10-12 17:39:13,836 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 5:3A:[109] L73-1-->L36: 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], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][45], 42:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][115], 170:6A:[124] L49-1-->thread3EXIT: Formula: (and (<= v_N_16 v_i_10) (<= v_q1_back_20 v_q1_front_16)) InVars {q1_front=v_q1_front_16, N=v_N_16, i=v_i_10, q1_back=v_q1_back_20} OutVars{q1_front=v_q1_front_16, N=v_N_16, i=v_i_10, q1_back=v_q1_back_20} AuxVars[] AssignedVars[][330]][565:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][455], 567:8A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][855]] [2023-10-12 17:39:13,986 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 5:3A:[109] L73-1-->L36: 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], 24:4A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][60], 68:5A:[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][185], 204:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][372]][699:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][458], 700:8A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][858]] [2023-10-12 17:39:13,994 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][0], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 5:3A:[109] L73-1-->L36: 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], 24:4A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][60], 68:5A:[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][185], 204:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][372]][706:7A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][833], 707:8A:[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front][1653]] [2023-10-12 17:39:13,995 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:13,995 INFO L124 PetriNetUnfolderBase]: 499/706 cut-off events. [2023-10-12 17:39:13,995 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2023-10-12 17:39:13,995 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:13,995 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [109] L73-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 95#[L36, L74, L24]true [112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 136#[L75, L36, L24, L49-1]true [115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 248#[L36, L24, L76, L61-1, L49-1]true [121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back] 269#[L37-1, L24, L76, L61-1, L49-1]true [2023-10-12 17:39:13,995 INFO L750 eck$LassoCheckResult]: Loop: 269#[L37-1, L24, L76, L61-1, L49-1]true [101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 272#[L37-1, L61, L24, L76, L49-1]true [103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front] 269#[L37-1, L24, L76, L61-1, L49-1]true [2023-10-12 17:39:13,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash -987250621, now seen corresponding path program 2 times [2023-10-12 17:39:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:13,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134021230] [2023-10-12 17:39:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:14,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:14,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:14,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:14,006 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 3 times [2023-10-12 17:39:14,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:14,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085864257] [2023-10-12 17:39:14,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:14,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:14,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:14,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:14,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:14,016 INFO L85 PathProgramCache]: Analyzing trace with hash 439928869, now seen corresponding path program 2 times [2023-10-12 17:39:14,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:14,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746393368] [2023-10-12 17:39:14,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:14,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:14,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:14,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:14,206 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:14,207 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:14,207 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:14,207 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:14,207 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:14,207 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:14,207 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:14,207 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:14,207 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:39:14,207 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:14,207 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:14,211 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:39:14,214 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:39:14,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:39:14,219 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:39:14,239 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:39:14,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:39:14,244 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:39:14,247 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:39:14,249 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:39:14,252 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:39:14,254 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:39:14,257 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:39:14,259 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:39:14,261 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:39:14,264 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:39:14,401 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:14,401 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:14,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:14,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:14,409 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:39:14,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:14,472 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:39:14,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:14,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:14,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:14,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:14,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:14,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:14,488 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:39:14,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:14,505 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:39:14,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:14,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:14,508 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:39:14,509 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:39:14,511 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:39:14,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:14,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:14,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:14,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:14,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:14,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:14,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:14,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:14,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:14,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:14,533 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:39:14,534 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:39:14,537 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:39:14,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:14,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:14,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:14,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:14,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:14,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:14,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:14,549 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:39:14,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:14,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:14,553 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:39:14,558 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:39:14,559 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:39:14,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:14,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:14,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:14,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:14,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:14,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:14,583 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:14,588 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:39:14,588 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:39:14,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:14,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:14,593 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:39:14,596 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:39:14,597 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:14,604 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:14,604 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:14,604 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:39:14,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-10-12 17:39:14,607 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:39:14,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:14,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:14,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:14,647 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:14,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:14,649 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:39:14,649 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:39:14,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:39:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:39:14,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:39:14,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:14,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:39:14,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:14,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:39:14,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:14,932 INFO L430 stractBuchiCegarLoop]: Abstraction has has 62 places, 37725 transitions, 701775 flow [2023-10-12 17:39:14,932 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:39:14,932 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 62 places, 37725 transitions, 701775 flow [2023-10-12 17:39:16,057 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:39:16,178 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][3], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][28], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][53], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][128], 25:5A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][378]][89:6A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][1153], 90:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][2878]] [2023-10-12 17:39:17,390 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][3], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][28], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][53], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][128], 23:5A:[109] L73-1-->L36: 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], 80:6A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][1053]][287:7A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][2578], 288:8A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][5478]] [2023-10-12 17:39:19,296 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][3], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][28], 5:3A:[109] L73-1-->L36: 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][103], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][228], 41:5A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][602], 173:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1729]][630:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][601], 631:8A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1726]] [2023-10-12 17:39:20,082 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][3], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][28], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][53], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][128], 23:5A:[109] L73-1-->L36: 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], 78:6A:[120] L36-->thread2EXIT: Formula: (<= v_N_10 v_j_8) InVars {N=v_N_10, j=v_j_8} OutVars{N=v_N_10, j=v_j_8} AuxVars[] AssignedVars[][1003], 277:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][2378]][802:8A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][2578], 803:9A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][5478]] [2023-10-12 17:39:20,528 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][3], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][28], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][53], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][128], 23:5A:[109] L73-1-->L36: 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], 79:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1028], 282:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][2502]][862:8A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][5429], 863:9A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][10629]] [2023-10-12 17:39:20,838 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:20,838 INFO L124 PetriNetUnfolderBase]: 637/917 cut-off events. [2023-10-12 17:39:20,839 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-10-12 17:39:20,839 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:20,839 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back] 55#[L73-1, L25-1]true [90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i] 52#[L73-1, L24]true [109] L73-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 95#[L36, L74, L24]true [112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 136#[L75, L36, L24, L49-1]true [97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 139#[L49, L75, L36, L24]true [126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back] 159#[L49, L75, L36, L25-1]true [99] L49-->L49-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (+ (select v_q1_7 v_q1_front_11) v_total_16) v_total_15) (< v_q1_front_11 v_q1_back_14)) InVars {q1_front=v_q1_front_11, q1=v_q1_7, total=v_total_16, q1_back=v_q1_back_14} OutVars{q1_front=v_q1_front_10, q1=v_q1_7, total=v_total_15, q1_back=v_q1_back_14} AuxVars[] AssignedVars[q1_front, total] 156#[L75, L36, L25-1, L49-1]true [2023-10-12 17:39:20,839 INFO L750 eck$LassoCheckResult]: Loop: 156#[L75, L36, L25-1, L49-1]true [97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 159#[L49, L75, L36, L25-1]true [99] L49-->L49-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (+ (select v_q1_7 v_q1_front_11) v_total_16) v_total_15) (< v_q1_front_11 v_q1_back_14)) InVars {q1_front=v_q1_front_11, q1=v_q1_7, total=v_total_16, q1_back=v_q1_back_14} OutVars{q1_front=v_q1_front_10, q1=v_q1_7, total=v_total_15, q1_back=v_q1_back_14} AuxVars[] AssignedVars[q1_front, total] 156#[L75, L36, L25-1, L49-1]true [2023-10-12 17:39:20,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:20,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1975067155, now seen corresponding path program 1 times [2023-10-12 17:39:20,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:20,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046307895] [2023-10-12 17:39:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:20,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:20,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:20,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:20,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:20,850 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 4 times [2023-10-12 17:39:20,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:20,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466894740] [2023-10-12 17:39:20,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:20,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:20,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:20,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:20,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:20,854 INFO L85 PathProgramCache]: Analyzing trace with hash 336011983, now seen corresponding path program 2 times [2023-10-12 17:39:20,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:20,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831984895] [2023-10-12 17:39:20,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:20,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:20,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:21,065 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:21,066 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:21,066 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:21,066 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:21,066 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:21,066 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:21,066 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:21,066 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:21,066 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration9_Lasso [2023-10-12 17:39:21,066 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:21,067 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:21,070 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:39:21,074 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:39:21,133 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:39:21,136 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:39:21,138 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:39:21,141 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:39:21,146 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:39:21,148 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:39:21,151 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:39:21,156 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:39:21,158 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:39:21,299 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:21,300 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:21,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:21,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:21,302 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:39:21,310 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:39:21,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:21,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:21,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:21,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:21,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:21,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:21,321 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:39:21,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:21,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:21,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:21,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:21,338 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:39:21,345 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:39:21,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:21,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:21,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:21,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:21,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:21,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:21,363 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:39:21,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:21,374 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:39:21,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:21,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:21,375 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:39:21,376 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:39:21,378 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:39:21,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:21,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:21,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:21,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:21,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:21,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:21,390 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:21,401 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:39:21,402 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:39:21,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:21,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:21,403 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:39:21,404 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:39:21,408 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:21,423 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:21,424 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:21,424 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:39:21,428 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:39:21,431 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:39:21,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:21,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:21,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:21,465 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:21,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:21,467 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:39:21,468 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:39:23,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:39:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:39:23,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:39:23,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:23,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:39:23,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:23,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 9 letters. Loop has 4 letters. [2023-10-12 17:39:23,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:23,724 INFO L430 stractBuchiCegarLoop]: Abstraction has has 67 places, 188625 transitions, 3886125 flow [2023-10-12 17:39:23,724 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:39:23,725 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 67 places, 188625 transitions, 3886125 flow [2023-10-12 17:39:24,513 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:39:30,449 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][265], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][640], 25:5A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][1890]][89:6A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][5765], 90:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][14390]] [2023-10-12 17:39:40,511 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][265], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][640], 23:5A:[109] L73-1-->L36: 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][1640], 80:6A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][5265]][287:7A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][12890], 288:8A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][27390]] [2023-10-12 17:39:56,562 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 5:3A:[109] L73-1-->L36: 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][515], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1140], 41:5A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][3010], 173:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][8645]][629:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][3005], 630:8A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][8630]] [2023-10-12 17:40:03,555 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][265], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][640], 23:5A:[109] L73-1-->L36: 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][1640], 78:6A:[120] L36-->thread2EXIT: Formula: (<= v_N_10 v_j_8) InVars {N=v_N_10, j=v_j_8} OutVars{N=v_N_10, j=v_j_8} AuxVars[] AssignedVars[][5015], 277:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][11890]][799:8A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][12890], 800:9A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][27390]] [2023-10-12 17:40:07,401 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][265], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][640], 23:5A:[109] L73-1-->L36: 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][1640], 79:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][5140], 282:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][12510]][859:8A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][27145], 860:9A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][53145]] [2023-10-12 17:40:10,953 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][265], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][640], 23:5A:[109] L73-1-->L36: 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][1640], 84:6A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][5515], 322:7A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][14015]][930:8A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][31265], 931:9A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][60140]] [2023-10-12 17:40:18,680 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][265], 7:4A:[109] L73-1-->L36: 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][765], 27:5A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][2140], 107:6A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][6260], 355:7A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][16395]][1111:8A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][6255], 1112:9A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][16380]] [2023-10-12 17:40:28,203 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 4:3A:[125] L24-->thread1EXIT: Formula: (<= v_N_22 v_i_18) InVars {N=v_N_22, i=v_i_18} OutVars{N=v_N_22, i=v_i_18} AuxVars[] AssignedVars[][390], 8:4A:[109] L73-1-->L36: 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][890], 36:5A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1140], 134:6A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][3010], 437:7A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][8645]][1315:8A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][3005], 1316:9A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][8630]] [2023-10-12 17:40:42,486 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 5:3A:[109] L73-1-->L36: 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][515], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1140], 40:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2885], 163:6A:[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][8020], 558:7A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][20820]][1619:8A:[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front][41370], 1622:9A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][20810]] [2023-10-12 17:41:00,491 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][265], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][640], 23:5A:[109] L73-1-->L36: 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][1640], 78:6A:[120] L36-->thread2EXIT: Formula: (<= v_N_10 v_j_8) InVars {N=v_N_10, j=v_j_8} OutVars{N=v_N_10, j=v_j_8} AuxVars[] AssignedVars[][5015], 278:7A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][12015], 812:8A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][14015]][2059:9A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][31265], 2060:10A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][60140]] [2023-10-12 17:41:02,023 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][265], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][640], 23:5A:[109] L73-1-->L36: 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][1640], 79:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][5140], 279:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][12135], 817:8A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][25645]][2098:9A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][12130], 2099:10A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][25630]] [2023-10-12 17:41:03,248 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][265], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][640], 23:5A:[109] L73-1-->L36: 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][1640], 79:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][5140], 279:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][12135], 818:8A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][25770]][2106:9A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][48145], 2107:10A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][78770]] [2023-10-12 17:41:08,730 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][265], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][640], 23:5A:[109] L73-1-->L36: 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][1640], 79:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][5140], 280:7A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][12260], 844:8A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][26770]][2232:9A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][51520], 2233:10A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][87270]] [2023-10-12 17:41:16,065 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][265], 6:4A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][640], 23:5A:[109] L73-1-->L36: 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][1640], 84:6A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][5515], 309:7A:[97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[][13640], 912:8A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][28765]][2396:9A:[90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i][31265], 2397:10A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][60140]] [2023-10-12 17:41:29,716 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 3:3A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][265], 7:4A:[109] L73-1-->L36: 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][765], 27:5A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][2140], 106:6A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][6135], 343:7A:[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][15645], 1049:8A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][32945]][2691:9A:[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front][61995], 2692:10A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][32935]] [2023-10-12 17:41:48,922 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 4:3A:[125] L24-->thread1EXIT: Formula: (<= v_N_22 v_i_18) InVars {N=v_N_22, i=v_i_18} OutVars{N=v_N_22, i=v_i_18} AuxVars[] AssignedVars[][390], 8:4A:[109] L73-1-->L36: 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][890], 36:5A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1140], 133:6A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2885], 432:7A:[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][8020], 1269:8A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][20820]][3119:9A:[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front][41370], 3123:10A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][20810]] [2023-10-12 17:42:02,501 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 5:3A:[109] L73-1-->L36: 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][515], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1140], 41:5A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][3010], 173:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][8645], 524:7A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2880], 1443:8A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][7880]][3375:9A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][20505], 3376:10A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][40130]] [2023-10-12 17:42:04,004 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 5:3A:[109] L73-1-->L36: 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][515], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1140], 41:5A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][3010], 173:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][8645], 524:7A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2880], 1445:8A:[97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[][8130]][3415:9A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][11380], 3416:10A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][21380]] [2023-10-12 17:42:04,470 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 5:3A:[109] L73-1-->L36: 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][515], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1140], 41:5A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][3010], 173:6A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][8645], 524:7A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2880], 1448:8A:[124] L49-1-->thread3EXIT: Formula: (and (<= v_N_16 v_i_10) (<= v_q1_back_20 v_q1_front_16)) InVars {q1_front=v_q1_front_16, N=v_N_16, i=v_i_10, q1_back=v_q1_back_20} OutVars{q1_front=v_q1_front_16, N=v_N_16, i=v_i_10, q1_back=v_q1_back_20} AuxVars[] AssignedVars[][8255]][3426:9A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][11380], 3427:10A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][21380]] [2023-10-12 17:42:15,718 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 5:3A:[109] L73-1-->L36: 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][515], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1140], 40:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2885], 162:6A:[126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back][7895], 530:7A:[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][20395], 1498:8A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][39445]][3693:9A:[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front][74120], 3697:10A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][39435]] [2023-10-12 17:42:17,681 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 5:3A:[109] L73-1-->L36: 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][515], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1140], 40:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2885], 163:6A:[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][8020], 533:7A:[97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[][10945], 1540:8A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][20870]][3747:9A:[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front][41370], 3748:10A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][20810]] [2023-10-12 17:42:19,777 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 5:3A:[109] L73-1-->L36: 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][515], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1140], 40:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2885], 163:6A:[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][8020], 536:7A:[124] L49-1-->thread3EXIT: Formula: (and (<= v_N_16 v_i_10) (<= v_q1_back_20 v_q1_front_16)) InVars {q1_front=v_q1_front_16, N=v_N_16, i=v_i_10, q1_back=v_q1_back_20} OutVars{q1_front=v_q1_front_16, N=v_N_16, i=v_i_10, q1_back=v_q1_back_20} AuxVars[] AssignedVars[][11070], 1549:8A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][20870]][3788:9A:[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front][41370], 3789:10A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][20810]] [2023-10-12 17:42:19,927 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 5:3A:[109] L73-1-->L36: 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][515], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1140], 40:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2885], 163:6A:[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][8020], 552:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][11445], 1571:8A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][21495]][3794:9A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][11455], 3795:10A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][21455]] [2023-10-12 17:42:20,217 ERROR L47 etriNetUnfolderRabin]: [1:1A:[81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[][15], 2:2A:[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][140], 5:3A:[109] L73-1-->L36: 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][515], 12:4A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][1140], 40:5A:[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][2885], 163:6A:[115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2][8020], 552:7A:[95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j][11445], 1571:8A:[121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back][21495]][3801:9A:[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[][20830], 3806:10A:[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front][41330]] [2023-10-12 17:42:20,218 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:20,218 INFO L124 PetriNetUnfolderBase]: 2786/3805 cut-off events. [2023-10-12 17:42:20,218 INFO L125 PetriNetUnfolderBase]: For 640/640 co-relation queries the response was YES. [2023-10-12 17:42:20,218 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:20,219 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]true [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]true [109] L73-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 95#[L36, L74, L24]true [121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back] 98#[L74, L37-1, L24]true [112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 267#[L75, L37-1, L24, L49-1]true [115] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 269#[L37-1, L24, L76, L61-1, L49-1]true [95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j] 248#[L36, L24, L76, L61-1, L49-1]true [121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back] 269#[L37-1, L24, L76, L61-1, L49-1]true [2023-10-12 17:42:20,219 INFO L750 eck$LassoCheckResult]: Loop: 269#[L37-1, L24, L76, L61-1, L49-1]true [101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 272#[L37-1, L61, L24, L76, L49-1]true [103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front] 269#[L37-1, L24, L76, L61-1, L49-1]true [2023-10-12 17:42:20,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:20,219 INFO L85 PathProgramCache]: Analyzing trace with hash 448145251, now seen corresponding path program 1 times [2023-10-12 17:42:20,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:20,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840842626] [2023-10-12 17:42:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:20,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:20,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:20,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:20,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:20,227 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 4 times [2023-10-12 17:42:20,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:20,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935706486] [2023-10-12 17:42:20,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:20,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:20,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:20,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:20,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:20,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1170859845, now seen corresponding path program 1 times [2023-10-12 17:42:20,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:20,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974528273] [2023-10-12 17:42:20,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:20,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:20,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:20,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:20,438 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:20,439 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:20,439 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:20,439 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:20,439 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:20,439 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,439 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:20,439 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:20,439 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration10_Lasso [2023-10-12 17:42:20,439 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:20,439 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:20,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:42:20,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:42:20,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:42:20,451 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:42:20,453 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:42:20,454 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:42:20,456 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:42:20,458 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:42:20,485 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:20,487 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:42:20,489 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:42:20,491 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:42:20,493 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:42:20,495 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:42:20,497 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:42:20,620 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:20,621 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:20,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:20,623 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:42:20,624 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:42:20,630 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:42:20,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:20,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:20,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:20,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:20,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:20,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:20,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:20,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:20,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:20,646 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:42:20,647 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:42:20,649 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:42:20,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:20,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:20,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:20,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:20,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:20,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:20,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:20,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:20,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:20,666 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:42:20,668 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:42:20,669 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:42:20,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:20,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:20,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:20,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:20,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:20,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:20,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:20,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2023-10-12 17:42:20,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:20,683 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:42:20,689 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:42:20,690 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:42:20,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:20,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:20,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:20,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:20,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:20,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:20,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:20,705 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:42:20,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:20,706 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:42:20,707 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:42:20,709 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:42:20,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:20,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:20,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:20,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:20,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:20,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:20,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:20,726 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:42:20,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:20,727 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:42:20,732 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:42:20,733 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:42:20,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:20,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:20,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:20,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:20,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:20,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:20,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:20,766 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:42:20,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:20,767 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:42:20,777 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:42:20,777 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:42:20,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:20,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:20,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:20,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:20,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:20,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:20,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:20,793 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:42:20,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:20,794 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:42:20,795 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:42:20,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:42:20,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:20,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:20,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:20,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:20,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:20,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:20,839 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:20,845 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:42:20,846 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:42:20,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:20,847 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:42:20,849 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:42:20,849 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:20,856 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:20,856 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:20,856 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:42:20,860 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:42:20,861 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:42:20,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:20,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:20,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:20,907 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:20,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:20,910 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:42:20,910 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:42:21,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:33,422 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:42:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:42:33,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:42:33,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:33,425 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:42:33,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:33,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:33,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:33,465 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:33,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:33,467 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:42:33,468 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:42:45,500 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:42:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2023-10-12 17:42:45,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 188 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:42:45,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:45,502 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:42:45,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:45,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:45,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:45,534 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:45,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:45,536 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:42:45,537 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:42:45,538 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:45,683 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 366 transitions. [2023-10-12 17:42:45,684 INFO L79 BuchiIntersect]: Starting Intersection Received shutdown request... [2023-10-12 17:42:55,111 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:42:55,123 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:42:56,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:56,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown