/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-cons.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:42:07,273 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:42:07,339 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:07,373 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:42:07,374 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:42:07,375 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:42:07,376 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:42:07,376 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:42:07,377 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:42:07,380 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:42:07,381 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:42:07,381 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:42:07,381 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:42:07,382 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:42:07,383 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:42:07,383 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:42:07,384 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:42:07,384 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:42:07,384 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:42:07,385 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:42:07,385 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:42:07,386 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:42:07,386 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:42:07,387 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:42:07,387 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:42:07,387 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:42:07,387 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:42:07,388 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:42:07,388 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:42:07,388 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:42:07,389 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:42:07,389 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:42:07,389 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:42:07,391 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:42:07,391 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:07,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:42:07,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:42:07,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:42:07,663 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:42:07,664 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:42:07,665 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-cons.wvr.bpl [2023-10-12 17:42:07,665 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons.wvr.bpl' [2023-10-12 17:42:07,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:42:07,699 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:42:07,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:07,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:42:07,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:42:07,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:07" (1/1) ... [2023-10-12 17:42:07,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:07" (1/1) ... [2023-10-12 17:42:07,722 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:42:07,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:07,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:42:07,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:42:07,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:42:07,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:07" (1/1) ... [2023-10-12 17:42:07,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:07" (1/1) ... [2023-10-12 17:42:07,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:07" (1/1) ... [2023-10-12 17:42:07,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:07" (1/1) ... [2023-10-12 17:42:07,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:07" (1/1) ... [2023-10-12 17:42:07,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:07" (1/1) ... [2023-10-12 17:42:07,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:07" (1/1) ... [2023-10-12 17:42:07,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:07" (1/1) ... [2023-10-12 17:42:07,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:42:07,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:42:07,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:42:07,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:42:07,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:07" (1/1) ... [2023-10-12 17:42:07,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:07,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:07,777 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:07,787 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:07,812 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:42:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:42:07,816 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:42:07,816 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:42:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:42:07,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:42:07,818 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:42:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:42:07,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:42:07,818 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:42:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:42:07,819 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:42:07,820 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:07,866 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:42:07,868 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:42:07,999 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:42:08,014 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:42:08,015 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:42:08,017 INFO L201 PluginConnector]: Adding new model prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:08 BoogieIcfgContainer [2023-10-12 17:42:08,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:42:08,018 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:42:08,019 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:42:08,022 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:42:08,023 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:08,023 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:07" (1/2) ... [2023-10-12 17:42:08,025 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53a24d5b and model type prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:42:08, skipping insertion in model container [2023-10-12 17:42:08,025 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:08,025 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:08" (2/2) ... [2023-10-12 17:42:08,035 INFO L332 chiAutomizerObserver]: Analyzing ICFG prod-cons.wvr.bpl [2023-10-12 17:42:08,122 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:42:08,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 90 flow [2023-10-12 17:42:08,182 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-10-12 17:42:08,183 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:42:08,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 2/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:42:08,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 90 flow [2023-10-12 17:42:08,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 27 transitions, 72 flow [2023-10-12 17:42:08,196 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:42:08,221 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 72 flow [2023-10-12 17:42:08,223 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 72 flow [2023-10-12 17:42:08,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 72 flow [2023-10-12 17:42:08,229 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-10-12 17:42:08,229 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:42:08,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 2/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:42:08,230 INFO L119 LiptonReduction]: Number of co-enabled transitions 138 [2023-10-12 17:42:08,575 INFO L134 LiptonReduction]: Checked pairs total: 220 [2023-10-12 17:42:08,575 INFO L136 LiptonReduction]: Total number of compositions: 13 [2023-10-12 17:42:08,588 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:42:08,588 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:42:08,589 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:42:08,589 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:42:08,589 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:42:08,589 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:42:08,589 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:42:08,589 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:42:08,590 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 15 transitions, 48 flow [2023-10-12 17:42:08,595 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[][14], 2:2A:[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6]][3:3A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][12]] [2023-10-12 17:42:08,599 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:08,600 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:42:08,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:08,601 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:08,603 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:42:08,603 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 15 transitions, 48 flow [2023-10-12 17:42:08,606 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[][14], 2:2A:[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6]][3:3A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][12]] [2023-10-12 17:42:08,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:08,607 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:42:08,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:08,607 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:08,611 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 44#[L57]true [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L21, L57-1]true [2023-10-12 17:42:08,611 INFO L750 eck$LassoCheckResult]: Loop: 46#[L21, L57-1]true [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 46#[L21, L57-1]true [2023-10-12 17:42:08,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:08,615 INFO L85 PathProgramCache]: Analyzing trace with hash 4203, now seen corresponding path program 1 times [2023-10-12 17:42:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2727240] [2023-10-12 17:42:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:08,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:08,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:08,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:08,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:08,702 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2023-10-12 17:42:08,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:08,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307436874] [2023-10-12 17:42:08,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:08,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:08,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:08,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:08,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:08,724 INFO L85 PathProgramCache]: Analyzing trace with hash 130392, now seen corresponding path program 1 times [2023-10-12 17:42:08,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:08,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220730644] [2023-10-12 17:42:08,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:08,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:08,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:08,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:08,852 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:08,852 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:08,853 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:08,853 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:08,853 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:08,853 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:08,853 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:08,853 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:08,853 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:42:08,853 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:08,854 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:08,898 INFO L117 MapEliminator]: 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:08,908 INFO L117 MapEliminator]: 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:08,927 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:08,930 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:08,933 INFO L117 MapEliminator]: 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:09,013 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:09,016 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:09,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:09,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:09,022 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:09,024 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:09,026 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:09,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:09,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:09,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:09,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:09,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:09,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:09,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:09,060 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:09,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:09,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:09,064 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:09,069 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:09,070 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:09,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:09,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:09,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:09,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:09,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:09,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:09,099 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:09,130 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:42:09,130 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:42:09,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:09,135 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:09,137 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:09,169 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:09,187 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:09,187 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:09,188 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(w) = 1*w Supporting invariants [] [2023-10-12 17:42:09,194 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:09,197 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:09,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:09,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:09,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:09,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:09,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:42:09,280 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:09,366 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:09,371 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:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2023-10-12 17:42:09,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 184 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:42:09,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:09,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 184 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:42:09,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:09,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 184 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:42:09,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:09,377 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 60 transitions, 312 flow [2023-10-12 17:42:09,377 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:42:09,377 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 60 transitions, 312 flow [2023-10-12 17:42:09,380 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[][57], 2:2A:[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][25], 4:3A:[83] L57-1-->L33: 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][18]][8:4A:[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][15], 10:5A:[94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp][39]] [2023-10-12 17:42:09,380 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:09,381 INFO L124 PetriNetUnfolderBase]: 3/9 cut-off events. [2023-10-12 17:42:09,381 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:42:09,381 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:09,381 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 44#[L57]true [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L21, L57-1]true [83] L57-1-->L33: 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] 81#[L33, L58, L21]true [2023-10-12 17:42:09,381 INFO L750 eck$LassoCheckResult]: Loop: 81#[L33, L58, L21]true [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 84#[L58, L21, L34]true [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 81#[L33, L58, L21]true [2023-10-12 17:42:09,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:09,382 INFO L85 PathProgramCache]: Analyzing trace with hash 130376, now seen corresponding path program 1 times [2023-10-12 17:42:09,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:09,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947398067] [2023-10-12 17:42:09,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:09,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:09,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:09,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:09,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:09,391 INFO L85 PathProgramCache]: Analyzing trace with hash 3287, now seen corresponding path program 1 times [2023-10-12 17:42:09,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:09,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611940668] [2023-10-12 17:42:09,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:09,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:09,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:09,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:09,399 INFO L85 PathProgramCache]: Analyzing trace with hash 125293662, now seen corresponding path program 1 times [2023-10-12 17:42:09,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:09,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175865628] [2023-10-12 17:42:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:09,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:09,479 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:09,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:42:09,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175865628] [2023-10-12 17:42:09,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175865628] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:42:09,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:42:09,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:42:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807267375] [2023-10-12 17:42:09,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:42:09,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:42:09,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:42:09,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:42:09,514 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 27 places, 60 transitions, 312 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:09,514 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:42:09,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:42:09,584 INFO L124 PetriNetUnfolderBase]: 101/171 cut-off events. [2023-10-12 17:42:09,584 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-10-12 17:42:09,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 171 events. 101/171 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 467 event pairs, 32 based on Foata normal form. 8/131 useless extension candidates. Maximal degree in co-relation 431. Up to 140 conditions per place. [2023-10-12 17:42:09,590 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-10-12 17:42:09,590 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 27 places, 36 transitions, 258 flow [2023-10-12 17:42:09,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:42:09,594 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 36 transitions, 258 flow [2023-10-12 17:42:09,594 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:42:09,594 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 36 transitions, 258 flow [2023-10-12 17:42:09,603 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[][0], 2:2A:[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][2], 9:4A:[83] L57-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][7]][31:5A:[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][16], 34:6A:[94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp][24]] [2023-10-12 17:42:09,604 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:09,604 INFO L124 PetriNetUnfolderBase]: 18/33 cut-off events. [2023-10-12 17:42:09,604 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-10-12 17:42:09,604 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:09,605 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 44#[L57]true [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L21, L57-1]true [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 46#[L21, L57-1]true [83] L57-1-->L33: 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] 81#[L33, L58, L21]true [2023-10-12 17:42:09,605 INFO L750 eck$LassoCheckResult]: Loop: 81#[L33, L58, L21]true [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 84#[L58, L21, L34]true [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 81#[L33, L58, L21]true [2023-10-12 17:42:09,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:09,605 INFO L85 PathProgramCache]: Analyzing trace with hash 4042235, now seen corresponding path program 1 times [2023-10-12 17:42:09,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:09,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755723385] [2023-10-12 17:42:09,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:09,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:09,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:09,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:09,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash 3287, now seen corresponding path program 2 times [2023-10-12 17:42:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:09,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868225038] [2023-10-12 17:42:09,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:09,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:09,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:09,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:09,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash -410377135, now seen corresponding path program 1 times [2023-10-12 17:42:09,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:09,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299336491] [2023-10-12 17:42:09,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:09,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:09,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:09,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:09,771 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:09,772 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:09,772 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:09,772 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:09,772 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:09,772 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:09,772 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:09,772 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:09,772 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:42:09,772 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:09,772 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:09,774 INFO L117 MapEliminator]: 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:09,776 INFO L117 MapEliminator]: 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:09,782 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:09,801 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:09,804 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:09,806 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:09,903 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:09,903 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:09,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:09,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:09,905 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:09,916 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:09,920 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:09,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:09,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:09,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:09,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:09,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:09,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:09,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:09,952 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:09,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:09,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:09,954 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:09,956 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:09,957 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:09,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:09,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:09,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:09,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:09,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:09,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:09,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:09,989 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:09,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:09,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:09,997 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:10,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:42:10,001 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:10,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:10,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:10,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:10,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:10,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:10,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:10,030 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:10,037 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:42:10,038 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:42:10,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:10,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:10,041 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:10,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:42:10,044 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:10,065 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:10,066 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:10,066 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back, front) = 1*back - 1*front Supporting invariants [] [2023-10-12 17:42:10,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:42:10,075 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:10,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:10,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:10,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:10,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:10,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:10,109 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:10,109 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:10,159 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:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2023-10-12 17:42:10,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:42:10,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:10,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:42:10,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:10,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:42:10,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:10,162 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 180 transitions, 1650 flow [2023-10-12 17:42:10,162 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:42:10,162 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 180 transitions, 1650 flow [2023-10-12 17:42:10,205 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:10,205 INFO L124 PetriNetUnfolderBase]: 66/109 cut-off events. [2023-10-12 17:42:10,205 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-10-12 17:42:10,205 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:10,206 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 44#[L57]true [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L21, L57-1]true [83] L57-1-->L33: 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] 81#[L33, L58, L21]true [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 84#[L58, L21, L34]true [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 84#[L58, L21, L34]true [93] L21-->thread1EXIT: Formula: (or (<= v_w_12 0) (not v_v_assert_21)) InVars {v_assert=v_v_assert_21, w=v_w_12} OutVars{v_assert=v_v_assert_21, w=v_w_12} AuxVars[] AssignedVars[] 142#[L58, L34, thread1EXIT]true [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 144#[L33, L58, thread1EXIT]true [2023-10-12 17:42:10,206 INFO L750 eck$LassoCheckResult]: Loop: 144#[L33, L58, thread1EXIT]true [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 142#[L58, L34, thread1EXIT]true [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 144#[L33, L58, thread1EXIT]true [2023-10-12 17:42:10,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:10,207 INFO L85 PathProgramCache]: Analyzing trace with hash 148132676, now seen corresponding path program 1 times [2023-10-12 17:42:10,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:10,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253019247] [2023-10-12 17:42:10,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:10,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:10,217 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:10,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:10,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash 3287, now seen corresponding path program 3 times [2023-10-12 17:42:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:10,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323564351] [2023-10-12 17:42:10,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:10,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:10,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash 621583194, now seen corresponding path program 2 times [2023-10-12 17:42:10,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:10,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047282107] [2023-10-12 17:42:10,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:10,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:42:10,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:42:10,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047282107] [2023-10-12 17:42:10,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047282107] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:42:10,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537593457] [2023-10-12 17:42:10,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:42:10,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:42:10,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:10,298 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:10,308 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:10,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:42:10,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:42:10,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:10,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:42:10,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:42:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:42:10,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537593457] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:42:10,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:42:10,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 3 [2023-10-12 17:42:10,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030576416] [2023-10-12 17:42:10,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:42:10,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:42:10,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:42:10,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:42:10,419 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 32 places, 180 transitions, 1650 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:10,420 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:42:10,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:42:10,546 INFO L124 PetriNetUnfolderBase]: 345/581 cut-off events. [2023-10-12 17:42:10,546 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2023-10-12 17:42:10,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 581 events. 345/581 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2361 event pairs, 53 based on Foata normal form. 16/433 useless extension candidates. Maximal degree in co-relation 2269. Up to 523 conditions per place. [2023-10-12 17:42:10,559 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 111 selfloop transitions, 15 changer transitions 0/126 dead transitions. [2023-10-12 17:42:10,559 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 34 places, 126 transitions, 1389 flow [2023-10-12 17:42:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:42:10,561 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 126 transitions, 1389 flow [2023-10-12 17:42:10,561 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:42:10,561 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 126 transitions, 1389 flow [2023-10-12 17:42:10,585 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[][0], 2:2A:[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][3], 7:4A:[83] L57-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][6], 31:5A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][15], 97:6A:[86] L58-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][38]][209:7A:[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][65], 212:8A:[94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp][69]] [2023-10-12 17:42:10,586 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:10,586 INFO L124 PetriNetUnfolderBase]: 129/211 cut-off events. [2023-10-12 17:42:10,586 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-10-12 17:42:10,586 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:10,587 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 44#[L57]true [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L21, L57-1]true [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 46#[L21, L57-1]true [83] L57-1-->L33: 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] 81#[L33, L58, L21]true [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 81#[L33, L58, L21]true [86] L58-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 213#[L59, L33, L21, $Ultimate##0]true [2023-10-12 17:42:10,587 INFO L750 eck$LassoCheckResult]: Loop: 213#[L59, L33, L21, $Ultimate##0]true [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 216#[L59, L21, L34, $Ultimate##0]true [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 213#[L59, L33, L21, $Ultimate##0]true [2023-10-12 17:42:10,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash -410376306, now seen corresponding path program 1 times [2023-10-12 17:42:10,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:10,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958173006] [2023-10-12 17:42:10,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:10,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:10,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:10,600 INFO L85 PathProgramCache]: Analyzing trace with hash 3287, now seen corresponding path program 4 times [2023-10-12 17:42:10,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:10,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383231433] [2023-10-12 17:42:10,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:10,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:10,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 765363492, now seen corresponding path program 1 times [2023-10-12 17:42:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:10,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663356529] [2023-10-12 17:42:10,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:10,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:10,783 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:10,783 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:10,783 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:10,783 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:10,784 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:10,784 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:10,784 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:10,784 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:10,784 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:42:10,784 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:10,784 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:10,786 INFO L117 MapEliminator]: 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:10,791 INFO L117 MapEliminator]: 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:10,794 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:10,797 INFO L117 MapEliminator]: 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:10,799 INFO L117 MapEliminator]: 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:10,801 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:10,803 INFO L117 MapEliminator]: 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:10,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:10,834 INFO L117 MapEliminator]: 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:10,958 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:10,958 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:10,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:10,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:10,960 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:10,969 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:10,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:42:10,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:10,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:10,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:10,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:10,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:10,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:10,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:11,003 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:11,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,005 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:11,016 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,023 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:11,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:11,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:11,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:11,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:11,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:11,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:11,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:11,055 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:11,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,057 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:11,059 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:11,061 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,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:11,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:11,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:11,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:11,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:11,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:11,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:11,093 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:11,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,094 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:11,096 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:11,099 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,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:11,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:11,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:11,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:11,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:11,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:11,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:11,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:11,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,130 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:11,139 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:11,139 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,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:11,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:11,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:11,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:11,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:11,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:11,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:11,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:11,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,173 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:11,183 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:11,183 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,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:11,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:11,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:11,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:11,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:11,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:11,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:11,214 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:11,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,215 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:11,218 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:11,219 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,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:11,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:11,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:11,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:11,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:11,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:11,246 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:11,257 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:42:11,257 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:42:11,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,259 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:11,261 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:11,262 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:11,269 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:11,270 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:11,270 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(front, back) = -1*front + 1*back Supporting invariants [] [2023-10-12 17:42:11,273 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:11,283 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:42:11,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:11,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:11,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:11,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:11,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:11,329 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,330 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,387 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:11,407 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,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2023-10-12 17:42:11,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:42:11,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:11,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:42:11,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:11,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:42:11,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:11,412 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 630 transitions, 8205 flow [2023-10-12 17:42:11,412 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:42:11,412 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 630 transitions, 8205 flow [2023-10-12 17:42:11,468 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:11,468 INFO L124 PetriNetUnfolderBase]: 159/263 cut-off events. [2023-10-12 17:42:11,468 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-10-12 17:42:11,468 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:11,469 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 44#[L57]true [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L21, L57-1]true [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 46#[L21, L57-1]true [83] L57-1-->L33: 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] 81#[L33, L58, L21]true [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 81#[L33, L58, L21]true [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 84#[L58, L21, L34]true [93] L21-->thread1EXIT: Formula: (or (<= v_w_12 0) (not v_v_assert_21)) InVars {v_assert=v_v_assert_21, w=v_w_12} OutVars{v_assert=v_v_assert_21, w=v_w_12} AuxVars[] AssignedVars[] 142#[L58, L34, thread1EXIT]true [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 144#[L33, L58, thread1EXIT]true [2023-10-12 17:42:11,470 INFO L750 eck$LassoCheckResult]: Loop: 144#[L33, L58, thread1EXIT]true [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 142#[L58, L34, thread1EXIT]true [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 144#[L33, L58, thread1EXIT]true [2023-10-12 17:42:11,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:11,471 INFO L85 PathProgramCache]: Analyzing trace with hash 765350689, now seen corresponding path program 3 times [2023-10-12 17:42:11,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:11,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115212838] [2023-10-12 17:42:11,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:11,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:11,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:11,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:11,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash 3287, now seen corresponding path program 5 times [2023-10-12 17:42:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:11,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378990445] [2023-10-12 17:42:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:11,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:11,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:11,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:11,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:11,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1062606839, now seen corresponding path program 4 times [2023-10-12 17:42:11,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:11,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593029435] [2023-10-12 17:42:11,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:11,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:11,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:11,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:11,688 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:11,688 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:11,688 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:11,688 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:11,688 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:11,688 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,688 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:11,689 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:11,689 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:42:11,689 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:11,689 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:11,694 INFO L117 MapEliminator]: 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,754 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:42:11,765 INFO L117 MapEliminator]: 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,767 INFO L117 MapEliminator]: 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,770 INFO L117 MapEliminator]: 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,772 INFO L117 MapEliminator]: 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,901 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:11,902 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:11,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,903 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:11,916 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:11,916 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,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:11,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:11,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:11,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:11,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:11,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:11,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:11,939 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:11,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,943 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:11,945 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:11,947 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,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:11,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:11,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:11,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:11,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:11,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:11,962 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:11,967 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:42:11,968 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:42:11,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:11,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:11,969 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:11,973 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:12,005 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:12,012 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:12,013 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:12,013 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(front, back) = -1*front + 1*back Supporting invariants [] [2023-10-12 17:42:12,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-10-12 17:42:12,026 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:42:12,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:12,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:12,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:12,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:12,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:12,068 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,068 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:12,140 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:12,141 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:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2023-10-12 17:42:12,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:42:12,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:12,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:42:12,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:12,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:42:12,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:12,142 INFO L430 stractBuchiCegarLoop]: Abstraction has has 44 places, 3150 transitions, 47325 flow [2023-10-12 17:42:12,142 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:42:12,142 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 44 places, 3150 transitions, 47325 flow [2023-10-12 17:42:12,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:12,574 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:12,575 INFO L124 PetriNetUnfolderBase]: 665/1050 cut-off events. [2023-10-12 17:42:12,575 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-10-12 17:42:12,575 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:12,575 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 44#[L57]true [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L21, L57-1]true [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 46#[L21, L57-1]true [83] L57-1-->L33: 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] 81#[L33, L58, L21]true [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 81#[L33, L58, L21]true [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 84#[L58, L21, L34]true [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 81#[L33, L58, L21]true [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 81#[L33, L58, L21]true [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 84#[L58, L21, L34]true [93] L21-->thread1EXIT: Formula: (or (<= v_w_12 0) (not v_v_assert_21)) InVars {v_assert=v_v_assert_21, w=v_w_12} OutVars{v_assert=v_v_assert_21, w=v_w_12} AuxVars[] AssignedVars[] 142#[L58, L34, thread1EXIT]true [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 144#[L33, L58, thread1EXIT]true [2023-10-12 17:42:12,575 INFO L750 eck$LassoCheckResult]: Loop: 144#[L33, L58, thread1EXIT]true [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 142#[L58, L34, thread1EXIT]true [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 144#[L33, L58, thread1EXIT]true [2023-10-12 17:42:12,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1417853820, now seen corresponding path program 5 times [2023-10-12 17:42:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:12,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132596453] [2023-10-12 17:42:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:12,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:12,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash 3287, now seen corresponding path program 6 times [2023-10-12 17:42:12,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:12,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577198916] [2023-10-12 17:42:12,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:12,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:12,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1052885862, now seen corresponding path program 6 times [2023-10-12 17:42:12,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:12,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955350634] [2023-10-12 17:42:12,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:12,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:12,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:12,835 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:12,835 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:12,835 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:12,835 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:12,835 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:12,835 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:12,835 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:12,835 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:12,835 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:42:12,835 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:12,835 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:12,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:12,844 INFO L117 MapEliminator]: 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:12,846 INFO L117 MapEliminator]: 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:12,848 INFO L117 MapEliminator]: 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:12,850 INFO L117 MapEliminator]: 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:12,852 INFO L117 MapEliminator]: 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:13,101 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:13,102 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:13,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:13,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:13,104 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:13,112 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:13,113 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:13,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:13,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:13,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:13,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:13,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:13,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:13,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:13,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:13,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:13,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:13,140 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:13,142 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:13,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:42:13,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:13,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:13,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:13,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:13,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:13,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:13,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:13,171 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:13,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:13,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:13,172 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:13,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:42:13,185 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:13,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:13,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:13,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:13,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:13,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:13,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:13,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:13,203 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:13,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:13,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:13,204 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:13,206 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:13,207 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:13,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:13,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:13,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:13,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:13,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:13,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:13,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:13,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:13,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:13,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:13,243 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:13,244 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:13,247 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:13,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:13,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:13,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:13,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:13,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:13,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:13,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:13,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-10-12 17:42:13,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:13,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:13,272 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:13,276 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:13,279 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:13,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:13,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:13,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:13,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:13,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:13,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:13,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:13,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:13,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:13,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:13,314 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:13,329 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:13,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:13,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:13,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:13,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:13,340 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:13,340 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:13,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:42:13,364 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:13,373 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:42:13,373 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:42:13,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:13,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:13,377 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:42:13,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:42:13,384 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:13,401 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:13,402 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:13,402 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back, front) = 1*back - 1*front Supporting invariants [] [2023-10-12 17:42:13,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:13,414 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-10-12 17:42:13,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:13,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:13,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:13,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:13,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:13,459 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:13,460 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:13,607 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:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2023-10-12 17:42:13,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:42:13,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:13,611 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:42:13,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:13,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:13,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:13,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:13,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:13,655 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:13,655 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:13,771 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:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2023-10-12 17:42:13,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 178 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:42:13,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:13,772 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:42:13,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:13,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:13,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:13,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:13,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:13,810 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:13,811 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:13,812 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:13,880 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 260 transitions. [2023-10-12 17:42:13,881 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:42:14,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:14,190 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:42:14,191 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:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:42:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2023-10-12 17:42:14,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 179 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:42:14,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:14,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 179 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:42:14,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:14,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 179 transitions. Stem has 11 letters. Loop has 4 letters. [2023-10-12 17:42:14,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:14,193 INFO L430 stractBuchiCegarLoop]: Abstraction has has 54 places, 35600 transitions, 608300 flow [2023-10-12 17:42:14,193 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:42:14,193 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 54 places, 35600 transitions, 608300 flow [2023-10-12 17:42:28,582 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[][38], 2:2A:[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][339], 4:3A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][926], 7:4A:[83] L57-1-->L33: 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][1739], 25:5A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][4226], 101:6A:[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][11339], 280:7A:[94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp][19224], 564:8A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][17813], 1083:9A:[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][11303], 1798:10A:[94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp][19200]][2381:11A:[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][18007], 2382:12A:[94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp][19207]] [2023-10-12 17:42:31,215 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[][38], 2:2A:[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][339], 4:3A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][926], 7:4A:[83] L57-1-->L33: 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][1739], 25:5A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][4226], 99:6A:[86] L58-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][10739], 248:7A:[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][18158], 536:8A:[94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp][19345], 1047:9A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][17892], 1685:10A:[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][11543], 2285:11A:[94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp][19360]][2801:12A:[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][18247], 2802:13A:[94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp][19367]] [2023-10-12 17:42:35,969 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[][38], 2:2A:[80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][339], 4:3A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][926], 7:4A:[83] L57-1-->L33: 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][1739], 25:5A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][4226], 99:6A:[86] L58-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][10739], 248:7A:[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][18158], 536:8A:[94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp][19345], 1065:9A:[95] $Ultimate##0-->thread3EXIT: Formula: (or (and (<= v_d_19 v_W_12) v_v_assert_26) (and (< v_W_12 v_d_19) (not v_v_assert_26))) InVars {W=v_W_12, d=v_d_19} OutVars{v_assert=v_v_assert_26, W=v_W_12, d=v_d_19} AuxVars[] AssignedVars[v_assert][18736], 1775:10A:[99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w][17953], 2281:11A:[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][11542], 2783:12A:[93] L21-->thread1EXIT: Formula: (or (<= v_w_12 0) (not v_v_assert_21)) InVars {v_assert=v_v_assert_21, w=v_w_12} OutVars{v_assert=v_v_assert_21, w=v_w_12} AuxVars[] AssignedVars[][17743], 3219:13A:[94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp][19360]][3469:14A:[72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[][18247], 3470:15A:[94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp][19367]] [2023-10-12 17:42:38,031 INFO L124 PetriNetUnfolderBase]: 2201/3635 cut-off events. [2023-10-12 17:42:38,031 INFO L125 PetriNetUnfolderBase]: For 1142/1142 co-relation queries the response was YES. [2023-10-12 17:42:38,031 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:42:38,036 INFO L201 PluginConnector]: Adding new model prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:42:38 BoogieIcfgContainer [2023-10-12 17:42:38,036 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:42:38,036 INFO L158 Benchmark]: Toolchain (without parser) took 30337.57ms. Allocated memory was 176.2MB in the beginning and 653.3MB in the end (delta: 477.1MB). Free memory was 125.6MB in the beginning and 237.2MB in the end (delta: -111.6MB). Peak memory consumption was 468.3MB. Max. memory is 8.0GB. [2023-10-12 17:42:38,036 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 176.2MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:42:38,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.19ms. Allocated memory is still 176.2MB. Free memory was 125.3MB in the beginning and 123.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:42:38,037 INFO L158 Benchmark]: Boogie Preprocessor took 18.54ms. Allocated memory is still 176.2MB. Free memory was 123.8MB in the beginning and 122.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:42:38,037 INFO L158 Benchmark]: RCFGBuilder took 272.66ms. Allocated memory is still 176.2MB. Free memory was 122.8MB in the beginning and 112.7MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:42:38,038 INFO L158 Benchmark]: BuchiAutomizer took 30017.20ms. Allocated memory was 176.2MB in the beginning and 653.3MB in the end (delta: 477.1MB). Free memory was 112.7MB in the beginning and 237.2MB in the end (delta: -124.5MB). Peak memory consumption was 455.7MB. Max. memory is 8.0GB. [2023-10-12 17:42:38,039 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.24ms. Allocated memory is still 176.2MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.19ms. Allocated memory is still 176.2MB. Free memory was 125.3MB in the beginning and 123.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.54ms. Allocated memory is still 176.2MB. Free memory was 123.8MB in the beginning and 122.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 272.66ms. Allocated memory is still 176.2MB. Free memory was 122.8MB in the beginning and 112.7MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 30017.20ms. Allocated memory was 176.2MB in the beginning and 653.3MB in the end (delta: 477.1MB). Free memory was 112.7MB in the beginning and 237.2MB in the end (delta: -124.5MB). Peak memory consumption was 455.7MB. 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 7 terminating modules (2 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function w and consists of 4 locations. One deterministic module has affine ranking function back + -1 * front and consists of 4 locations. One deterministic module has affine ranking function back + -1 * front and consists of 4 locations. One deterministic module has affine ranking function back + -1 * front and consists of 4 locations. One nondeterministic module has affine ranking function back + -1 * front and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.8s and 8 iterations. TraceHistogramMax:0. Analysis of lassos took 3.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.2s. 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 [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 613 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 606 mSDsluCounter, 466 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 464 IncrementalHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 328 mSDtfsCounter, 464 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital69 mio100 ax100 hnf100 lsp60 ukn94 mio100 lsp65 div100 bol100 ite100 ukn100 eq208 hnf88 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms 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 - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 35 PlacesBefore, 23 PlacesAfterwards, 27 TransitionsBefore, 15 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 169, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 89, independent conditional: 0, independent unconditional: 89, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 169, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:42:38,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:42:38,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...