/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/prod-cons3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:42:09,730 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:42:09,761 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:42:09,779 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:42:09,780 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:42:09,780 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:42:09,785 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:42:09,786 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:42:09,786 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:42:09,789 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:42:09,789 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:42:09,789 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:42:09,789 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:42:09,790 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:42:09,791 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:42:09,791 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:42:09,791 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:42:09,791 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:42:09,791 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:42:09,791 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:42:09,792 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:42:09,793 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:42:09,793 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:42:09,793 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:42:09,793 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:42:09,793 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:42:09,793 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:42:09,793 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:42:09,794 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:42:09,794 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:42:09,794 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:42:09,795 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:42:09,795 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:42:09,796 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:42:09,796 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:42:09,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:42:09,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:42:09,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:42:09,990 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:42:09,990 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:42:09,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl [2023-10-12 17:42:09,991 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl' [2023-10-12 17:42:10,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:42:10,010 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:42:10,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:10,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:42:10,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:42:10,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:10" (1/1) ... [2023-10-12 17:42:10,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:10" (1/1) ... [2023-10-12 17:42:10,028 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:42:10,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:10,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:42:10,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:42:10,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:42:10,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:10" (1/1) ... [2023-10-12 17:42:10,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:10" (1/1) ... [2023-10-12 17:42:10,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:10" (1/1) ... [2023-10-12 17:42:10,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:10" (1/1) ... [2023-10-12 17:42:10,038 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:10" (1/1) ... [2023-10-12 17:42:10,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:10" (1/1) ... [2023-10-12 17:42:10,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:10" (1/1) ... [2023-10-12 17:42:10,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:10" (1/1) ... [2023-10-12 17:42:10,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:42:10,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:42:10,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:42:10,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:42:10,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:10" (1/1) ... [2023-10-12 17:42:10,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:10,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:10,064 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:42:10,083 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:42:10,107 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:42:10,108 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:42:10,110 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:42:10,110 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:42:10,111 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:42:10,111 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:42:10,111 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:42:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:42:10,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:42:10,112 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:42:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:42:10,112 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:42:10,113 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:42:10,113 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:42:10,113 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:42:10,114 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:42:10,151 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:42:10,153 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:42:10,251 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:42:10,277 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:42:10,278 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:42:10,281 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:10 BoogieIcfgContainer [2023-10-12 17:42:10,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:42:10,282 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:42:10,282 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:42:10,286 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:42:10,287 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:10,287 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:10" (1/2) ... [2023-10-12 17:42:10,289 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@503cbc19 and model type prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:42:10, skipping insertion in model container [2023-10-12 17:42:10,289 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:10,289 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:10" (2/2) ... [2023-10-12 17:42:10,290 INFO L332 chiAutomizerObserver]: Analyzing ICFG prod-cons3.wvr.bpl [2023-10-12 17:42:10,360 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:42:10,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 120 flow [2023-10-12 17:42:10,416 INFO L124 PetriNetUnfolderBase]: 3/36 cut-off events. [2023-10-12 17:42:10,417 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:42:10,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 3/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2023-10-12 17:42:10,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 44 transitions, 120 flow [2023-10-12 17:42:10,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 96 flow [2023-10-12 17:42:10,426 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:42:10,437 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 36 transitions, 96 flow [2023-10-12 17:42:10,438 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 36 transitions, 96 flow [2023-10-12 17:42:10,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 96 flow [2023-10-12 17:42:10,445 INFO L124 PetriNetUnfolderBase]: 3/36 cut-off events. [2023-10-12 17:42:10,445 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:42:10,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 3/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2023-10-12 17:42:10,446 INFO L119 LiptonReduction]: Number of co-enabled transitions 342 [2023-10-12 17:42:10,789 INFO L134 LiptonReduction]: Checked pairs total: 542 [2023-10-12 17:42:10,789 INFO L136 LiptonReduction]: Total number of compositions: 17 [2023-10-12 17:42:10,797 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:42:10,797 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:42:10,797 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:42:10,798 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:42:10,798 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:42:10,798 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:42:10,798 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:42:10,798 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:42:10,798 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 30 places, 20 transitions, 64 flow [2023-10-12 17:42:10,800 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][19], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][17]] [2023-10-12 17:42:10,802 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:10,802 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:42:10,802 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:10,802 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:10,804 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:42:10,804 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 30 places, 20 transitions, 64 flow [2023-10-12 17:42:10,804 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][19], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][17]] [2023-10-12 17:42:10,805 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:10,805 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:42:10,805 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:10,805 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:10,808 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [2023-10-12 17:42:10,808 INFO L750 eck$LassoCheckResult]: Loop: 58#[L26, L80-1]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 58#[L26, L80-1]true [2023-10-12 17:42:10,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:10,811 INFO L85 PathProgramCache]: Analyzing trace with hash 5507, now seen corresponding path program 1 times [2023-10-12 17:42:10,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:10,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786233730] [2023-10-12 17:42:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:10,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:10,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:10,935 INFO L85 PathProgramCache]: Analyzing trace with hash 173, now seen corresponding path program 1 times [2023-10-12 17:42:10,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:10,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137384153] [2023-10-12 17:42:10,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:10,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:10,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash 170859, now seen corresponding path program 1 times [2023-10-12 17:42:10,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:10,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9783526] [2023-10-12 17:42:10,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:10,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:11,030 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:11,031 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:11,031 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:11,031 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:11,031 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:11,031 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,031 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:11,031 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:11,031 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:42:11,031 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:11,031 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:11,041 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:11,048 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:11,055 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:11,057 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:11,065 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:11,068 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:11,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:42:11,150 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:11,153 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:11,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,171 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:42:11,172 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:42:11,173 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:11,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:11,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:11,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:11,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:11,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:11,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:11,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:11,226 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:42:11,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,241 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:42:11,243 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:42:11,245 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:11,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:11,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:11,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:11,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:11,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:11,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:11,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:11,289 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:42:11,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,291 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:42:11,316 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:42:11,317 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:11,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:11,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:11,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:11,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:11,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:11,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:11,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:11,355 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:42:11,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,366 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:42:11,368 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:42:11,369 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:11,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:11,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:11,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:11,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:11,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:11,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:11,409 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:11,439 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:42:11,439 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:42:11,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,444 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:42:11,452 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:11,461 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:42:11,470 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:11,471 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:11,471 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(w) = 1*w Supporting invariants [] [2023-10-12 17:42:11,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:11,479 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:11,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:11,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:11,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:11,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:11,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:11,525 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:11,559 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:11,651 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:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2023-10-12 17:42:11,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 244 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:42:11,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:11,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 244 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:42:11,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:11,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 244 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:42:11,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:11,663 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 80 transitions, 416 flow [2023-10-12 17:42:11,663 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:42:11,663 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 80 transitions, 416 flow [2023-10-12 17:42:11,667 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][76], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][12], 4:3A:[116] L80-1-->L38: 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][17]][8:4A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][34], 10:5A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][66]] [2023-10-12 17:42:11,668 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:11,668 INFO L124 PetriNetUnfolderBase]: 3/9 cut-off events. [2023-10-12 17:42:11,668 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:42:11,668 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:11,668 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [116] L80-1-->L38: 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] 93#[L26, L81, L38]true [2023-10-12 17:42:11,668 INFO L750 eck$LassoCheckResult]: Loop: 93#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 96#[L39, L26, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 93#[L26, L81, L38]true [2023-10-12 17:42:11,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash 170833, now seen corresponding path program 1 times [2023-10-12 17:42:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:11,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042397855] [2023-10-12 17:42:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:11,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:11,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:11,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:11,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 1 times [2023-10-12 17:42:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:11,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694110097] [2023-10-12 17:42:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:11,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:11,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:11,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:11,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:11,711 INFO L85 PathProgramCache]: Analyzing trace with hash 164173722, now seen corresponding path program 1 times [2023-10-12 17:42:11,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:11,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387507257] [2023-10-12 17:42:11,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:11,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:11,774 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:11,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:42:11,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387507257] [2023-10-12 17:42:11,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387507257] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:42:11,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:42:11,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:42:11,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343263053] [2023-10-12 17:42:11,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:42:11,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:42:11,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:42:11,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:42:11,818 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 34 places, 80 transitions, 416 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:11,818 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:42:11,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:42:11,950 INFO L124 PetriNetUnfolderBase]: 509/720 cut-off events. [2023-10-12 17:42:11,950 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2023-10-12 17:42:11,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 720 events. 509/720 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2321 event pairs, 130 based on Foata normal form. 26/531 useless extension candidates. Maximal degree in co-relation 2149. Up to 626 conditions per place. [2023-10-12 17:42:11,961 INFO L140 encePairwiseOnDemand]: 57/61 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-10-12 17:42:11,961 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 34 places, 50 transitions, 357 flow [2023-10-12 17:42:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:42:11,962 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 50 transitions, 357 flow [2023-10-12 17:42:11,962 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:42:11,962 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 50 transitions, 357 flow [2023-10-12 17:42:11,967 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][0], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[116] L80-1-->L38: 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:[119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][5]][38:5A:[105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[][15], 43:6A:[136] L56-->L55: Formula: (and (< v_front2_19 v_back2_20) (= (+ v_front2_19 1) v_front2_18) (= v_temp2_9 (select v_queue2_13 v_front2_19)) (= v_d2_17 (+ v_temp2_9 v_d2_18))) InVars {d2=v_d2_18, back2=v_back2_20, front2=v_front2_19, queue2=v_queue2_13} OutVars{d2=v_d2_17, back2=v_back2_20, temp2=v_temp2_9, front2=v_front2_18, queue2=v_queue2_13} AuxVars[] AssignedVars[d2, temp2, front2][30]] [2023-10-12 17:42:11,967 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:11,967 INFO L124 PetriNetUnfolderBase]: 24/42 cut-off events. [2023-10-12 17:42:11,968 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:42:11,968 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:11,969 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [116] L80-1-->L38: 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] 93#[L26, L81, L38]true [119] L81-->L55: 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] 111#[L26, L82, L38, L55]true [2023-10-12 17:42:11,969 INFO L750 eck$LassoCheckResult]: Loop: 111#[L26, L82, L38, L55]true [105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[] 114#[L26, L38, L82, L56]true [136] L56-->L55: Formula: (and (< v_front2_19 v_back2_20) (= (+ v_front2_19 1) v_front2_18) (= v_temp2_9 (select v_queue2_13 v_front2_19)) (= v_d2_17 (+ v_temp2_9 v_d2_18))) InVars {d2=v_d2_18, back2=v_back2_20, front2=v_front2_19, queue2=v_queue2_13} OutVars{d2=v_d2_17, back2=v_back2_20, temp2=v_temp2_9, front2=v_front2_18, queue2=v_queue2_13} AuxVars[] AssignedVars[d2, temp2, front2] 111#[L26, L82, L38, L55]true [2023-10-12 17:42:11,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash 5295942, now seen corresponding path program 1 times [2023-10-12 17:42:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:11,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424457444] [2023-10-12 17:42:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:11,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:11,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:11,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash 4352, now seen corresponding path program 1 times [2023-10-12 17:42:11,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:11,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22934825] [2023-10-12 17:42:11,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:11,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:12,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash 794436357, now seen corresponding path program 1 times [2023-10-12 17:42:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:12,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261155120] [2023-10-12 17:42:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:12,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:12,043 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:42:12,074 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:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:42:12,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261155120] [2023-10-12 17:42:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261155120] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:42:12,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:42:12,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:42:12,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650330002] [2023-10-12 17:42:12,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:42:12,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:42:12,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:42:12,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:42:12,105 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 34 places, 50 transitions, 357 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:42:12,105 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:42:12,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:42:12,194 INFO L124 PetriNetUnfolderBase]: 767/1096 cut-off events. [2023-10-12 17:42:12,195 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2023-10-12 17:42:12,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4675 conditions, 1096 events. 767/1096 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3933 event pairs, 130 based on Foata normal form. 61/811 useless extension candidates. Maximal degree in co-relation 4344. Up to 942 conditions per place. [2023-10-12 17:42:12,203 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 71 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-10-12 17:42:12,204 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 36 places, 74 transitions, 673 flow [2023-10-12 17:42:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:42:12,205 INFO L430 stractBuchiCegarLoop]: Abstraction has has 36 places, 74 transitions, 673 flow [2023-10-12 17:42:12,205 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:42:12,205 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 36 places, 74 transitions, 673 flow [2023-10-12 17:42:12,220 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][0], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[116] L80-1-->L38: 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:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][5], 28:5A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][8], 91:6A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][26]][227:7A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][35], 228:8A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][46]] [2023-10-12 17:42:12,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:12,220 INFO L124 PetriNetUnfolderBase]: 159/227 cut-off events. [2023-10-12 17:42:12,220 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-10-12 17:42:12,220 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:12,221 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [116] L80-1-->L38: 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] 93#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 96#[L39, L26, L81]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 96#[L39, L26, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 93#[L26, L81, L38]true [2023-10-12 17:42:12,221 INFO L750 eck$LassoCheckResult]: Loop: 93#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 96#[L39, L26, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 93#[L26, L81, L38]true [2023-10-12 17:42:12,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:12,221 INFO L85 PathProgramCache]: Analyzing trace with hash 794418288, now seen corresponding path program 1 times [2023-10-12 17:42:12,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:12,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830982027] [2023-10-12 17:42:12,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:12,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:12,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:12,234 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 2 times [2023-10-12 17:42:12,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:12,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990157419] [2023-10-12 17:42:12,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:12,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:12,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1068200711, now seen corresponding path program 2 times [2023-10-12 17:42:12,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:12,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232167431] [2023-10-12 17:42:12,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:12,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:12,276 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:42:12,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:42:12,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232167431] [2023-10-12 17:42:12,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232167431] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:42:12,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023160378] [2023-10-12 17:42:12,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:42:12,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:42:12,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:12,278 INFO L229 MonitoredProcess]: Starting monitored process 7 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:42:12,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-10-12 17:42:12,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:42:12,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:42:12,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:12,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:12,426 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:42:12,426 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:42:12,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023160378] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:42:12,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:42:12,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:42:12,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144376748] [2023-10-12 17:42:12,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:42:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:42:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:42:12,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:42:12,464 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 36 places, 74 transitions, 673 flow. Second operand has 4 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:42:12,464 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:42:12,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:42:12,647 INFO L124 PetriNetUnfolderBase]: 1553/2207 cut-off events. [2023-10-12 17:42:12,648 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2023-10-12 17:42:12,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11602 conditions, 2207 events. 1553/2207 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8937 event pairs, 130 based on Foata normal form. 26/1544 useless extension candidates. Maximal degree in co-relation 10831. Up to 1986 conditions per place. [2023-10-12 17:42:12,663 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 131 selfloop transitions, 12 changer transitions 0/143 dead transitions. [2023-10-12 17:42:12,663 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 39 places, 143 transitions, 1583 flow [2023-10-12 17:42:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:42:12,665 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 143 transitions, 1583 flow [2023-10-12 17:42:12,665 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:42:12,665 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 143 transitions, 1583 flow [2023-10-12 17:42:12,697 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:12,698 INFO L124 PetriNetUnfolderBase]: 380/537 cut-off events. [2023-10-12 17:42:12,698 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2023-10-12 17:42:12,698 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:12,698 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [116] L80-1-->L38: 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] 93#[L26, L81, L38]true [119] L81-->L55: 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] 111#[L26, L82, L38, L55]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 171#[L39, L26, L82, L55]true [105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[] 173#[L39, L26, L82, L56]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 173#[L39, L26, L82, L56]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 114#[L26, L38, L82, L56]true [136] L56-->L55: Formula: (and (< v_front2_19 v_back2_20) (= (+ v_front2_19 1) v_front2_18) (= v_temp2_9 (select v_queue2_13 v_front2_19)) (= v_d2_17 (+ v_temp2_9 v_d2_18))) InVars {d2=v_d2_18, back2=v_back2_20, front2=v_front2_19, queue2=v_queue2_13} OutVars{d2=v_d2_17, back2=v_back2_20, temp2=v_temp2_9, front2=v_front2_18, queue2=v_queue2_13} AuxVars[] AssignedVars[d2, temp2, front2] 111#[L26, L82, L38, L55]true [2023-10-12 17:42:12,698 INFO L750 eck$LassoCheckResult]: Loop: 111#[L26, L82, L38, L55]true [105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[] 114#[L26, L38, L82, L56]true [136] L56-->L55: Formula: (and (< v_front2_19 v_back2_20) (= (+ v_front2_19 1) v_front2_18) (= v_temp2_9 (select v_queue2_13 v_front2_19)) (= v_d2_17 (+ v_temp2_9 v_d2_18))) InVars {d2=v_d2_18, back2=v_back2_20, front2=v_front2_19, queue2=v_queue2_13} OutVars{d2=v_d2_17, back2=v_back2_20, temp2=v_temp2_9, front2=v_front2_18, queue2=v_queue2_13} AuxVars[] AssignedVars[d2, temp2, front2] 111#[L26, L82, L38, L55]true [2023-10-12 17:42:12,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1777386718, now seen corresponding path program 1 times [2023-10-12 17:42:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:12,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800041230] [2023-10-12 17:42:12,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:12,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:12,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash 4352, now seen corresponding path program 2 times [2023-10-12 17:42:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:12,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626153494] [2023-10-12 17:42:12,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:12,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:12,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1328344419, now seen corresponding path program 2 times [2023-10-12 17:42:12,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:12,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347484924] [2023-10-12 17:42:12,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:12,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:12,785 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:42:12,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:42:12,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347484924] [2023-10-12 17:42:12,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347484924] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:42:12,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493831422] [2023-10-12 17:42:12,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:42:12,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:42:12,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:12,803 INFO L229 MonitoredProcess]: Starting monitored process 8 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:42:12,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-10-12 17:42:12,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:42:12,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:42:12,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:12,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:12,885 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:42:12,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:42:12,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493831422] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:42:12,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:42:12,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:42:12,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395966002] [2023-10-12 17:42:12,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:42:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:42:12,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:42:12,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:42:12,909 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 39 places, 143 transitions, 1583 flow. Second operand has 4 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:12,909 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:42:12,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:42:13,204 INFO L124 PetriNetUnfolderBase]: 3047/4324 cut-off events. [2023-10-12 17:42:13,204 INFO L125 PetriNetUnfolderBase]: For 984/984 co-relation queries the response was YES. [2023-10-12 17:42:13,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27008 conditions, 4324 events. 3047/4324 cut-off events. For 984/984 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 19340 event pairs, 130 based on Foata normal form. 96/3068 useless extension candidates. Maximal degree in co-relation 25360. Up to 4103 conditions per place. [2023-10-12 17:42:13,242 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 253 selfloop transitions, 18 changer transitions 0/271 dead transitions. [2023-10-12 17:42:13,242 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 42 places, 271 transitions, 3522 flow [2023-10-12 17:42:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:42:13,243 INFO L430 stractBuchiCegarLoop]: Abstraction has has 42 places, 271 transitions, 3522 flow [2023-10-12 17:42:13,243 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:42:13,243 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 42 places, 271 transitions, 3522 flow [2023-10-12 17:42:13,359 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][0], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[116] L80-1-->L38: 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], 11:4A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][8], 33:5A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][6], 155:6A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][13], 403:7A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][53], 713:8A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][72], 1097:9A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][94]][1515:10A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][127], 1517:11A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][173]] [2023-10-12 17:42:13,360 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:13,360 INFO L124 PetriNetUnfolderBase]: 1088/1516 cut-off events. [2023-10-12 17:42:13,360 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2023-10-12 17:42:13,360 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:13,360 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [116] L80-1-->L38: 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] 93#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 96#[L39, L26, L81]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 96#[L39, L26, L81]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 96#[L39, L26, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 93#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 96#[L39, L26, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 93#[L26, L81, L38]true [2023-10-12 17:42:13,360 INFO L750 eck$LassoCheckResult]: Loop: 93#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 96#[L39, L26, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 93#[L26, L81, L38]true [2023-10-12 17:42:13,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1245614179, now seen corresponding path program 3 times [2023-10-12 17:42:13,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:13,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571278726] [2023-10-12 17:42:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:13,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:13,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:13,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:13,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:13,373 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 3 times [2023-10-12 17:42:13,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:13,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051687459] [2023-10-12 17:42:13,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:13,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:13,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:13,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:13,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1260646356, now seen corresponding path program 4 times [2023-10-12 17:42:13,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:13,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51463021] [2023-10-12 17:42:13,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:13,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:42:13,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:42:13,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51463021] [2023-10-12 17:42:13,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51463021] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:42:13,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601894437] [2023-10-12 17:42:13,415 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-10-12 17:42:13,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:42:13,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:13,417 INFO L229 MonitoredProcess]: Starting monitored process 9 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:42:13,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-10-12 17:42:13,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-10-12 17:42:13,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:42:13,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:42:13,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:42:13,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:42:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:42:13,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601894437] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:42:13,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:42:13,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2023-10-12 17:42:13,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189483124] [2023-10-12 17:42:13,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:42:13,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:42:13,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-10-12 17:42:13,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-10-12 17:42:13,527 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 42 places, 271 transitions, 3522 flow. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:13,527 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:42:13,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:42:14,150 INFO L124 PetriNetUnfolderBase]: 5627/7961 cut-off events. [2023-10-12 17:42:14,150 INFO L125 PetriNetUnfolderBase]: For 1829/1829 co-relation queries the response was YES. [2023-10-12 17:42:14,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57644 conditions, 7961 events. 5627/7961 cut-off events. For 1829/1829 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 39048 event pairs, 130 based on Foata normal form. 74/5555 useless extension candidates. Maximal degree in co-relation 54240. Up to 7740 conditions per place. [2023-10-12 17:42:14,264 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 440 selfloop transitions, 53 changer transitions 0/493 dead transitions. [2023-10-12 17:42:14,264 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 46 places, 493 transitions, 7379 flow [2023-10-12 17:42:14,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:42:14,265 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 493 transitions, 7379 flow [2023-10-12 17:42:14,265 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:42:14,265 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 46 places, 493 transitions, 7379 flow [2023-10-12 17:42:14,450 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:14,450 INFO L124 PetriNetUnfolderBase]: 1504/2110 cut-off events. [2023-10-12 17:42:14,450 INFO L125 PetriNetUnfolderBase]: For 434/434 co-relation queries the response was YES. [2023-10-12 17:42:14,450 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:14,451 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [116] L80-1-->L38: 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] 93#[L26, L81, L38]true [119] L81-->L55: 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] 111#[L26, L82, L38, L55]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 171#[L39, L26, L82, L55]true [105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[] 173#[L39, L26, L82, L56]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 173#[L39, L26, L82, L56]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 173#[L39, L26, L82, L56]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 114#[L26, L38, L82, L56]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 173#[L39, L26, L82, L56]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 114#[L26, L38, L82, L56]true [136] L56-->L55: Formula: (and (< v_front2_19 v_back2_20) (= (+ v_front2_19 1) v_front2_18) (= v_temp2_9 (select v_queue2_13 v_front2_19)) (= v_d2_17 (+ v_temp2_9 v_d2_18))) InVars {d2=v_d2_18, back2=v_back2_20, front2=v_front2_19, queue2=v_queue2_13} OutVars{d2=v_d2_17, back2=v_back2_20, temp2=v_temp2_9, front2=v_front2_18, queue2=v_queue2_13} AuxVars[] AssignedVars[d2, temp2, front2] 111#[L26, L82, L38, L55]true [2023-10-12 17:42:14,451 INFO L750 eck$LassoCheckResult]: Loop: 111#[L26, L82, L38, L55]true [105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[] 114#[L26, L38, L82, L56]true [136] L56-->L55: Formula: (and (< v_front2_19 v_back2_20) (= (+ v_front2_19 1) v_front2_18) (= v_temp2_9 (select v_queue2_13 v_front2_19)) (= v_d2_17 (+ v_temp2_9 v_d2_18))) InVars {d2=v_d2_18, back2=v_back2_20, front2=v_front2_19, queue2=v_queue2_13} OutVars{d2=v_d2_17, back2=v_back2_20, temp2=v_temp2_9, front2=v_front2_18, queue2=v_queue2_13} AuxVars[] AssignedVars[d2, temp2, front2] 111#[L26, L82, L38, L55]true [2023-10-12 17:42:14,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1772956671, now seen corresponding path program 3 times [2023-10-12 17:42:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:14,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959264643] [2023-10-12 17:42:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:14,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:14,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:14,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash 4352, now seen corresponding path program 3 times [2023-10-12 17:42:14,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:14,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055301385] [2023-10-12 17:42:14,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:14,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:14,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:14,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:14,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1290652290, now seen corresponding path program 4 times [2023-10-12 17:42:14,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:14,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891393659] [2023-10-12 17:42:14,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:14,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:14,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:14,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:14,830 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:14,830 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:14,830 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:14,830 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:14,830 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:14,830 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:14,830 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:14,830 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:14,830 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:42:14,830 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:14,830 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:14,832 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:14,837 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:14,839 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:14,955 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:14,957 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:14,959 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:14,961 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:14,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:42:14,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:42:15,189 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:15,190 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:15,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:15,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:15,192 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:42:15,193 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:42:15,194 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:15,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:15,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:15,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:15,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:15,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:15,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:15,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:15,213 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:42:15,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:15,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:15,216 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:42:15,217 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:42:15,218 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:15,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:15,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:15,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:15,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:15,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:15,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:15,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:15,260 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:42:15,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:15,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:15,263 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:42:15,265 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:42:15,267 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:15,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:15,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:15,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:15,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:15,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:15,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:15,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:15,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:15,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:15,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:15,327 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:42:15,328 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:42:15,330 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:15,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:15,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:15,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:15,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:15,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:15,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:15,351 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:15,359 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:42:15,359 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:42:15,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:15,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:15,362 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:15,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:42:15,365 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:15,371 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:15,372 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:15,372 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back2, front2) = 1*back2 - 1*front2 Supporting invariants [] [2023-10-12 17:42:15,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:42:15,383 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2023-10-12 17:42:15,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:15,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:15,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:15,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:15,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:15,426 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:15,427 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:15,497 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:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2023-10-12 17:42:15,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:42:15,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:15,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 14 letters. Loop has 2 letters. [2023-10-12 17:42:15,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:15,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 12 letters. Loop has 4 letters. [2023-10-12 17:42:15,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:15,499 INFO L430 stractBuchiCegarLoop]: Abstraction has has 51 places, 2465 transitions, 41825 flow [2023-10-12 17:42:15,499 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:42:15,499 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 51 places, 2465 transitions, 41825 flow [2023-10-12 17:42:15,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-10-12 17:42:16,243 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][2], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][7], 3:3A:[116] L80-1-->L38: 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][12], 11:4A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][42], 32:5A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][32], 154:6A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][67], 407:7A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][137], 788:8A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][422], 1261:9A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][557], 1884:10A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][772]][2715:11A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][1122], 2716:12A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][1467]] [2023-10-12 17:42:16,244 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:16,244 INFO L124 PetriNetUnfolderBase]: 1958/2715 cut-off events. [2023-10-12 17:42:16,244 INFO L125 PetriNetUnfolderBase]: For 529/529 co-relation queries the response was YES. [2023-10-12 17:42:16,244 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:16,244 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [116] L80-1-->L38: 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] 93#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 96#[L39, L26, L81]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 96#[L39, L26, L81]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 96#[L39, L26, L81]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 96#[L39, L26, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 93#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 96#[L39, L26, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 93#[L26, L81, L38]true [2023-10-12 17:42:16,244 INFO L750 eck$LassoCheckResult]: Loop: 93#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 96#[L39, L26, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 93#[L26, L81, L38]true [2023-10-12 17:42:16,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash -40568263, now seen corresponding path program 5 times [2023-10-12 17:42:16,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:16,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590932362] [2023-10-12 17:42:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:16,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:16,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 4 times [2023-10-12 17:42:16,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:16,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165974731] [2023-10-12 17:42:16,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:16,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:16,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:16,262 INFO L85 PathProgramCache]: Analyzing trace with hash -331391870, now seen corresponding path program 6 times [2023-10-12 17:42:16,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:16,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988531416] [2023-10-12 17:42:16,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:16,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:16,551 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:16,551 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:16,552 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:16,552 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:16,552 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:16,552 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:16,552 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:16,552 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:16,552 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:42:16,552 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:16,552 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:16,553 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:16,667 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:16,672 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:16,674 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:16,676 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:16,678 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:16,680 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:16,863 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:16,863 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:16,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:16,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:16,871 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:42:16,873 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:42:16,875 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:16,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:16,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:16,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:16,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:16,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:16,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:16,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:16,902 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:42:16,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:16,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:16,904 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:16,906 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:42:16,907 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:16,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:16,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:16,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:16,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:16,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:16,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:16,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:16,925 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:42:16,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:16,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:16,927 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:42:16,930 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:42:16,932 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:16,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:16,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:16,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:16,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:16,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:16,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:16,946 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:16,951 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:42:16,951 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:42:16,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:16,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:16,952 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:42:16,955 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:42:16,956 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:16,977 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:16,977 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:16,977 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back1, front1) = 1*back1 - 1*front1 Supporting invariants [] [2023-10-12 17:42:16,981 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:42:16,986 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:42:16,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:17,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:17,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:17,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:17,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:17,026 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:17,026 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:17,169 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:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:17,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2023-10-12 17:42:17,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:42:17,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:17,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:42:17,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:17,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 10 letters. Loop has 4 letters. [2023-10-12 17:42:17,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:17,171 INFO L430 stractBuchiCegarLoop]: Abstraction has has 56 places, 12325 transitions, 233775 flow [2023-10-12 17:42:17,171 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:42:17,171 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 56 places, 12325 transitions, 233775 flow [2023-10-12 17:42:18,166 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:42:22,160 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][10], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][35], 3:3A:[116] L80-1-->L38: 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][60], 11:4A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][210], 32:5A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][160], 156:6A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][810], 411:7A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][1488], 830:8A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][1461], 1389:9A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][3064]][2094:10A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][4414], 3071:11A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][4489], 3073:12A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][7664]] [2023-10-12 17:42:22,175 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][10], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][35], 3:3A:[116] L80-1-->L38: 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][60], 11:4A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][210], 32:5A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][160], 156:6A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][810], 411:7A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][1488], 830:8A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][1461], 1389:9A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][3064]][2100:10A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][4489], 3082:11A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][5964], 3085:12A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][7764]] [2023-10-12 17:42:24,033 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][10], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][35], 3:3A:[116] L80-1-->L38: 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][60], 9:4A:[119] L81-->L55: 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][185], 58:5A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][210], 99:6A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][160], 276:7A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][810], 587:8A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][1488], 1111:9A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][1461], 1895:10A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][3064]][2929:11A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][4414], 4276:12A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][4489], 4280:13A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][7664]] [2023-10-12 17:42:24,052 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][10], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][35], 3:3A:[116] L80-1-->L38: 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][60], 9:4A:[119] L81-->L55: 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][185], 58:5A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][210], 99:6A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][160], 276:7A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][810], 587:8A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][1488], 1111:9A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][1461], 1895:10A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][3064]][2939:11A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][4489], 4293:12A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][5964], 4296:13A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][7764]] [2023-10-12 17:42:24,212 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][10], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][35], 3:3A:[116] L80-1-->L38: 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][60], 11:4A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][210], 32:5A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][160], 154:6A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][335], 401:7A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][685], 809:8A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][2110], 1339:9A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][2788], 2033:10A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][2861], 3017:11A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][5539]][4370:12A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][5614], 4374:13A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][7339]] [2023-10-12 17:42:24,213 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:24,213 INFO L124 PetriNetUnfolderBase]: 3194/4373 cut-off events. [2023-10-12 17:42:24,213 INFO L125 PetriNetUnfolderBase]: For 852/852 co-relation queries the response was YES. [2023-10-12 17:42:24,213 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:24,214 INFO L748 eck$LassoCheckResult]: Stem: 54#[$Ultimate##0]true [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]true [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L26, L80-1]true [116] L80-1-->L38: 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] 93#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 96#[L39, L26, L81]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 96#[L39, L26, L81]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 96#[L39, L26, L81]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 96#[L39, L26, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 93#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 96#[L39, L26, L81]true [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 96#[L39, L26, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 93#[L26, L81, L38]true [2023-10-12 17:42:24,214 INFO L750 eck$LassoCheckResult]: Loop: 93#[L26, L81, L38]true [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 96#[L39, L26, L81]true [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 93#[L26, L81, L38]true [2023-10-12 17:42:24,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:24,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1257615951, now seen corresponding path program 7 times [2023-10-12 17:42:24,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:24,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76651433] [2023-10-12 17:42:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:24,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:24,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:24,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:24,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 5 times [2023-10-12 17:42:24,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:24,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478661516] [2023-10-12 17:42:24,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:24,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:24,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:24,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:24,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:24,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1683115526, now seen corresponding path program 8 times [2023-10-12 17:42:24,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:24,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447200712] [2023-10-12 17:42:24,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:24,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:24,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:24,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:24,538 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:24,539 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:24,539 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:24,539 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:24,539 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:24,539 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:24,539 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:24,539 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:24,539 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration9_Lasso [2023-10-12 17:42:24,539 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:24,539 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:24,541 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:24,544 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:24,546 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:24,549 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:24,551 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:24,680 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:24,686 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:24,871 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:24,872 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:24,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:24,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:24,873 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:42:24,875 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:42:24,879 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:24,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:24,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:24,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:24,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:24,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:24,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:24,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:24,894 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:42:24,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:24,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:24,896 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:42:24,900 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:42:24,901 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:24,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:24,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:24,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:24,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:24,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:24,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:24,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:24,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-10-12 17:42:24,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:24,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:24,927 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:42:24,929 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:42:24,931 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:24,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:24,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:24,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:24,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:24,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:24,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:24,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:24,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-10-12 17:42:24,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:24,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:24,960 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:42:24,962 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:42:24,963 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:24,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:24,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:24,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:24,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:24,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:24,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:24,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:24,989 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:42:24,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:24,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:24,992 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:42:24,994 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:42:24,995 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:25,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:25,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:25,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:25,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:25,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:25,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:25,026 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:25,029 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:42:25,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:25,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:25,031 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:42:25,033 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:42:25,035 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:25,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:25,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:25,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:25,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:25,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:25,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:25,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:25,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-10-12 17:42:25,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:25,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:25,068 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:42:25,070 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:42:25,071 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:25,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:25,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:25,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:25,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:25,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:25,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:25,096 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:25,102 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:42:25,102 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:42:25,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:25,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:25,103 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:42:25,105 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:42:25,106 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:25,127 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:25,127 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:25,127 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back1, front1) = 1*back1 - 1*front1 Supporting invariants [] [2023-10-12 17:42:25,132 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:42:25,136 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:42:25,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:25,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:25,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:25,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:25,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:25,177 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:25,178 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:25,695 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:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2023-10-12 17:42:25,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:42:25,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:25,697 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:42:25,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:25,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:25,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:25,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:25,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:25,731 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:25,731 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:26,571 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:26,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2023-10-12 17:42:26,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 238 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:42:26,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:26,573 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:42:26,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:26,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:26,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:26,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:26,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:26,696 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:26,697 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:26,698 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:26,785 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 348 transitions. [2023-10-12 17:42:26,786 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:42:28,199 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:42:28,200 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:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2023-10-12 17:42:28,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 239 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:42:28,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:28,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 239 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:42:28,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:28,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 239 transitions. Stem has 11 letters. Loop has 4 letters. [2023-10-12 17:42:28,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:28,201 INFO L430 stractBuchiCegarLoop]: Abstraction has has 66 places, 141100 transitions, 2965100 flow [2023-10-12 17:42:28,201 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:42:28,201 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 66 places, 141100 transitions, 2965100 flow [2023-10-12 17:42:42,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-10-12 17:45:06,684 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][120], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][421], 3:3A:[116] L80-1-->L38: 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][720], 11:4A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][2321], 32:5A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][1780], 122:6A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][9181], 413:7A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][16762], 849:8A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][16495], 1784:9A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][34712]][3295:10A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][49975], 5640:11A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][50819], 5643:12A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][86912]] [2023-10-12 17:45:07,043 ERROR L47 etriNetUnfolderRabin]: [1:1A:[143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[][120], 2:2A:[113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][421], 3:3A:[116] L80-1-->L38: 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][720], 11:4A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][2321], 32:5A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][1780], 122:6A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][9181], 413:7A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][16762], 849:8A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][16495], 1784:9A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][34712]][3310:10A:[142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w][50817], 5653:11A:[99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][67769], 5656:12A:[140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1][87912]] Received shutdown request... [2023-10-12 17:46:05,951 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:46:05,962 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:46:05,962 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:46:05,962 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:46:06,003 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:46:06,007 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:46:06 BoogieIcfgContainer [2023-10-12 17:46:06,007 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:46:06,007 INFO L158 Benchmark]: Toolchain (without parser) took 235997.30ms. Allocated memory was 180.4MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 131.3MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2023-10-12 17:46:06,007 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 180.4MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:46:06,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.78ms. Allocated memory is still 180.4MB. Free memory was 131.0MB in the beginning and 129.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:46:06,007 INFO L158 Benchmark]: Boogie Preprocessor took 11.79ms. Allocated memory is still 180.4MB. Free memory was 129.5MB in the beginning and 128.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:46:06,008 INFO L158 Benchmark]: RCFGBuilder took 238.53ms. Allocated memory is still 180.4MB. Free memory was 128.4MB in the beginning and 117.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:46:06,008 INFO L158 Benchmark]: BuchiAutomizer took 235725.14ms. Allocated memory was 180.4MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 117.2MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2023-10-12 17:46:06,008 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22ms. Allocated memory is still 180.4MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.78ms. Allocated memory is still 180.4MB. Free memory was 131.0MB in the beginning and 129.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.79ms. Allocated memory is still 180.4MB. Free memory was 129.5MB in the beginning and 128.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 238.53ms. Allocated memory is still 180.4MB. Free memory was 128.4MB in the beginning and 117.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 235725.14ms. Allocated memory was 180.4MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 117.2MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (5 trivial, 3 deterministic, 1 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function w and consists of 4 locations. One deterministic module has affine ranking function back2 + -1 * front2 and consists of 4 locations. One deterministic module has affine ranking function -1 * front1 + back1 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * front1 + back1 and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 2965100 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 235.6s and 10 iterations. TraceHistogramMax:0. Analysis of lassos took 4.1s. Construction of modules took 0.3s. Büchi inclusion checks took 4.6s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 798 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 792 mSDsluCounter, 540 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 167 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 713 IncrementalHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 373 mSDtfsCounter, 713 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital115 mio100 ax100 hnf100 lsp68 ukn95 mio100 lsp74 div100 bol100 ite100 ukn100 eq208 hnf89 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 50ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderRabin. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 46 PlacesBefore, 30 PlacesAfterwards, 36 TransitionsBefore, 20 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 3 FixpointIterations, 8 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 542 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 332, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 231, independent: 215, independent conditional: 0, independent unconditional: 215, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 231, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 332, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 231, unknown conditional: 0, unknown unconditional: 231] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate could not prove your program: Timeout [2023-10-12 17:46:06,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 Completed graceful shutdown