/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-3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:14:32,897 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:14:32,989 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:33,022 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:14:33,023 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:14:33,023 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:14:33,037 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:14:33,037 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:14:33,038 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:14:33,040 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:14:33,041 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:14:33,041 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:14:33,041 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:14:33,042 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:14:33,042 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:14:33,043 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:14:33,043 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:14:33,043 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:14:33,043 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:14:33,043 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:14:33,043 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:14:33,044 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:14:33,044 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:14:33,044 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:14:33,044 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:14:33,044 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:14:33,044 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:14:33,044 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:14:33,045 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:14:33,045 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:14:33,045 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:14:33,046 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:14:33,046 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:14:33,047 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:14:33,047 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:33,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:14:33,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:14:33,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:14:33,370 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:14:33,371 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:14:33,371 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-3.wvr.bpl [2023-10-12 17:14:33,372 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-3.wvr.bpl' [2023-10-12 17:14:33,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:14:33,398 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:14:33,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:33,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:14:33,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:14:33,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,416 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:14:33,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:33,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:14:33,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:14:33,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:14:33,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:14:33,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:14:33,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:14:33,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:14:33,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:33,447 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:33,449 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:33,473 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:14:33,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:14:33,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:14:33,474 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:14:33,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:14:33,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:14:33,474 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:14:33,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:14:33,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:14:33,475 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:14:33,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:14:33,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:14:33,476 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,513 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:14:33,514 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:14:33,605 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:14:33,621 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:14:33,621 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:14:33,622 INFO L201 PluginConnector]: Adding new model queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:33 BoogieIcfgContainer [2023-10-12 17:14:33,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:14:33,623 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:14:33,623 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:14:33,625 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:14:33,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:33,646 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/2) ... [2023-10-12 17:14:33,647 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31c2fc4b and model type queue-add-3.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,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:33,647 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:33" (2/2) ... [2023-10-12 17:14:33,649 INFO L332 chiAutomizerObserver]: Analyzing ICFG queue-add-3.wvr.bpl [2023-10-12 17:14:33,702 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:14:33,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 106 flow [2023-10-12 17:14:33,743 INFO L124 PetriNetUnfolderBase]: 3/35 cut-off events. [2023-10-12 17:14:33,744 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:33,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-10-12 17:14:33,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 41 transitions, 106 flow [2023-10-12 17:14:33,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 35 transitions, 88 flow [2023-10-12 17:14:33,753 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:14:33,762 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 35 transitions, 88 flow [2023-10-12 17:14:33,769 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 88 flow [2023-10-12 17:14:33,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 88 flow [2023-10-12 17:14:33,781 INFO L124 PetriNetUnfolderBase]: 3/35 cut-off events. [2023-10-12 17:14:33,781 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:33,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2023-10-12 17:14:33,782 INFO L119 LiptonReduction]: Number of co-enabled transitions 478 [2023-10-12 17:14:34,239 INFO L134 LiptonReduction]: Checked pairs total: 397 [2023-10-12 17:14:34,240 INFO L136 LiptonReduction]: Total number of compositions: 18 [2023-10-12 17:14:34,253 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:14:34,253 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:14:34,253 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:14:34,253 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:14:34,253 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:14:34,253 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:14:34,253 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:14:34,253 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:14:34,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:14:34,280 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:14:34,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:34,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:34,284 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:34,284 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:34,284 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:14:34,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 55 states, but on-demand construction may add more states [2023-10-12 17:14:34,288 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:14:34,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:34,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:34,289 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:34,289 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:34,292 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]don't care [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 51#[L81]don't care [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 53#[$Ultimate##0, L81-1]don't care [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 55#[L28-1, L81-1]don't care [2023-10-12 17:14:34,292 INFO L750 eck$LassoCheckResult]: Loop: 55#[L28-1, L81-1]don't care [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 55#[L28-1, L81-1]don't care [2023-10-12 17:14:34,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,295 INFO L85 PathProgramCache]: Analyzing trace with hash 123135, now seen corresponding path program 1 times [2023-10-12 17:14:34,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642961468] [2023-10-12 17:14:34,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,381 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 1 times [2023-10-12 17:14:34,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771618668] [2023-10-12 17:14:34,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash 3817330, now seen corresponding path program 1 times [2023-10-12 17:14:34,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806018452] [2023-10-12 17:14:34,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,505 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:34,505 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:34,505 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:34,506 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:34,506 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:34,506 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,506 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:34,506 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:34,506 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:14:34,506 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:34,506 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:34,517 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,529 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,531 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,538 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,597 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:34,599 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:34,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,641 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:34,642 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:34,642 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,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:34,693 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:34,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,709 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:34,710 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:34,712 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,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,734 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:34,737 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:34,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,753 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:34,756 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:34,758 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,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,784 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:34,791 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:14:34,791 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:34,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,817 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,818 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,819 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:34,859 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:34,859 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:34,860 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:14:34,863 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:34,865 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:34,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:34,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:34,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:34,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:34,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:34,898 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,917 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,919 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 55 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,994 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 55 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 143 states and 489 transitions. Complement of second has 5 states. [2023-10-12 17:14:34,996 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:35,000 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:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2023-10-12 17:14:35,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:35,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:14:35,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:14:35,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 489 transitions. [2023-10-12 17:14:35,015 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:14:35,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 103 states and 354 transitions. [2023-10-12 17:14:35,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2023-10-12 17:14:35,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2023-10-12 17:14:35,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 354 transitions. [2023-10-12 17:14:35,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:35,021 INFO L219 hiAutomatonCegarLoop]: Abstraction has 103 states and 354 transitions. [2023-10-12 17:14:35,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 354 transitions. [2023-10-12 17:14:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2023-10-12 17:14:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 3.5853658536585367) internal successors, (294), 81 states have internal predecessors, (294), 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,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 294 transitions. [2023-10-12 17:14:35,041 INFO L241 hiAutomatonCegarLoop]: Abstraction has 82 states and 294 transitions. [2023-10-12 17:14:35,042 INFO L430 stractBuchiCegarLoop]: Abstraction has 82 states and 294 transitions. [2023-10-12 17:14:35,042 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:14:35,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 294 transitions. [2023-10-12 17:14:35,044 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:14:35,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:35,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:35,044 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:35,044 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:35,044 INFO L748 eck$LassoCheckResult]: Stem: 489#[$Ultimate##0]don't care [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 485#[L81]don't care [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 487#[$Ultimate##0, L81-1]don't care [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 431#[$Ultimate##0, $Ultimate##0, L82]don't care [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 435#[L46-1, $Ultimate##0, L82]don't care [2023-10-12 17:14:35,045 INFO L750 eck$LassoCheckResult]: Loop: 435#[L46-1, $Ultimate##0, L82]don't care [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 435#[L46-1, $Ultimate##0, L82]don't care [2023-10-12 17:14:35,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,045 INFO L85 PathProgramCache]: Analyzing trace with hash 3818320, now seen corresponding path program 1 times [2023-10-12 17:14:35,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040250618] [2023-10-12 17:14:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,051 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 1 times [2023-10-12 17:14:35,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217761439] [2023-10-12 17:14:35,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,060 INFO L85 PathProgramCache]: Analyzing trace with hash 118368069, now seen corresponding path program 1 times [2023-10-12 17:14:35,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937053701] [2023-10-12 17:14:35,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,103 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,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:35,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937053701] [2023-10-12 17:14:35,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937053701] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:35,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:35,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:35,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114238934] [2023-10-12 17:14:35,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:35,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:35,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:35,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:35,175 INFO L87 Difference]: Start difference. First operand 82 states and 294 transitions. cyclomatic complexity: 248 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:35,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:35,197 INFO L93 Difference]: Finished difference Result 104 states and 340 transitions. [2023-10-12 17:14:35,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 340 transitions. [2023-10-12 17:14:35,199 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:14:35,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 104 states and 340 transitions. [2023-10-12 17:14:35,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2023-10-12 17:14:35,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2023-10-12 17:14:35,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 340 transitions. [2023-10-12 17:14:35,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:35,202 INFO L219 hiAutomatonCegarLoop]: Abstraction has 104 states and 340 transitions. [2023-10-12 17:14:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 340 transitions. [2023-10-12 17:14:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-10-12 17:14:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 3.3469387755102042) internal successors, (328), 97 states have internal predecessors, (328), 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,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 328 transitions. [2023-10-12 17:14:35,207 INFO L241 hiAutomatonCegarLoop]: Abstraction has 98 states and 328 transitions. [2023-10-12 17:14:35,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:35,208 INFO L430 stractBuchiCegarLoop]: Abstraction has 98 states and 328 transitions. [2023-10-12 17:14:35,208 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:14:35,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 328 transitions. [2023-10-12 17:14:35,210 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 23 [2023-10-12 17:14:35,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:35,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:35,210 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:14:35,210 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:35,211 INFO L748 eck$LassoCheckResult]: Stem: 779#[$Ultimate##0]don't care [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 775#[L81]don't care [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 777#[$Ultimate##0, L81-1]don't care [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 713#[$Ultimate##0, $Ultimate##0, L82]don't care [122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 657#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L83]don't care [140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t] 661#[L66-1, $Ultimate##0, $Ultimate##0, L83]don't care [2023-10-12 17:14:35,211 INFO L750 eck$LassoCheckResult]: Loop: 661#[L66-1, $Ultimate##0, $Ultimate##0, L83]don't care [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 661#[L66-1, $Ultimate##0, $Ultimate##0, L83]don't care [2023-10-12 17:14:35,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash 118367409, now seen corresponding path program 1 times [2023-10-12 17:14:35,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243953689] [2023-10-12 17:14:35,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,218 INFO L85 PathProgramCache]: Analyzing trace with hash 179, now seen corresponding path program 1 times [2023-10-12 17:14:35,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161668527] [2023-10-12 17:14:35,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,225 INFO L85 PathProgramCache]: Analyzing trace with hash -625577469, now seen corresponding path program 1 times [2023-10-12 17:14:35,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801682644] [2023-10-12 17:14:35,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,245 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,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:35,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801682644] [2023-10-12 17:14:35,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801682644] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:35,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:35,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:35,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644292623] [2023-10-12 17:14:35,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:35,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:35,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:35,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:35,293 INFO L87 Difference]: Start difference. First operand 98 states and 328 transitions. cyclomatic complexity: 267 Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:35,312 INFO L93 Difference]: Finished difference Result 133 states and 413 transitions. [2023-10-12 17:14:35,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 413 transitions. [2023-10-12 17:14:35,314 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2023-10-12 17:14:35,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 111 states and 338 transitions. [2023-10-12 17:14:35,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2023-10-12 17:14:35,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2023-10-12 17:14:35,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 338 transitions. [2023-10-12 17:14:35,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:35,316 INFO L219 hiAutomatonCegarLoop]: Abstraction has 111 states and 338 transitions. [2023-10-12 17:14:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 338 transitions. [2023-10-12 17:14:35,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2023-10-12 17:14:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 105 states have internal predecessors, (327), 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,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 327 transitions. [2023-10-12 17:14:35,321 INFO L241 hiAutomatonCegarLoop]: Abstraction has 106 states and 327 transitions. [2023-10-12 17:14:35,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:35,322 INFO L430 stractBuchiCegarLoop]: Abstraction has 106 states and 327 transitions. [2023-10-12 17:14:35,322 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:14:35,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 327 transitions. [2023-10-12 17:14:35,323 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2023-10-12 17:14:35,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:35,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:35,324 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:35,324 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:35,324 INFO L748 eck$LassoCheckResult]: Stem: 1108#[$Ultimate##0]don't care [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 1102#[L81]don't care [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 1104#[$Ultimate##0, L81-1]don't care [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 1010#[L28-1, L81-1]don't care [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 1014#[$Ultimate##0, L28-1, L82]don't care [146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back] 978#[$Ultimate##0, thread1EXIT, L82]don't care [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 980#[thread1EXIT, L46-1, L82]don't care [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 1100#[thread1EXIT, L46-1, L82]don't care [2023-10-12 17:14:35,324 INFO L750 eck$LassoCheckResult]: Loop: 1100#[thread1EXIT, L46-1, L82]don't care [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 1100#[thread1EXIT, L46-1, L82]don't care [2023-10-12 17:14:35,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2052566775, now seen corresponding path program 1 times [2023-10-12 17:14:35,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788174010] [2023-10-12 17:14:35,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,338 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 2 times [2023-10-12 17:14:35,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474319869] [2023-10-12 17:14:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash -794939266, now seen corresponding path program 2 times [2023-10-12 17:14:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424857866] [2023-10-12 17:14:35,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:35,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:35,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424857866] [2023-10-12 17:14:35,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424857866] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:14:35,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892033137] [2023-10-12 17:14:35,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:14:35,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:14:35,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:14:35,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-10-12 17:14:35,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:14:35,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:14:35,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:35,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:35,472 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,474 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:14:35,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892033137] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:35,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:14:35,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-10-12 17:14:35,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707356318] [2023-10-12 17:14:35,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:35,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:35,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:14:35,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-10-12 17:14:35,542 INFO L87 Difference]: Start difference. First operand 106 states and 327 transitions. cyclomatic complexity: 251 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:35,581 INFO L93 Difference]: Finished difference Result 202 states and 608 transitions. [2023-10-12 17:14:35,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 608 transitions. [2023-10-12 17:14:35,585 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 29 [2023-10-12 17:14:35,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 193 states and 579 transitions. [2023-10-12 17:14:35,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2023-10-12 17:14:35,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2023-10-12 17:14:35,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 579 transitions. [2023-10-12 17:14:35,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:35,590 INFO L219 hiAutomatonCegarLoop]: Abstraction has 193 states and 579 transitions. [2023-10-12 17:14:35,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 579 transitions. [2023-10-12 17:14:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 163. [2023-10-12 17:14:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 163 states have (on average 3.1901840490797544) internal successors, (520), 162 states have internal predecessors, (520), 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,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 520 transitions. [2023-10-12 17:14:35,610 INFO L241 hiAutomatonCegarLoop]: Abstraction has 163 states and 520 transitions. [2023-10-12 17:14:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:14:35,614 INFO L430 stractBuchiCegarLoop]: Abstraction has 163 states and 520 transitions. [2023-10-12 17:14:35,614 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:14:35,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 520 transitions. [2023-10-12 17:14:35,616 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2023-10-12 17:14:35,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:35,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:35,616 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:35,616 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:35,617 INFO L748 eck$LassoCheckResult]: Stem: 1579#[$Ultimate##0]don't care [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 1573#[L81]don't care [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 1575#[$Ultimate##0, L81-1]don't care [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 1457#[L28-1, L81-1]don't care [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 1461#[$Ultimate##0, L28-1, L82]don't care [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 1687#[$Ultimate##0, L28-1, L82]don't care [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 1547#[$Ultimate##0, L28-1, L82]don't care [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 1545#[L46-1, L28-1, L82]don't care [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 1669#[L46-1, L28-1, L82]don't care [2023-10-12 17:14:35,617 INFO L750 eck$LassoCheckResult]: Loop: 1669#[L46-1, L28-1, L82]don't care [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 1669#[L46-1, L28-1, L82]don't care [2023-10-12 17:14:35,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash -794967321, now seen corresponding path program 1 times [2023-10-12 17:14:35,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627900353] [2023-10-12 17:14:35,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,635 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 3 times [2023-10-12 17:14:35,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804917868] [2023-10-12 17:14:35,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1125816974, now seen corresponding path program 2 times [2023-10-12 17:14:35,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844646770] [2023-10-12 17:14:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,898 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:35,898 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:35,898 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:35,899 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:35,899 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:35,899 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,899 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:35,899 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:35,899 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:14:35,899 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:35,899 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:35,902 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,904 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,905 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,907 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,909 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,978 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:36,185 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:36,186 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:36,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,201 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:36,202 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:36,203 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,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:36,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:14:36,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,238 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:36,240 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:36,241 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,243 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:36,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:36,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:14:36,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,295 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:36,297 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:36,298 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,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:36,326 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:36,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,327 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:36,344 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:36,346 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,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:36,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:36,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,391 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:36,391 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:36,395 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,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:36,417 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:36,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,419 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:36,423 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:36,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:36,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,458 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:36,462 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:36,463 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:36,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,464 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,474 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,475 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:36,496 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:36,496 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:36,496 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:14:36,499 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,503 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:14:36,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:36,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:36,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:36,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:36,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:36,535 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,535 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,535 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 520 transitions. cyclomatic complexity: 397 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,562 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 520 transitions. cyclomatic complexity: 397. 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 302 states and 944 transitions. Complement of second has 5 states. [2023-10-12 17:14:36,563 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:36,563 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,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2023-10-12 17:14:36,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:36,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:36,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:36,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 302 states and 944 transitions. [2023-10-12 17:14:36,567 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:14:36,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 302 states to 264 states and 805 transitions. [2023-10-12 17:14:36,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2023-10-12 17:14:36,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2023-10-12 17:14:36,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 264 states and 805 transitions. [2023-10-12 17:14:36,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:36,570 INFO L219 hiAutomatonCegarLoop]: Abstraction has 264 states and 805 transitions. [2023-10-12 17:14:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states and 805 transitions. [2023-10-12 17:14:36,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 200. [2023-10-12 17:14:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 200 states have (on average 3.25) internal successors, (650), 199 states have internal predecessors, (650), 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,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 650 transitions. [2023-10-12 17:14:36,581 INFO L241 hiAutomatonCegarLoop]: Abstraction has 200 states and 650 transitions. [2023-10-12 17:14:36,581 INFO L430 stractBuchiCegarLoop]: Abstraction has 200 states and 650 transitions. [2023-10-12 17:14:36,581 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:14:36,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 650 transitions. [2023-10-12 17:14:36,583 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 22 [2023-10-12 17:14:36,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:36,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:36,583 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:36,583 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:36,584 INFO L748 eck$LassoCheckResult]: Stem: 2261#[$Ultimate##0]don't care [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 2253#[L81]don't care [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 2255#[$Ultimate##0, L81-1]don't care [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 2145#[L28-1, L81-1]don't care [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 2147#[$Ultimate##0, L28-1, L82]don't care [146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back] 2097#[$Ultimate##0, thread1EXIT, L82]don't care [122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 2099#[$Ultimate##0, thread1EXIT, $Ultimate##0, L83]don't care [140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t] 2105#[L66-1, thread1EXIT, $Ultimate##0, L83]don't care [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 2187#[L66-1, thread1EXIT, L46-1, L83]don't care [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 2189#[L66-1, thread1EXIT, L46-1, L83]don't care [2023-10-12 17:14:36,584 INFO L750 eck$LassoCheckResult]: Loop: 2189#[L66-1, thread1EXIT, L46-1, L83]don't care [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 2189#[L66-1, thread1EXIT, L46-1, L83]don't care [2023-10-12 17:14:36,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1126052233, now seen corresponding path program 1 times [2023-10-12 17:14:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345172082] [2023-10-12 17:14:36,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,611 INFO L85 PathProgramCache]: Analyzing trace with hash 179, now seen corresponding path program 2 times [2023-10-12 17:14:36,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608074834] [2023-10-12 17:14:36,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash 547881003, now seen corresponding path program 1 times [2023-10-12 17:14:36,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032313972] [2023-10-12 17:14:36,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,870 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:36,870 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:36,870 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:36,870 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:36,870 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:36,871 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,871 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:36,871 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:36,871 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:14:36,871 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:36,871 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:36,872 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,875 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,880 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,882 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:36,886 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,888 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,890 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,892 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,193 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:37,193 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:37,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,207 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:37,208 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:37,213 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,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:37,242 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:37,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,243 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,245 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,246 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,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:37,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:14:37,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,273 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,286 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,287 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,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:37,324 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,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,334 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:37,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:14:37,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:37,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:37,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:37,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,368 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:37,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:14:37,373 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,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:37,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:37,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,413 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:37,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:14:37,416 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,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:37,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:37,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,465 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:37,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:14:37,468 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,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:37,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:37,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,496 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:37,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:14:37,500 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,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,523 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:37,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:37,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,547 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:37,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:14:37,552 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,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:37,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:37,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,568 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:37,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:14:37,571 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,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,579 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:14:37,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,604 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:14:37,604 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:14:37,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:37,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:37,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,654 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:37,657 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,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:14:37,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:37,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:37,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,697 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:37,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:14:37,700 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,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,723 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:37,732 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:14:37,732 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:14:37,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,735 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:37,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:14:37,760 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:37,767 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:37,767 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:37,767 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2023-10-12 17:14:37,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:37,775 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:14:37,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:37,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:37,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:37,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:37,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:37,811 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,811 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 650 transitions. cyclomatic complexity: 505 Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:37,840 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 650 transitions. cyclomatic complexity: 505. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 444 states and 1451 transitions. Complement of second has 5 states. [2023-10-12 17:14:37,840 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:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2023-10-12 17:14:37,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:37,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:37,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:37,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:37,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:37,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:37,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 444 states and 1451 transitions. [2023-10-12 17:14:37,845 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 22 [2023-10-12 17:14:37,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 444 states to 341 states and 1033 transitions. [2023-10-12 17:14:37,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2023-10-12 17:14:37,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 146 [2023-10-12 17:14:37,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 341 states and 1033 transitions. [2023-10-12 17:14:37,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:37,848 INFO L219 hiAutomatonCegarLoop]: Abstraction has 341 states and 1033 transitions. [2023-10-12 17:14:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states and 1033 transitions. [2023-10-12 17:14:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 291. [2023-10-12 17:14:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 291 states have (on average 3.1030927835051547) internal successors, (903), 290 states have internal predecessors, (903), 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,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 903 transitions. [2023-10-12 17:14:37,853 INFO L241 hiAutomatonCegarLoop]: Abstraction has 291 states and 903 transitions. [2023-10-12 17:14:37,853 INFO L430 stractBuchiCegarLoop]: Abstraction has 291 states and 903 transitions. [2023-10-12 17:14:37,853 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:14:37,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states and 903 transitions. [2023-10-12 17:14:37,855 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 22 [2023-10-12 17:14:37,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:37,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:37,855 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1] [2023-10-12 17:14:37,855 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:37,856 INFO L748 eck$LassoCheckResult]: Stem: 3170#[$Ultimate##0]don't care [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 3160#[L81]don't care [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 3162#[$Ultimate##0, L81-1]don't care [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 3030#[L28-1, L81-1]don't care [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 3032#[$Ultimate##0, L28-1, L82]don't care [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 3130#[$Ultimate##0, L28-1, L82]don't care [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 3246#[$Ultimate##0, L28-1, L82]don't care [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 3316#[L46-1, L28-1, L82]don't care [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 3338#[L46-1, L28-1, L82]don't care [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 3396#[L46-1, L28-1, L82]don't care [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 3300#[L46-1, L28-1, L82]don't care [2023-10-12 17:14:37,856 INFO L750 eck$LassoCheckResult]: Loop: 3300#[L46-1, L28-1, L82]don't care [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 3300#[L46-1, L28-1, L82]don't care [2023-10-12 17:14:37,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,856 INFO L85 PathProgramCache]: Analyzing trace with hash 540587851, now seen corresponding path program 3 times [2023-10-12 17:14:37,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:37,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628464356] [2023-10-12 17:14:37,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:37,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:37,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,896 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 4 times [2023-10-12 17:14:37,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:37,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374542217] [2023-10-12 17:14:37,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:37,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:37,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,900 INFO L85 PathProgramCache]: Analyzing trace with hash -421645654, now seen corresponding path program 4 times [2023-10-12 17:14:37,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:37,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364064558] [2023-10-12 17:14:37,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:37,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:37,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:37,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:38,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-10-12 17:14:38,285 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:38,285 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:38,285 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:38,285 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:38,285 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:38,285 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,285 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:38,285 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:38,285 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:14:38,285 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:38,285 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:38,287 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:38,428 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:38,430 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:38,432 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:38,434 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:38,436 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:38,756 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:38,756 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:38,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,762 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:38,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:14:38,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:38,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:38,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,782 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:38,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:14:38,785 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:38,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,792 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:14:38,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,844 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:14:38,845 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:14:38,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:38,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,918 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:38,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-10-12 17:14:38,920 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:38,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,928 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,933 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:38,938 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:14:38,938 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:14:38,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,939 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:38,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-10-12 17:14:38,942 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:38,949 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:38,949 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:38,949 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:14:38,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:38,960 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-10-12 17:14:38,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:38,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:38,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:39,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:39,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:39,008 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:39,009 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:39,009 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 291 states and 903 transitions. cyclomatic complexity: 685 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:39,043 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 291 states and 903 transitions. cyclomatic complexity: 685. 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 428 states and 1215 transitions. Complement of second has 5 states. [2023-10-12 17:14:39,043 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:39,044 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:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2023-10-12 17:14:39,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:39,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,044 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:39,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:39,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:39,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:39,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:39,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:39,072 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:39,072 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:39,072 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 291 states and 903 transitions. cyclomatic complexity: 685 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:39,093 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 291 states and 903 transitions. cyclomatic complexity: 685. 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 428 states and 1215 transitions. Complement of second has 5 states. [2023-10-12 17:14:39,094 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:39,095 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:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2023-10-12 17:14:39,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:39,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,095 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:39,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:39,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:39,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:39,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:39,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:39,126 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:39,126 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:39,126 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 291 states and 903 transitions. cyclomatic complexity: 685 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:39,156 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 291 states and 903 transitions. cyclomatic complexity: 685. 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 492 states and 1481 transitions. Complement of second has 4 states. [2023-10-12 17:14:39,156 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:39,156 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:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2023-10-12 17:14:39,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:39,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:14:39,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:39,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 492 states and 1481 transitions. [2023-10-12 17:14:39,160 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2023-10-12 17:14:39,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 492 states to 353 states and 1045 transitions. [2023-10-12 17:14:39,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2023-10-12 17:14:39,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2023-10-12 17:14:39,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 353 states and 1045 transitions. [2023-10-12 17:14:39,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:39,163 INFO L219 hiAutomatonCegarLoop]: Abstraction has 353 states and 1045 transitions. [2023-10-12 17:14:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states and 1045 transitions. [2023-10-12 17:14:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 269. [2023-10-12 17:14:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 269 states have (on average 3.037174721189591) internal successors, (817), 268 states have internal predecessors, (817), 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:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 817 transitions. [2023-10-12 17:14:39,168 INFO L241 hiAutomatonCegarLoop]: Abstraction has 269 states and 817 transitions. [2023-10-12 17:14:39,168 INFO L430 stractBuchiCegarLoop]: Abstraction has 269 states and 817 transitions. [2023-10-12 17:14:39,168 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:14:39,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states and 817 transitions. [2023-10-12 17:14:39,169 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2023-10-12 17:14:39,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:39,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:39,170 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:39,170 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:39,170 INFO L748 eck$LassoCheckResult]: Stem: 5217#[$Ultimate##0]don't care [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 5209#[L81]don't care [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 5211#[$Ultimate##0, L81-1]don't care [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 5109#[L28-1, L81-1]don't care [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 5111#[$Ultimate##0, L28-1, L82]don't care [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 5173#[$Ultimate##0, L28-1, L82]don't care [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 5245#[$Ultimate##0, L28-1, L82]don't care [122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 5257#[$Ultimate##0, $Ultimate##0, L28-1, L83]don't care [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 5353#[$Ultimate##0, L28-1, L46-1, L83]don't care [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 5405#[$Ultimate##0, L28-1, L46-1, L83]don't care [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 5415#[$Ultimate##0, L28-1, L46-1, L83]don't care [140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t] 5413#[L66-1, L28-1, L46-1, L83]don't care [2023-10-12 17:14:39,170 INFO L750 eck$LassoCheckResult]: Loop: 5413#[L66-1, L28-1, L46-1, L83]don't care [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 5413#[L66-1, L28-1, L46-1, L83]don't care [2023-10-12 17:14:39,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash -441214506, now seen corresponding path program 1 times [2023-10-12 17:14:39,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:39,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755672799] [2023-10-12 17:14:39,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:39,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,181 INFO L85 PathProgramCache]: Analyzing trace with hash 179, now seen corresponding path program 3 times [2023-10-12 17:14:39,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:39,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656848417] [2023-10-12 17:14:39,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:39,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:39,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash -792747650, now seen corresponding path program 1 times [2023-10-12 17:14:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:39,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215031181] [2023-10-12 17:14:39,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:39,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-10-12 17:14:39,597 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:39,597 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:39,597 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:39,597 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:39,597 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:39,597 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,597 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:39,598 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:39,598 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:14:39,598 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:39,598 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:39,600 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:39,603 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:39,605 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:39,607 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:39,618 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:39,620 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:39,622 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:39,624 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:39,626 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:39,628 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:40,034 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:40,034 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:40,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,035 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:40,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-10-12 17:14:40,039 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:40,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-10-12 17:14:40,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,056 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:40,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-10-12 17:14:40,060 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:40,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-10-12 17:14:40,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,095 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:40,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-10-12 17:14:40,098 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:40,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:40,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,118 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:40,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-10-12 17:14:40,123 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:40,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:40,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,136 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:40,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-10-12 17:14:40,188 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:40,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:40,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,209 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:40,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-10-12 17:14:40,213 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:40,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-10-12 17:14:40,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,237 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:40,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-10-12 17:14:40,240 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:40,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:40,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,259 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:40,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-10-12 17:14:40,263 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:40,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:40,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,285 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:40,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-10-12 17:14:40,328 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:40,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:40,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,451 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:40,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-10-12 17:14:40,454 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:40,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,462 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:14:40,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,510 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:14:40,510 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:14:40,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:40,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,604 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:40,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-10-12 17:14:40,607 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:40,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:40,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,652 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:40,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-10-12 17:14:40,678 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:40,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,696 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:40,703 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:14:40,703 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:14:40,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,717 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:40,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-10-12 17:14:40,721 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:40,747 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:40,748 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:40,748 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2023-10-12 17:14:40,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:40,774 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2023-10-12 17:14:40,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:40,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:40,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:40,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:40,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:40,802 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:40,802 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:40,802 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 269 states and 817 transitions. cyclomatic complexity: 604 Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:40,823 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 269 states and 817 transitions. cyclomatic complexity: 604. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 469 states and 1381 transitions. Complement of second has 5 states. [2023-10-12 17:14:40,823 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:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2023-10-12 17:14:40,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:14:40,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:40,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 12 letters. Loop has 1 letters. [2023-10-12 17:14:40,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:40,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:14:40,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:40,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 469 states and 1381 transitions. [2023-10-12 17:14:40,827 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2023-10-12 17:14:40,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 469 states to 375 states and 1035 transitions. [2023-10-12 17:14:40,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2023-10-12 17:14:40,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2023-10-12 17:14:40,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 375 states and 1035 transitions. [2023-10-12 17:14:40,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:40,830 INFO L219 hiAutomatonCegarLoop]: Abstraction has 375 states and 1035 transitions. [2023-10-12 17:14:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states and 1035 transitions. [2023-10-12 17:14:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 279. [2023-10-12 17:14:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 279 states have (on average 2.899641577060932) internal successors, (809), 278 states have internal predecessors, (809), 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:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 809 transitions. [2023-10-12 17:14:40,835 INFO L241 hiAutomatonCegarLoop]: Abstraction has 279 states and 809 transitions. [2023-10-12 17:14:40,835 INFO L430 stractBuchiCegarLoop]: Abstraction has 279 states and 809 transitions. [2023-10-12 17:14:40,835 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:14:40,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 809 transitions. [2023-10-12 17:14:40,837 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2023-10-12 17:14:40,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:40,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:40,837 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:40,837 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:40,837 INFO L748 eck$LassoCheckResult]: Stem: 6273#[$Ultimate##0]don't care [93] $Ultimate##0-->L81: Formula: (and (<= 0 v_N_4) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} OutVars{q1_front=v_q1_front_5, N=v_N_4, q1_back=v_q1_back_8, q2_front=v_q2_front_1, q2_back=v_q2_back_4} AuxVars[] AssignedVars[] 6265#[L81]don't care [125] L81-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 6267#[$Ultimate##0, L81-1]don't care [96] $Ultimate##0-->L28-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 6175#[L28-1, L81-1]don't care [128] L81-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0] 6177#[$Ultimate##0, L28-1, L82]don't care [145] L28-1-->L28-1: Formula: (and (= (select v_q1_20 v_q1_back_34) 1) (= (+ 1 v_q1_back_34) v_q1_back_33) (< v_i_13 v_N_15) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_20, N=v_N_15, i=v_i_13, q1_back=v_q1_back_34} OutVars{q1=v_q1_20, N=v_N_15, i=v_i_12, q1_back=v_q1_back_33} AuxVars[] AssignedVars[i, q1_back] 6229#[$Ultimate##0, L28-1, L82]don't care [122] L82-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork0_thidvar2_2) (= 3 v_thread3Thread1of1ForFork0_thidvar0_2) (= 3 v_thread3Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 6301#[$Ultimate##0, $Ultimate##0, L28-1, L83]don't care [140] $Ultimate##0-->L66-1: Formula: (and (= v_t_13 0) v_g_11) InVars {} OutVars{g=v_g_11, t=v_t_13} AuxVars[] AssignedVars[g, t] 6289#[L66-1, $Ultimate##0, L28-1, L83]don't care [143] $Ultimate##0-->L46-1: Formula: (and (= v_s_8 0) v_f_9) InVars {} OutVars{f=v_f_9, s=v_s_8} AuxVars[] AssignedVars[f, s] 6291#[L66-1, L28-1, L46-1, L83]don't care [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 6525#[L66-1, L28-1, L46-1, L83]don't care [146] L28-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (+ 1 v_q1_back_42) v_q1_back_41) (= (select v_q1_24 v_q1_back_42) 0)) InVars {q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_42} OutVars{q1=v_q1_24, N=v_N_19, i=v_i_18, q1_back=v_q1_back_41} AuxVars[] AssignedVars[q1_back] 6641#[L66-1, thread1EXIT, L46-1, L83]don't care [149] L46-1-->L46-1: Formula: (and (= v_j_31 (select v_q1_30 v_q1_front_35)) (= v_q2_back_38 (+ v_q2_back_39 1)) v_f_22 (= v_j_31 (select v_q2_23 v_q2_back_39)) (< v_q1_front_35 v_q1_back_53) (let ((.cse0 (= v_j_31 0))) (or (and v_f_21 (not .cse0)) (and .cse0 (not v_f_21)))) (= (+ v_q1_front_35 1) v_q1_front_34) (= v_s_22 (+ v_j_31 v_s_23))) InVars {q1_front=v_q1_front_35, q1=v_q1_30, q2=v_q2_23, q2_back=v_q2_back_39, f=v_f_22, s=v_s_23, q1_back=v_q1_back_53} OutVars{q1_front=v_q1_front_34, q1=v_q1_30, q2=v_q2_23, j=v_j_31, q2_back=v_q2_back_38, f=v_f_21, s=v_s_22, q1_back=v_q1_back_53} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 6317#[L66-1, thread1EXIT, L46-1, L83]don't care [2023-10-12 17:14:40,837 INFO L750 eck$LassoCheckResult]: Loop: 6317#[L66-1, thread1EXIT, L46-1, L83]don't care [148] L66-1-->L66-1: Formula: (and (< v_q2_front_29 v_q2_back_36) (= v_t_15 (+ v_k_18 v_t_16)) (= (select v_q2_21 v_q2_front_29) v_k_18) v_g_18 (= v_q2_front_28 (+ v_q2_front_29 1)) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, q2_back=v_q2_back_36, g=v_g_18, t=v_t_16, q2_front=v_q2_front_29} OutVars{q2=v_q2_21, k=v_k_18, q2_back=v_q2_back_36, g=v_g_17, t=v_t_15, q2_front=v_q2_front_28} AuxVars[] AssignedVars[k, g, t, q2_front] 6317#[L66-1, thread1EXIT, L46-1, L83]don't care [2023-10-12 17:14:40,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1083061685, now seen corresponding path program 1 times [2023-10-12 17:14:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:40,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498246726] [2023-10-12 17:14:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:40,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:40,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash 179, now seen corresponding path program 4 times [2023-10-12 17:14:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131226315] [2023-10-12 17:14:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:40,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:40,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash 784826281, now seen corresponding path program 1 times [2023-10-12 17:14:40,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:40,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976506493] [2023-10-12 17:14:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:40,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:41,154 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:41,155 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:41,155 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:41,155 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:41,155 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:41,155 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,155 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:41,155 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:41,155 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3.wvr.bpl_BEv2_Iteration9_Lasso [2023-10-12 17:14:41,155 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:41,155 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:41,156 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:41,158 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:41,160 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:41,162 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:41,163 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:41,166 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:41,168 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:41,258 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:41,260 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:41,261 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:41,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:41,558 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:41,558 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:41,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,559 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:41,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-10-12 17:14:41,562 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:41,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:41,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,575 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:41,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-10-12 17:14:41,578 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:41,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-10-12 17:14:41,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,590 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:41,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-10-12 17:14:41,594 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:41,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:41,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,608 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:41,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-10-12 17:14:41,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:41,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-10-12 17:14:41,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,632 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:41,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-10-12 17:14:41,636 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:41,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,643 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,643 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-10-12 17:14:41,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,649 INFO L229 MonitoredProcess]: Starting monitored process 49 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:41,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-10-12 17:14:41,652 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:41,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2023-10-12 17:14:41,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,664 INFO L229 MonitoredProcess]: Starting monitored process 50 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:41,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-10-12 17:14:41,667 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:41,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,705 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:41,712 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:14:41,712 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:41,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,713 INFO L229 MonitoredProcess]: Starting monitored process 51 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:41,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-10-12 17:14:41,716 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:41,737 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:41,737 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:41,737 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2023-10-12 17:14:41,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:41,746 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-10-12 17:14:41,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:41,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:41,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:41,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:41,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:41,775 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:41,775 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 279 states and 809 transitions. cyclomatic complexity: 592 Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:41,796 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 279 states and 809 transitions. cyclomatic complexity: 592. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 465 states and 1268 transitions. Complement of second has 5 states. [2023-10-12 17:14:41,796 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:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2023-10-12 17:14:41,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:14:41,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:41,797 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:41,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:41,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:41,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:41,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:41,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:41,824 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:41,824 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:41,824 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 279 states and 809 transitions. cyclomatic complexity: 592 Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:41,840 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 279 states and 809 transitions. cyclomatic complexity: 592. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 465 states and 1268 transitions. Complement of second has 5 states. [2023-10-12 17:14:41,841 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:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2023-10-12 17:14:41,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:14:41,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:41,841 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:41,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:41,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:41,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:41,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:41,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:41,871 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:41,871 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:41,871 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 279 states and 809 transitions. cyclomatic complexity: 592 Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:41,895 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 279 states and 809 transitions. cyclomatic complexity: 592. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 573 states and 1652 transitions. Complement of second has 5 states. [2023-10-12 17:14:41,895 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:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2023-10-12 17:14:41,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:14:41,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:41,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 12 letters. Loop has 1 letters. [2023-10-12 17:14:41,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:41,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:14:41,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:41,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 573 states and 1652 transitions. [2023-10-12 17:14:41,899 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:41,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 573 states to 0 states and 0 transitions. [2023-10-12 17:14:41,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:14:41,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:14:41,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:14:41,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:14:41,900 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:41,900 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:41,900 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:41,900 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:14:41,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:14:41,900 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:41,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:14:41,904 INFO L201 PluginConnector]: Adding new model queue-add-3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:41 BoogieIcfgContainer [2023-10-12 17:14:41,904 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:41,905 INFO L158 Benchmark]: Toolchain (without parser) took 8506.17ms. Allocated memory was 165.7MB in the beginning and 367.0MB in the end (delta: 201.3MB). Free memory was 115.1MB in the beginning and 270.1MB in the end (delta: -155.0MB). Peak memory consumption was 46.9MB. Max. memory is 8.0GB. [2023-10-12 17:14:41,905 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 165.7MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:41,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.50ms. Allocated memory is still 165.7MB. Free memory was 114.9MB in the beginning and 113.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:14:41,905 INFO L158 Benchmark]: Boogie Preprocessor took 11.35ms. Allocated memory is still 165.7MB. Free memory was 113.4MB in the beginning and 112.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:41,905 INFO L158 Benchmark]: RCFGBuilder took 193.32ms. Allocated memory is still 165.7MB. Free memory was 112.2MB in the beginning and 101.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:14:41,905 INFO L158 Benchmark]: BuchiAutomizer took 8281.21ms. Allocated memory was 165.7MB in the beginning and 367.0MB in the end (delta: 201.3MB). Free memory was 101.2MB in the beginning and 270.1MB in the end (delta: -168.9MB). Peak memory consumption was 33.3MB. Max. memory is 8.0GB. [2023-10-12 17:14:41,906 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25ms. Allocated memory is still 165.7MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.50ms. Allocated memory is still 165.7MB. Free memory was 114.9MB in the beginning and 113.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.35ms. Allocated memory is still 165.7MB. Free memory was 113.4MB in the beginning and 112.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 193.32ms. Allocated memory is still 165.7MB. Free memory was 112.2MB in the beginning and 101.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 8281.21ms. Allocated memory was 165.7MB in the beginning and 367.0MB in the end (delta: 201.3MB). Free memory was 101.2MB in the beginning and 270.1MB in the end (delta: -168.9MB). Peak memory consumption was 33.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (3 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One nondeterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One nondeterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 10 iterations. TraceHistogramMax:3. Analysis of lassos took 6.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 356 StatesRemovedByMinimization, 8 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, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 237 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 366 IncrementalHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 27 mSDtfsCounter, 366 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital104 mio100 ax100 hnf100 lsp74 ukn98 mio100 lsp69 div100 bol110 ite100 ukn100 eq191 hnf90 smp100 dnf222 smp67 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 79ms VariablesStem: 10 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s - 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.5s, 42 PlacesBefore, 25 PlacesAfterwards, 35 TransitionsBefore, 18 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 18 TotalNumberOfCompositions, 397 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 381, independent: 375, independent conditional: 0, independent unconditional: 375, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 301, independent: 295, independent conditional: 0, independent unconditional: 295, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 301, independent: 292, independent conditional: 0, independent unconditional: 292, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 381, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 301, unknown conditional: 0, unknown unconditional: 301] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, 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:41,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:42,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:42,322 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...