/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 BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:14:32,630 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:14:32,664 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:14:32,679 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:14:32,680 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:14:32,680 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:14:32,681 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:14:32,681 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:14:32,681 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:14:32,682 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:14:32,682 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:14:32,682 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:14:32,682 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:14:32,682 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:14:32,683 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:14:32,683 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:14:32,683 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:14:32,683 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:14:32,684 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:14:32,684 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:14:32,684 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:14:32,684 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:14:32,685 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:14:32,685 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:14:32,685 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:14:32,685 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:14:32,686 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:14:32,686 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:14:32,686 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:14:32,686 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:14:32,686 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:14:32,687 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:14:32,687 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:14:32,687 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:14:32,688 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 -> BUCHI_AUTOMATON [2023-10-12 17:14:32,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:14:32,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:14:32,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:14:32,839 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:14:32,839 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:14:32,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-2.wvr.bpl [2023-10-12 17:14:32,841 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-2.wvr.bpl' [2023-10-12 17:14:32,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:14:32,857 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:14:32,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:32,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:14:32,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:14:32,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:32" (1/1) ... [2023-10-12 17:14:32,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:32" (1/1) ... [2023-10-12 17:14:32,875 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:14:32,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:32,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:14:32,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:14:32,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:14:32,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:32" (1/1) ... [2023-10-12 17:14:32,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:32" (1/1) ... [2023-10-12 17:14:32,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:32" (1/1) ... [2023-10-12 17:14:32,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:32" (1/1) ... [2023-10-12 17:14:32,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:32" (1/1) ... [2023-10-12 17:14:32,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:32" (1/1) ... [2023-10-12 17:14:32,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:32" (1/1) ... [2023-10-12 17:14:32,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:32" (1/1) ... [2023-10-12 17:14:32,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:14:32,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:14:32,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:14:32,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:14:32,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:32" (1/1) ... [2023-10-12 17:14:32,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:32,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:32,910 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:14:32,957 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:14:32,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:14:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:14:32,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:14:32,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:14:32,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:14:32,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:14:32,968 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:14:32,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:14:32,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:14:32,968 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:14:33,004 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:14:33,006 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:14:33,102 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:14:33,114 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:14:33,114 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:14:33,115 INFO L201 PluginConnector]: Adding new model queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:33 BoogieIcfgContainer [2023-10-12 17:14:33,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:14:33,116 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:14:33,116 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:14:33,118 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:14:33,119 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:33,119 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:32" (1/2) ... [2023-10-12 17:14:33,120 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53ae8041 and model type queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:14:33, skipping insertion in model container [2023-10-12 17:14:33,120 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:33,120 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:33" (2/2) ... [2023-10-12 17:14:33,121 INFO L332 chiAutomizerObserver]: Analyzing ICFG queue-add-2.wvr.bpl [2023-10-12 17:14:33,159 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:14:33,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 72 flow [2023-10-12 17:14:33,212 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2023-10-12 17:14:33,212 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:14:33,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 2/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:14:33,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 72 flow [2023-10-12 17:14:33,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 24 transitions, 60 flow [2023-10-12 17:14:33,220 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:14:33,229 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 24 transitions, 60 flow [2023-10-12 17:14:33,231 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 24 transitions, 60 flow [2023-10-12 17:14:33,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 60 flow [2023-10-12 17:14:33,236 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2023-10-12 17:14:33,236 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:14:33,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 2/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:14:33,237 INFO L119 LiptonReduction]: Number of co-enabled transitions 142 [2023-10-12 17:14:33,494 INFO L134 LiptonReduction]: Checked pairs total: 132 [2023-10-12 17:14:33,494 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:14:33,507 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:14:33,507 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:14:33,508 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:14:33,508 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:14:33,508 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:14:33,508 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:14:33,508 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:14:33,508 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:14:33,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:14:33,530 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2023-10-12 17:14:33,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:33,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:33,534 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:33,534 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:33,534 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:14:33,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 19 states, but on-demand construction may add more states [2023-10-12 17:14:33,535 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2023-10-12 17:14:33,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:33,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:33,535 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:33,536 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:33,538 INFO L748 eck$LassoCheckResult]: Stem: 34#[$Ultimate##0]don't care [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 37#[L55]don't care [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 39#[L55-1, $Ultimate##0]don't care [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 41#[L55-1, L22-1]don't care [2023-10-12 17:14:33,538 INFO L750 eck$LassoCheckResult]: Loop: 41#[L55-1, L22-1]don't care [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 41#[L55-1, L22-1]don't care [2023-10-12 17:14:33,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:33,542 INFO L85 PathProgramCache]: Analyzing trace with hash 89065, now seen corresponding path program 1 times [2023-10-12 17:14:33,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:33,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382722036] [2023-10-12 17:14:33,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:33,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:33,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash 126, now seen corresponding path program 1 times [2023-10-12 17:14:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:33,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127681277] [2023-10-12 17:14:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:33,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:33,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:33,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2761110, now seen corresponding path program 1 times [2023-10-12 17:14:33,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:33,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269104098] [2023-10-12 17:14:33,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:33,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:33,789 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:33,790 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:33,790 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:33,790 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:33,790 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:33,790 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,790 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:33,791 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:33,791 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:14:33,791 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:33,791 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:33,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:14:33,815 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:33,818 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:33,870 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:33,872 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:33,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:33,875 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:14:33,890 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:14:33,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:33,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:33,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:33,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:33,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:33,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:33,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:33,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:33,914 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:14:33,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:33,926 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:14:33,928 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:14:33,929 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:14:33,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:33,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:33,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:33,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:33,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:33,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:33,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:33,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:33,955 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:14:33,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:33,956 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:14:33,957 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:14:33,960 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:14:33,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:33,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:33,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:33,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:33,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:33,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:33,978 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:33,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:14:33,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:33,983 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:14:34,007 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:14:34,009 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:14:34,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,039 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:34,054 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:14:34,054 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:34,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,077 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:14:34,078 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:34,079 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:14:34,085 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:34,085 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:34,086 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:14:34,091 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:14:34,093 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:34,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:34,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:34,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:34,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:34,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:34,138 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:14:34,163 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:14:34,165 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 19 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:34,212 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 19 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 100 transitions. Complement of second has 5 states. [2023-10-12 17:14:34,214 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:14:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2023-10-12 17:14:34,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:34,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:34,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:14:34,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:34,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:14:34,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:34,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 100 transitions. [2023-10-12 17:14:34,222 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:14:34,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 23 states and 53 transitions. [2023-10-12 17:14:34,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-10-12 17:14:34,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-10-12 17:14:34,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 53 transitions. [2023-10-12 17:14:34,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:34,226 INFO L219 hiAutomatonCegarLoop]: Abstraction has 23 states and 53 transitions. [2023-10-12 17:14:34,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 53 transitions. [2023-10-12 17:14:34,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-10-12 17:14:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 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:14:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2023-10-12 17:14:34,243 INFO L241 hiAutomatonCegarLoop]: Abstraction has 20 states and 47 transitions. [2023-10-12 17:14:34,243 INFO L430 stractBuchiCegarLoop]: Abstraction has 20 states and 47 transitions. [2023-10-12 17:14:34,243 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:14:34,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 47 transitions. [2023-10-12 17:14:34,244 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:14:34,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:34,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:34,244 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:34,244 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:34,245 INFO L748 eck$LassoCheckResult]: Stem: 188#[$Ultimate##0]don't care [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 182#[L55]don't care [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 184#[L55-1, $Ultimate##0]don't care [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 160#[$Ultimate##0, $Ultimate##0, L56]don't care [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 164#[$Ultimate##0, L40-1, L56]don't care [2023-10-12 17:14:34,245 INFO L750 eck$LassoCheckResult]: Loop: 164#[$Ultimate##0, L40-1, L56]don't care [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 164#[$Ultimate##0, L40-1, L56]don't care [2023-10-12 17:14:34,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2761728, now seen corresponding path program 1 times [2023-10-12 17:14:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909691877] [2023-10-12 17:14:34,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 1 times [2023-10-12 17:14:34,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254316334] [2023-10-12 17:14:34,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash 85613666, now seen corresponding path program 1 times [2023-10-12 17:14:34,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326232552] [2023-10-12 17:14:34,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:34,332 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:14:34,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:34,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326232552] [2023-10-12 17:14:34,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326232552] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:34,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:34,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:34,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120964258] [2023-10-12 17:14:34,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:34,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:34,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:34,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:34,411 INFO L87 Difference]: Start difference. First operand 20 states and 47 transitions. cyclomatic complexity: 34 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:14:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:34,425 INFO L93 Difference]: Finished difference Result 24 states and 50 transitions. [2023-10-12 17:14:34,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 50 transitions. [2023-10-12 17:14:34,429 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2023-10-12 17:14:34,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 50 transitions. [2023-10-12 17:14:34,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-10-12 17:14:34,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-10-12 17:14:34,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 50 transitions. [2023-10-12 17:14:34,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:34,430 INFO L219 hiAutomatonCegarLoop]: Abstraction has 24 states and 50 transitions. [2023-10-12 17:14:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 50 transitions. [2023-10-12 17:14:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-10-12 17:14:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 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:14:34,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2023-10-12 17:14:34,440 INFO L241 hiAutomatonCegarLoop]: Abstraction has 24 states and 50 transitions. [2023-10-12 17:14:34,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:34,441 INFO L430 stractBuchiCegarLoop]: Abstraction has 24 states and 50 transitions. [2023-10-12 17:14:34,442 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:14:34,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 50 transitions. [2023-10-12 17:14:34,443 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2023-10-12 17:14:34,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:34,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:34,443 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:14:34,443 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:34,443 INFO L748 eck$LassoCheckResult]: Stem: 268#[$Ultimate##0]don't care [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 264#[L55]don't care [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 266#[L55-1, $Ultimate##0]don't care [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 222#[L55-1, L22-1]don't care [96] L22-1-->thread1EXIT: Formula: (and (= (+ v_q_back_54 1) v_q_back_53) (= (select v_q_30 v_q_back_54) 0) (<= v_N_15 v_i_18)) InVars {q=v_q_30, q_back=v_q_back_54, N=v_N_15, i=v_i_18} OutVars{q=v_q_30, q_back=v_q_back_53, N=v_N_15, i=v_i_18} AuxVars[] AssignedVars[q_back] 224#[L55-1, thread1EXIT]don't care [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 246#[thread1EXIT, $Ultimate##0, L56]don't care [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 242#[L40-1, thread1EXIT, L56]don't care [2023-10-12 17:14:34,443 INFO L750 eck$LassoCheckResult]: Loop: 242#[L40-1, thread1EXIT, L56]don't care [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 242#[L40-1, thread1EXIT, L56]don't care [2023-10-12 17:14:34,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1641536928, now seen corresponding path program 1 times [2023-10-12 17:14:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697117894] [2023-10-12 17:14:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,452 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 2 times [2023-10-12 17:14:34,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462178959] [2023-10-12 17:14:34,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,462 INFO L85 PathProgramCache]: Analyzing trace with hash 651962882, now seen corresponding path program 1 times [2023-10-12 17:14:34,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339962085] [2023-10-12 17:14:34,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:14:34,653 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:34,654 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:34,654 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:34,654 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:34,654 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:34,654 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,654 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:34,654 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:34,654 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:14:34,654 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:34,654 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:34,656 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:34,659 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:34,691 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:34,695 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:34,697 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:34,700 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:34,869 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:34,869 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:34,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,885 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:14:34,888 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:14:34,889 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:14:34,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:34,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:34,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,937 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:14:34,941 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:14:34,942 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:14:34,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,948 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:14:34,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,978 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:14:34,978 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:14:35,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:35,026 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:14:35,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,027 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:35,051 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:14:35,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:35,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:35,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:35,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:35,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:35,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:35,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:14:35,072 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:35,077 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:35,077 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:35,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,078 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:14:35,093 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:14:35,094 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:35,111 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:35,111 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:35,111 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_front, q_back) = -1*q_front + 1*q_back Supporting invariants [] [2023-10-12 17:14:35,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:35,117 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:35,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:35,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:35,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:35,145 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:14:35,146 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:14:35,146 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 50 transitions. cyclomatic complexity: 32 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,171 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 50 transitions. cyclomatic complexity: 32. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 68 transitions. Complement of second has 5 states. [2023-10-12 17:14:35,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2023-10-12 17:14:35,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:14:35,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:14:35,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:14:35,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 68 transitions. [2023-10-12 17:14:35,175 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2023-10-12 17:14:35,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 25 states and 48 transitions. [2023-10-12 17:14:35,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-10-12 17:14:35,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2023-10-12 17:14:35,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 48 transitions. [2023-10-12 17:14:35,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:35,176 INFO L219 hiAutomatonCegarLoop]: Abstraction has 25 states and 48 transitions. [2023-10-12 17:14:35,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 48 transitions. [2023-10-12 17:14:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-10-12 17:14:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 22 states have internal predecessors, (44), 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:14:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 44 transitions. [2023-10-12 17:14:35,180 INFO L241 hiAutomatonCegarLoop]: Abstraction has 23 states and 44 transitions. [2023-10-12 17:14:35,180 INFO L430 stractBuchiCegarLoop]: Abstraction has 23 states and 44 transitions. [2023-10-12 17:14:35,180 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:14:35,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 44 transitions. [2023-10-12 17:14:35,198 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2023-10-12 17:14:35,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:35,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:35,198 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:14:35,198 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:35,198 INFO L748 eck$LassoCheckResult]: Stem: 369#[$Ultimate##0]don't care [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 371#[L55]don't care [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 367#[L55-1, $Ultimate##0]don't care [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 345#[L55-1, L22-1]don't care [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 349#[L22-1, $Ultimate##0, L56]don't care [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 373#[L40-1, L22-1, L56]don't care [96] L22-1-->thread1EXIT: Formula: (and (= (+ v_q_back_54 1) v_q_back_53) (= (select v_q_30 v_q_back_54) 0) (<= v_N_15 v_i_18)) InVars {q=v_q_30, q_back=v_q_back_54, N=v_N_15, i=v_i_18} OutVars{q=v_q_30, q_back=v_q_back_53, N=v_N_15, i=v_i_18} AuxVars[] AssignedVars[q_back] 365#[L40-1, thread1EXIT, L56]don't care [2023-10-12 17:14:35,198 INFO L750 eck$LassoCheckResult]: Loop: 365#[L40-1, thread1EXIT, L56]don't care [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 365#[L40-1, thread1EXIT, L56]don't care [2023-10-12 17:14:35,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1641548178, now seen corresponding path program 2 times [2023-10-12 17:14:35,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330654031] [2023-10-12 17:14:35,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,217 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 3 times [2023-10-12 17:14:35,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648919572] [2023-10-12 17:14:35,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,230 INFO L85 PathProgramCache]: Analyzing trace with hash 651614132, now seen corresponding path program 2 times [2023-10-12 17:14:35,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333272802] [2023-10-12 17:14:35,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,356 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:35,356 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:35,356 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:35,356 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:35,356 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:35,356 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,356 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:35,356 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:35,356 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:14:35,356 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:35,356 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:35,357 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:35,379 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:35,380 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:35,383 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:35,385 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:35,387 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:35,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:14:35,530 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:35,530 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:35,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,549 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:14:35,554 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:14:35,555 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:14:35,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:35,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:35,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:35,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:35,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:35,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:35,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:35,583 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:14:35,583 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:14:35,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,584 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:14:35,613 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:35,622 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:14:35,641 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:35,641 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:35,641 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2023-10-12 17:14:35,646 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:14:35,647 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:35,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:35,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:35,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:35,666 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:14:35,667 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:14:35,667 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 44 transitions. cyclomatic complexity: 28 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,678 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 44 transitions. cyclomatic complexity: 28. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 49 transitions. Complement of second has 4 states. [2023-10-12 17:14:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2023-10-12 17:14:35,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:14:35,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:14:35,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:14:35,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 49 transitions. [2023-10-12 17:14:35,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:14:35,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 16 states and 27 transitions. [2023-10-12 17:14:35,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-10-12 17:14:35,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-10-12 17:14:35,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 27 transitions. [2023-10-12 17:14:35,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:35,682 INFO L219 hiAutomatonCegarLoop]: Abstraction has 16 states and 27 transitions. [2023-10-12 17:14:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 27 transitions. [2023-10-12 17:14:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2023-10-12 17:14:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 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:14:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. [2023-10-12 17:14:35,685 INFO L241 hiAutomatonCegarLoop]: Abstraction has 14 states and 24 transitions. [2023-10-12 17:14:35,685 INFO L430 stractBuchiCegarLoop]: Abstraction has 14 states and 24 transitions. [2023-10-12 17:14:35,685 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:14:35,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 24 transitions. [2023-10-12 17:14:35,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:14:35,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:35,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:35,701 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:35,701 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:35,701 INFO L748 eck$LassoCheckResult]: Stem: 472#[$Ultimate##0]don't care [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 474#[L55]don't care [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 470#[L55-1, $Ultimate##0]don't care [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 456#[L55-1, L22-1]don't care [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 458#[L22-1, $Ultimate##0, L56]don't care [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 478#[L40-1, L22-1, L56]don't care [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 480#[L40-1, L22-1, L56]don't care [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 476#[L40-1, L22-1, L56]don't care [2023-10-12 17:14:35,701 INFO L750 eck$LassoCheckResult]: Loop: 476#[L40-1, L22-1, L56]don't care [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 476#[L40-1, L22-1, L56]don't care [2023-10-12 17:14:35,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,702 INFO L85 PathProgramCache]: Analyzing trace with hash 651614101, now seen corresponding path program 1 times [2023-10-12 17:14:35,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010037920] [2023-10-12 17:14:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,721 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 4 times [2023-10-12 17:14:35,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063181321] [2023-10-12 17:14:35,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1274799251, now seen corresponding path program 2 times [2023-10-12 17:14:35,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885557246] [2023-10-12 17:14:35,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:35,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:35,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885557246] [2023-10-12 17:14:35,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885557246] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:35,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:35,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:14:35,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841451722] [2023-10-12 17:14:35,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:35,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:35,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:14:35,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:14:35,863 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. cyclomatic complexity: 14 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:35,875 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. [2023-10-12 17:14:35,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 34 transitions. [2023-10-12 17:14:35,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:14:35,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 33 transitions. [2023-10-12 17:14:35,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-10-12 17:14:35,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-10-12 17:14:35,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 33 transitions. [2023-10-12 17:14:35,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:35,892 INFO L219 hiAutomatonCegarLoop]: Abstraction has 19 states and 33 transitions. [2023-10-12 17:14:35,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 33 transitions. [2023-10-12 17:14:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-10-12 17:14:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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:14:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2023-10-12 17:14:35,893 INFO L241 hiAutomatonCegarLoop]: Abstraction has 17 states and 30 transitions. [2023-10-12 17:14:35,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:14:35,895 INFO L430 stractBuchiCegarLoop]: Abstraction has 17 states and 30 transitions. [2023-10-12 17:14:35,895 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:14:35,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 30 transitions. [2023-10-12 17:14:35,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:14:35,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:35,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:35,896 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:35,896 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:35,896 INFO L748 eck$LassoCheckResult]: Stem: 532#[$Ultimate##0]don't care [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 534#[L55]don't care [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 530#[L55-1, $Ultimate##0]don't care [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 514#[L55-1, L22-1]don't care [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 516#[L22-1, $Ultimate##0, L56]don't care [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 538#[L40-1, L22-1, L56]don't care [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 540#[L40-1, L22-1, L56]don't care [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 546#[L40-1, L22-1, L56]don't care [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 536#[L40-1, L22-1, L56]don't care [2023-10-12 17:14:35,896 INFO L750 eck$LassoCheckResult]: Loop: 536#[L40-1, L22-1, L56]don't care [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 536#[L40-1, L22-1, L56]don't care [2023-10-12 17:14:35,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1274799344, now seen corresponding path program 3 times [2023-10-12 17:14:35,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131018584] [2023-10-12 17:14:35,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,917 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 5 times [2023-10-12 17:14:35,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570412845] [2023-10-12 17:14:35,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,947 INFO L85 PathProgramCache]: Analyzing trace with hash -864073902, now seen corresponding path program 4 times [2023-10-12 17:14:35,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126260165] [2023-10-12 17:14:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,128 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:36,128 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:36,128 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:36,128 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:36,128 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:36,128 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,128 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:36,128 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:36,128 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:14:36,128 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:36,128 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:36,129 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:36,170 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:36,172 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:36,174 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:36,175 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:36,177 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:36,332 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:36,332 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:36,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,345 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:14:36,347 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:14:36,389 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:14:36,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,413 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:36,420 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:14:36,420 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:36,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,432 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:14:36,433 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:14:36,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:36,455 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:36,455 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:36,455 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2023-10-12 17:14:36,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:14:36,466 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:14:36,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:36,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:36,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:36,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:36,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:36,499 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:14:36,500 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:14:36,500 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 30 transitions. cyclomatic complexity: 18 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:36,509 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 30 transitions. cyclomatic complexity: 18. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 43 transitions. Complement of second has 3 states. [2023-10-12 17:14:36,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2023-10-12 17:14:36,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:36,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:36,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:36,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 43 transitions. [2023-10-12 17:14:36,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:14:36,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 40 transitions. [2023-10-12 17:14:36,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-10-12 17:14:36,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-10-12 17:14:36,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 40 transitions. [2023-10-12 17:14:36,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:36,512 INFO L219 hiAutomatonCegarLoop]: Abstraction has 23 states and 40 transitions. [2023-10-12 17:14:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 40 transitions. [2023-10-12 17:14:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-10-12 17:14:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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:14:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2023-10-12 17:14:36,514 INFO L241 hiAutomatonCegarLoop]: Abstraction has 20 states and 35 transitions. [2023-10-12 17:14:36,514 INFO L430 stractBuchiCegarLoop]: Abstraction has 20 states and 35 transitions. [2023-10-12 17:14:36,514 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:14:36,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 35 transitions. [2023-10-12 17:14:36,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:14:36,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:36,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:36,514 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1] [2023-10-12 17:14:36,514 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:36,515 INFO L748 eck$LassoCheckResult]: Stem: 638#[$Ultimate##0]don't care [59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 640#[L55]don't care [81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 636#[L55-1, $Ultimate##0]don't care [64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 620#[L55-1, L22-1]don't care [84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 622#[L22-1, $Ultimate##0, L56]don't care [93] $Ultimate##0-->L40-1: Formula: (and (= v_s_13 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_13} AuxVars[] AssignedVars[f, s] 644#[L40-1, L22-1, L56]don't care [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 646#[L40-1, L22-1, L56]don't care [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 654#[L40-1, L22-1, L56]don't care [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 652#[L40-1, L22-1, L56]don't care [95] L22-1-->L22-1: Formula: (and (< v_i_13 v_N_11) (= 1 (select v_q_26 v_q_back_46)) (= (+ v_i_13 1) v_i_12) (= v_q_back_45 (+ v_q_back_46 1))) InVars {q=v_q_26, q_back=v_q_back_46, N=v_N_11, i=v_i_13} OutVars{q=v_q_26, q_back=v_q_back_45, N=v_N_11, i=v_i_12} AuxVars[] AssignedVars[q_back, i] 648#[L40-1, L22-1, L56]don't care [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 642#[L40-1, L22-1, L56]don't care [2023-10-12 17:14:36,515 INFO L750 eck$LassoCheckResult]: Loop: 642#[L40-1, L22-1, L56]don't care [98] L40-1-->L40-1: Formula: (and (< v_q_front_49 v_q_back_69) v_f_18 (= v_j_26 (select v_q_38 v_q_front_49)) (= (+ v_q_front_49 1) v_q_front_48) (let ((.cse0 (= v_j_26 0))) (or (and v_f_17 (not .cse0)) (and .cse0 (not v_f_17)))) (= v_s_35 (+ v_j_26 v_s_36))) InVars {q=v_q_38, q_back=v_q_back_69, q_front=v_q_front_49, f=v_f_18, s=v_s_36} OutVars{q=v_q_38, q_back=v_q_back_69, j=v_j_26, f=v_f_17, q_front=v_q_front_48, s=v_s_35} AuxVars[] AssignedVars[j, f, q_front, s] 642#[L40-1, L22-1, L56]don't care [2023-10-12 17:14:36,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1016400691, now seen corresponding path program 5 times [2023-10-12 17:14:36,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55749029] [2023-10-12 17:14:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,527 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 6 times [2023-10-12 17:14:36,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816267560] [2023-10-12 17:14:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1443650251, now seen corresponding path program 6 times [2023-10-12 17:14:36,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528633586] [2023-10-12 17:14:36,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-10-12 17:14:36,789 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:14:36,792 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:36,792 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:36,792 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:36,793 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:36,793 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:36,793 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,793 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:36,793 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:36,793 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:14:36,793 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:36,793 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:36,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:14:36,877 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:36,879 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:36,881 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:36,883 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:36,884 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:37,095 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:37,095 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:37,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,099 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:14:37,116 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:14:37,117 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:14:37,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,141 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:37,146 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:37,146 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:14:37,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,147 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:14:37,150 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:14:37,174 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:37,190 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:37,190 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:37,190 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_front, q_back) = -1*q_front + 1*q_back Supporting invariants [] [2023-10-12 17:14:37,196 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:14:37,210 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:14:37,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:37,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:37,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:37,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:37,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:37,246 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:14:37,247 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:14:37,247 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 35 transitions. cyclomatic complexity: 21 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:37,258 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 35 transitions. cyclomatic complexity: 21. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 38 transitions. Complement of second has 3 states. [2023-10-12 17:14:37,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2023-10-12 17:14:37,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:37,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:37,259 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:37,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:37,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:37,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:37,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:37,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:37,293 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:14:37,294 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:14:37,294 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 35 transitions. cyclomatic complexity: 21 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:37,302 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 35 transitions. cyclomatic complexity: 21. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 38 transitions. Complement of second has 3 states. [2023-10-12 17:14:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2023-10-12 17:14:37,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:37,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:37,303 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:37,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:37,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:37,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:37,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:37,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:37,338 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:14:37,338 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:14:37,338 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 35 transitions. cyclomatic complexity: 21 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:37,347 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 35 transitions. cyclomatic complexity: 21. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 36 transitions. Complement of second has 2 states. [2023-10-12 17:14:37,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2023-10-12 17:14:37,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:37,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:37,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:14:37,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:37,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:37,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:37,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 36 transitions. [2023-10-12 17:14:37,349 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:37,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2023-10-12 17:14:37,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:14:37,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:14:37,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:14:37,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:14:37,349 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:37,350 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:37,350 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:37,350 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:14:37,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:14:37,350 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:37,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:14:37,354 INFO L201 PluginConnector]: Adding new model queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:37 BoogieIcfgContainer [2023-10-12 17:14:37,354 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:37,355 INFO L158 Benchmark]: Toolchain (without parser) took 4497.46ms. Allocated memory was 205.5MB in the beginning and 256.9MB in the end (delta: 51.4MB). Free memory was 156.8MB in the beginning and 175.1MB in the end (delta: -18.3MB). Peak memory consumption was 34.4MB. Max. memory is 8.0GB. [2023-10-12 17:14:37,355 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.28ms. Allocated memory is still 205.5MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:37,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.13ms. Allocated memory is still 205.5MB. Free memory was 156.8MB in the beginning and 155.2MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:14:37,355 INFO L158 Benchmark]: Boogie Preprocessor took 11.78ms. Allocated memory is still 205.5MB. Free memory was 155.2MB in the beginning and 154.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:37,355 INFO L158 Benchmark]: RCFGBuilder took 226.20ms. Allocated memory is still 205.5MB. Free memory was 154.1MB in the beginning and 175.7MB in the end (delta: -21.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2023-10-12 17:14:37,356 INFO L158 Benchmark]: BuchiAutomizer took 4238.41ms. Allocated memory was 205.5MB in the beginning and 256.9MB in the end (delta: 51.4MB). Free memory was 175.4MB in the beginning and 175.1MB in the end (delta: 297.1kB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. [2023-10-12 17:14:37,357 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.28ms. Allocated memory is still 205.5MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.13ms. Allocated memory is still 205.5MB. Free memory was 156.8MB in the beginning and 155.2MB in the end (delta: 1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.78ms. Allocated memory is still 205.5MB. Free memory was 155.2MB in the beginning and 154.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 226.20ms. Allocated memory is still 205.5MB. Free memory was 154.1MB in the beginning and 175.7MB in the end (delta: -21.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 4238.41ms. Allocated memory was 205.5MB in the beginning and 256.9MB in the end (delta: 51.4MB). Free memory was 175.4MB in the beginning and 175.1MB in the end (delta: 297.1kB). Peak memory consumption was 51.4MB. 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 N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 2 locations. One nondeterministic module has affine ranking function q_back + -1 * q_front and consists of 2 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 3.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations. 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, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 19 mSDtfsCounter, 107 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 lsp71 ukn97 mio100 lsp74 div100 bol114 ite100 ukn100 eq178 hnf91 smp100 dnf232 smp66 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 84ms VariablesStem: 4 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - 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.3s, 29 PlacesBefore, 18 PlacesAfterwards, 24 TransitionsBefore, 13 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 132 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 92, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 92, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 92, unknown conditional: 0, unknown unconditional: 92] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:14:37,368 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:14:37,570 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...