/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/prod-cons3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:14:32,866 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:14:32,906 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:14:32,927 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:14:32,927 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:14:32,928 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:14:32,929 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:14:32,929 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:14:32,929 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:14:32,929 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:14:32,930 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:14:32,930 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:14:32,930 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:14:32,930 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:14:32,931 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:14:32,931 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:14:32,931 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:14:32,931 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:14:32,931 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:14:32,932 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:14:32,932 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:14:32,932 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:14:32,933 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:14:32,933 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:14:32,933 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:14:32,933 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:14:32,934 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:14:32,934 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:14:32,934 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:14:32,934 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:14:32,934 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:14:32,935 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:14:32,935 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:14:32,936 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:14:32,936 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,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:14:33,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:14:33,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:14:33,143 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:14:33,146 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:14:33,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl [2023-10-12 17:14:33,149 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl' [2023-10-12 17:14:33,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:14:33,185 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:14:33,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:33,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:14:33,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:14:33,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,210 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:14:33,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:33,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:14:33,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:14:33,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:14:33,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:14:33,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:14:33,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:14:33,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:14:33,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/1) ... [2023-10-12 17:14:33,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:33,249 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,266 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,277 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:14:33,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:14:33,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:14:33,277 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:14:33,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:14:33,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:14:33,278 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:14:33,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:14:33,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:14:33,278 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:14:33,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:14:33,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:14:33,278 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:14:33,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:14:33,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:14:33,279 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,318 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:14:33,320 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:14:33,423 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:14:33,447 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:14:33,447 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:14:33,449 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:33 BoogieIcfgContainer [2023-10-12 17:14:33,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:14:33,450 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:14:33,450 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:14:33,453 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:14:33,454 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:33,454 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:33" (1/2) ... [2023-10-12 17:14:33,455 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@541d4c36 and model type prod-cons3.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,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:33,455 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:33" (2/2) ... [2023-10-12 17:14:33,456 INFO L332 chiAutomizerObserver]: Analyzing ICFG prod-cons3.wvr.bpl [2023-10-12 17:14:33,515 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:14:33,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 120 flow [2023-10-12 17:14:33,555 INFO L124 PetriNetUnfolderBase]: 3/36 cut-off events. [2023-10-12 17:14:33,555 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:14:33,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 3/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2023-10-12 17:14:33,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 44 transitions, 120 flow [2023-10-12 17:14:33,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 96 flow [2023-10-12 17:14:33,565 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:14:33,575 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 36 transitions, 96 flow [2023-10-12 17:14:33,577 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 36 transitions, 96 flow [2023-10-12 17:14:33,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 36 transitions, 96 flow [2023-10-12 17:14:33,584 INFO L124 PetriNetUnfolderBase]: 3/36 cut-off events. [2023-10-12 17:14:33,585 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:14:33,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 36 events. 3/36 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2023-10-12 17:14:33,586 INFO L119 LiptonReduction]: Number of co-enabled transitions 342 [2023-10-12 17:14:34,020 INFO L134 LiptonReduction]: Checked pairs total: 542 [2023-10-12 17:14:34,021 INFO L136 LiptonReduction]: Total number of compositions: 17 [2023-10-12 17:14:34,034 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:14:34,034 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:14:34,034 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:14:34,034 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:14:34,034 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:14:34,034 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:14:34,034 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:14:34,035 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:14:34,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:14:34,071 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 77 [2023-10-12 17:14:34,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:34,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:34,075 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:34,076 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:34,076 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:14:34,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 92 states, but on-demand construction may add more states [2023-10-12 17:14:34,080 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 77 [2023-10-12 17:14:34,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:34,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:34,081 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:34,081 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:34,084 INFO L748 eck$LassoCheckResult]: Stem: 53#[$Ultimate##0]don't care [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 56#[L80]don't care [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 58#[L80-1, L26]don't care [2023-10-12 17:14:34,084 INFO L750 eck$LassoCheckResult]: Loop: 58#[L80-1, L26]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 58#[L80-1, L26]don't care [2023-10-12 17:14:34,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,088 INFO L85 PathProgramCache]: Analyzing trace with hash 5507, now seen corresponding path program 1 times [2023-10-12 17:14:34,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421004941] [2023-10-12 17:14:34,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash 173, now seen corresponding path program 1 times [2023-10-12 17:14:34,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652509663] [2023-10-12 17:14:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,219 INFO L85 PathProgramCache]: Analyzing trace with hash 170859, now seen corresponding path program 1 times [2023-10-12 17:14:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050484328] [2023-10-12 17:14:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,327 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:34,327 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:34,328 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:34,328 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:34,328 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:34,328 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,328 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:34,328 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:34,328 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:14:34,328 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:34,328 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:34,338 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,362 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,364 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,366 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,377 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,379 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:34,381 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,478 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:34,481 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:34,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,484 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,495 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,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,505 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,509 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,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:34,524 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,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,526 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,528 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,529 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,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:34,558 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,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,560 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,563 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,564 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,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:34,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:34,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,605 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,623 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,623 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,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,653 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:34,674 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:34,674 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:14:34,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,683 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:34,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:14:34,734 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:34,743 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:34,743 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:34,744 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(w) = 1*w Supporting invariants [] [2023-10-12 17:14:34,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:14:34,750 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:34,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:34,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:34,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:34,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:34,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:34,797 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,824 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,825 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 92 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:34,884 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 92 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 273 states and 1033 transitions. Complement of second has 5 states. [2023-10-12 17:14:34,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2023-10-12 17:14:34,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:14:34,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:34,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:34,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:34,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:14:34,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:34,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 1033 transitions. [2023-10-12 17:14:34,901 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 72 [2023-10-12 17:14:34,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 187 states and 718 transitions. [2023-10-12 17:14:34,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2023-10-12 17:14:34,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2023-10-12 17:14:34,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 718 transitions. [2023-10-12 17:14:34,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:34,910 INFO L219 hiAutomatonCegarLoop]: Abstraction has 187 states and 718 transitions. [2023-10-12 17:14:34,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 718 transitions. [2023-10-12 17:14:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 133. [2023-10-12 17:14:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 4.022556390977444) internal successors, (535), 132 states have internal predecessors, (535), 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,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 535 transitions. [2023-10-12 17:14:34,936 INFO L241 hiAutomatonCegarLoop]: Abstraction has 133 states and 535 transitions. [2023-10-12 17:14:34,936 INFO L430 stractBuchiCegarLoop]: Abstraction has 133 states and 535 transitions. [2023-10-12 17:14:34,936 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:14:34,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 535 transitions. [2023-10-12 17:14:34,938 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 72 [2023-10-12 17:14:34,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:34,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:34,939 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:34,939 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:34,939 INFO L748 eck$LassoCheckResult]: Stem: 755#[$Ultimate##0]don't care [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 637#[L80]don't care [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 639#[L80-1, L26]don't care [116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 699#[L38, L26, L81]don't care [2023-10-12 17:14:34,939 INFO L750 eck$LassoCheckResult]: Loop: 699#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 697#[L39, L26, L81]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 699#[L38, L26, L81]don't care [2023-10-12 17:14:34,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,939 INFO L85 PathProgramCache]: Analyzing trace with hash 170833, now seen corresponding path program 1 times [2023-10-12 17:14:34,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307831372] [2023-10-12 17:14:34,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 1 times [2023-10-12 17:14:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363003661] [2023-10-12 17:14:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,955 INFO L85 PathProgramCache]: Analyzing trace with hash 164173722, now seen corresponding path program 1 times [2023-10-12 17:14:34,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956034828] [2023-10-12 17:14:34,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,001 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,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:35,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956034828] [2023-10-12 17:14:35,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956034828] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:35,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:35,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:35,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518306772] [2023-10-12 17:14:35,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:35,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:35,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:35,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:35,073 INFO L87 Difference]: Start difference. First operand 133 states and 535 transitions. cyclomatic complexity: 442 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,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:35,099 INFO L93 Difference]: Finished difference Result 235 states and 830 transitions. [2023-10-12 17:14:35,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 235 states and 830 transitions. [2023-10-12 17:14:35,121 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 124 [2023-10-12 17:14:35,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 235 states to 219 states and 786 transitions. [2023-10-12 17:14:35,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2023-10-12 17:14:35,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2023-10-12 17:14:35,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 786 transitions. [2023-10-12 17:14:35,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:35,124 INFO L219 hiAutomatonCegarLoop]: Abstraction has 219 states and 786 transitions. [2023-10-12 17:14:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 786 transitions. [2023-10-12 17:14:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 190. [2023-10-12 17:14:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 190 states have (on average 3.7842105263157895) internal successors, (719), 189 states have internal predecessors, (719), 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,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 719 transitions. [2023-10-12 17:14:35,137 INFO L241 hiAutomatonCegarLoop]: Abstraction has 190 states and 719 transitions. [2023-10-12 17:14:35,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:35,138 INFO L430 stractBuchiCegarLoop]: Abstraction has 190 states and 719 transitions. [2023-10-12 17:14:35,138 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:14:35,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 719 transitions. [2023-10-12 17:14:35,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:35,142 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 104 [2023-10-12 17:14:35,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:35,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:35,142 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:35,142 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:35,143 INFO L748 eck$LassoCheckResult]: Stem: 1268#[$Ultimate##0]don't care [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 1136#[L80]don't care [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1138#[L80-1, L26]don't care [116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1252#[L38, L26, L81]don't care [119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 1100#[L82, L55, L26, L38]don't care [2023-10-12 17:14:35,143 INFO L750 eck$LassoCheckResult]: Loop: 1100#[L82, L55, L26, L38]don't care [105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[] 1108#[L82, L26, L56, L38]don't care [136] L56-->L55: Formula: (and (< v_front2_19 v_back2_20) (= (+ v_front2_19 1) v_front2_18) (= v_temp2_9 (select v_queue2_13 v_front2_19)) (= v_d2_17 (+ v_temp2_9 v_d2_18))) InVars {d2=v_d2_18, back2=v_back2_20, front2=v_front2_19, queue2=v_queue2_13} OutVars{d2=v_d2_17, back2=v_back2_20, temp2=v_temp2_9, front2=v_front2_18, queue2=v_queue2_13} AuxVars[] AssignedVars[d2, temp2, front2] 1100#[L82, L55, L26, L38]don't care [2023-10-12 17:14:35,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash 5295942, now seen corresponding path program 1 times [2023-10-12 17:14:35,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119735652] [2023-10-12 17:14:35,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,151 INFO L85 PathProgramCache]: Analyzing trace with hash 4352, now seen corresponding path program 1 times [2023-10-12 17:14:35,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666988697] [2023-10-12 17:14:35,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,157 INFO L85 PathProgramCache]: Analyzing trace with hash 794436357, now seen corresponding path program 1 times [2023-10-12 17:14:35,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808401572] [2023-10-12 17:14:35,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,178 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,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:35,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808401572] [2023-10-12 17:14:35,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808401572] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:35,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:35,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:35,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045035377] [2023-10-12 17:14:35,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:35,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:35,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:35,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:35,199 INFO L87 Difference]: Start difference. First operand 190 states and 719 transitions. cyclomatic complexity: 591 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,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:35,221 INFO L93 Difference]: Finished difference Result 318 states and 1168 transitions. [2023-10-12 17:14:35,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 1168 transitions. [2023-10-12 17:14:35,225 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 72 [2023-10-12 17:14:35,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 245 states and 937 transitions. [2023-10-12 17:14:35,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2023-10-12 17:14:35,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2023-10-12 17:14:35,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 937 transitions. [2023-10-12 17:14:35,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:35,229 INFO L219 hiAutomatonCegarLoop]: Abstraction has 245 states and 937 transitions. [2023-10-12 17:14:35,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 937 transitions. [2023-10-12 17:14:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 217. [2023-10-12 17:14:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 217 states have (on average 3.9308755760368665) internal successors, (853), 216 states have internal predecessors, (853), 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,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 853 transitions. [2023-10-12 17:14:35,239 INFO L241 hiAutomatonCegarLoop]: Abstraction has 217 states and 853 transitions. [2023-10-12 17:14:35,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:35,239 INFO L430 stractBuchiCegarLoop]: Abstraction has 217 states and 853 transitions. [2023-10-12 17:14:35,239 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:14:35,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 853 transitions. [2023-10-12 17:14:35,241 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 72 [2023-10-12 17:14:35,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:35,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:35,242 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:14:35,242 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:35,242 INFO L748 eck$LassoCheckResult]: Stem: 1990#[$Ultimate##0]don't care [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 1844#[L80]don't care [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1846#[L80-1, L26]don't care [116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1974#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 1914#[L39, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 1918#[L39, L26, L81]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 1912#[L38, L26, L81]don't care [2023-10-12 17:14:35,242 INFO L750 eck$LassoCheckResult]: Loop: 1912#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 2120#[L39, L26, L81]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 1912#[L38, L26, L81]don't care [2023-10-12 17:14:35,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,242 INFO L85 PathProgramCache]: Analyzing trace with hash 794418288, now seen corresponding path program 1 times [2023-10-12 17:14:35,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666706904] [2023-10-12 17:14:35,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,255 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 2 times [2023-10-12 17:14:35,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399518259] [2023-10-12 17:14:35,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1068200711, now seen corresponding path program 2 times [2023-10-12 17:14:35,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016852026] [2023-10-12 17:14:35,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:35,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:35,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016852026] [2023-10-12 17:14:35,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016852026] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:14:35,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442442521] [2023-10-12 17:14:35,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:14:35,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:14:35,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,301 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:14:35,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-10-12 17:14:35,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:14:35,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:14:35,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:35,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:14:35,364 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:14:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442442521] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:35,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:14:35,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:14:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577030466] [2023-10-12 17:14:35,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:35,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:35,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:14:35,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:14:35,402 INFO L87 Difference]: Start difference. First operand 217 states and 853 transitions. cyclomatic complexity: 690 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:35,437 INFO L93 Difference]: Finished difference Result 510 states and 1932 transitions. [2023-10-12 17:14:35,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 510 states and 1932 transitions. [2023-10-12 17:14:35,442 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 176 [2023-10-12 17:14:35,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 510 states to 478 states and 1792 transitions. [2023-10-12 17:14:35,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 266 [2023-10-12 17:14:35,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 266 [2023-10-12 17:14:35,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 478 states and 1792 transitions. [2023-10-12 17:14:35,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:35,447 INFO L219 hiAutomatonCegarLoop]: Abstraction has 478 states and 1792 transitions. [2023-10-12 17:14:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states and 1792 transitions. [2023-10-12 17:14:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 401. [2023-10-12 17:14:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 401 states have (on average 3.972568578553616) internal successors, (1593), 400 states have internal predecessors, (1593), 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,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1593 transitions. [2023-10-12 17:14:35,460 INFO L241 hiAutomatonCegarLoop]: Abstraction has 401 states and 1593 transitions. [2023-10-12 17:14:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:14:35,461 INFO L430 stractBuchiCegarLoop]: Abstraction has 401 states and 1593 transitions. [2023-10-12 17:14:35,461 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:14:35,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 401 states and 1593 transitions. [2023-10-12 17:14:35,464 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 136 [2023-10-12 17:14:35,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:35,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:35,464 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:35,464 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:35,465 INFO L748 eck$LassoCheckResult]: Stem: 2977#[$Ultimate##0]don't care [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 2819#[L80]don't care [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 2821#[L80-1, L26]don't care [116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2957#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 3415#[L39, L26, L81]don't care [119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 3075#[L39, L82, L55, L26]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 3077#[L39, L82, L55, L26]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 3467#[L82, L55, L26, L38]don't care [2023-10-12 17:14:35,465 INFO L750 eck$LassoCheckResult]: Loop: 3467#[L82, L55, L26, L38]don't care [105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[] 3463#[L82, L26, L56, L38]don't care [136] L56-->L55: Formula: (and (< v_front2_19 v_back2_20) (= (+ v_front2_19 1) v_front2_18) (= v_temp2_9 (select v_queue2_13 v_front2_19)) (= v_d2_17 (+ v_temp2_9 v_d2_18))) InVars {d2=v_d2_18, back2=v_back2_20, front2=v_front2_19, queue2=v_queue2_13} OutVars{d2=v_d2_17, back2=v_back2_20, temp2=v_temp2_9, front2=v_front2_18, queue2=v_queue2_13} AuxVars[] AssignedVars[d2, temp2, front2] 3467#[L82, L55, L26, L38]don't care [2023-10-12 17:14:35,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1142858749, now seen corresponding path program 1 times [2023-10-12 17:14:35,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344468307] [2023-10-12 17:14:35,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,486 INFO L85 PathProgramCache]: Analyzing trace with hash 4352, now seen corresponding path program 2 times [2023-10-12 17:14:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289328242] [2023-10-12 17:14:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1224373378, now seen corresponding path program 1 times [2023-10-12 17:14:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:35,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785385500] [2023-10-12 17:14:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,509 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:35,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,754 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:35,754 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:35,754 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:35,754 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:35,754 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:35,754 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,754 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:35,754 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:35,754 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:14:35,754 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:35,754 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:35,760 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,763 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,765 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:35,825 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,831 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,834 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:35,836 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,839 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:35,841 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,040 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:36,040 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:36,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,042 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,044 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,045 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,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:36,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:36,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,071 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,091 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,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,107 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,116 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:36,119 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,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,122 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,123 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,125 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,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:36,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:36,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:36,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:36,134 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:36,134 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:36,165 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:36,174 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:36,174 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:36,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:36,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,198 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,198 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,199 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:36,209 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:36,209 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:36,209 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back2, front2) = 1*back2 - 1*front2 Supporting invariants [] [2023-10-12 17:14:36,226 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,231 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:14:36,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:36,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:36,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:36,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:36,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:36,262 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,263 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,263 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 401 states and 1593 transitions. cyclomatic complexity: 1285 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:36,310 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 401 states and 1593 transitions. cyclomatic complexity: 1285. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1315 states and 5346 transitions. Complement of second has 5 states. [2023-10-12 17:14:36,311 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,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2023-10-12 17:14:36,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:14:36,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:36,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:14:36,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:36,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1315 states and 5346 transitions. [2023-10-12 17:14:36,325 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 136 [2023-10-12 17:14:36,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1315 states to 966 states and 3746 transitions. [2023-10-12 17:14:36,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2023-10-12 17:14:36,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 474 [2023-10-12 17:14:36,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 966 states and 3746 transitions. [2023-10-12 17:14:36,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:36,335 INFO L219 hiAutomatonCegarLoop]: Abstraction has 966 states and 3746 transitions. [2023-10-12 17:14:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states and 3746 transitions. [2023-10-12 17:14:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 760. [2023-10-12 17:14:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 760 states have (on average 4.117105263157895) internal successors, (3129), 759 states have internal predecessors, (3129), 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,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 3129 transitions. [2023-10-12 17:14:36,358 INFO L241 hiAutomatonCegarLoop]: Abstraction has 760 states and 3129 transitions. [2023-10-12 17:14:36,358 INFO L430 stractBuchiCegarLoop]: Abstraction has 760 states and 3129 transitions. [2023-10-12 17:14:36,358 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:14:36,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 760 states and 3129 transitions. [2023-10-12 17:14:36,363 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 136 [2023-10-12 17:14:36,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:36,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:36,364 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2023-10-12 17:14:36,364 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:36,365 INFO L748 eck$LassoCheckResult]: Stem: 5196#[$Ultimate##0]don't care [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 5020#[L80]don't care [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 5022#[L80-1, L26]don't care [116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 5178#[L38, L26, L81]don't care [119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 5976#[L82, L55, L26, L38]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 5482#[L82, L55, L26, L38]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 5698#[L82, L55, L26, L38]don't care [137] L55-->thread3EXIT: Formula: (not v_v_assert_37) InVars {v_assert=v_v_assert_37} OutVars{v_assert=v_v_assert_37} AuxVars[] AssignedVars[] 5072#[L82, L26, thread3EXIT, L38]don't care [2023-10-12 17:14:36,365 INFO L750 eck$LassoCheckResult]: Loop: 5072#[L82, L26, thread3EXIT, L38]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 5068#[L39, L82, L26, thread3EXIT]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 5072#[L82, L26, thread3EXIT, L38]don't care [2023-10-12 17:14:36,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1142240829, now seen corresponding path program 1 times [2023-10-12 17:14:36,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928371866] [2023-10-12 17:14:36,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:14:36,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:36,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928371866] [2023-10-12 17:14:36,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928371866] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:36,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:36,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:36,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522824328] [2023-10-12 17:14:36,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:36,398 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:14:36,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,399 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 3 times [2023-10-12 17:14:36,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790765343] [2023-10-12 17:14:36,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:36,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:36,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:36,443 INFO L87 Difference]: Start difference. First operand 760 states and 3129 transitions. cyclomatic complexity: 2528 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:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:36,469 INFO L93 Difference]: Finished difference Result 895 states and 3230 transitions. [2023-10-12 17:14:36,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 895 states and 3230 transitions. [2023-10-12 17:14:36,490 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 114 [2023-10-12 17:14:36,494 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,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 895 states to 895 states and 3230 transitions. [2023-10-12 17:14:36,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 407 [2023-10-12 17:14:36,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 407 [2023-10-12 17:14:36,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 895 states and 3230 transitions. [2023-10-12 17:14:36,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:36,499 INFO L219 hiAutomatonCegarLoop]: Abstraction has 895 states and 3230 transitions. [2023-10-12 17:14:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states and 3230 transitions. [2023-10-12 17:14:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 826. [2023-10-12 17:14:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 826 states have (on average 3.7409200968523004) internal successors, (3090), 825 states have internal predecessors, (3090), 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,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 3090 transitions. [2023-10-12 17:14:36,515 INFO L241 hiAutomatonCegarLoop]: Abstraction has 826 states and 3090 transitions. [2023-10-12 17:14:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:36,516 INFO L430 stractBuchiCegarLoop]: Abstraction has 826 states and 3090 transitions. [2023-10-12 17:14:36,516 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:14:36,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 826 states and 3090 transitions. [2023-10-12 17:14:36,521 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 114 [2023-10-12 17:14:36,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:36,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:36,521 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1] [2023-10-12 17:14:36,521 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:36,522 INFO L748 eck$LassoCheckResult]: Stem: 7557#[$Ultimate##0]don't care [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 7429#[L80]don't care [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 7431#[L80-1, L26]don't care [116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 7529#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 7753#[L39, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 8223#[L39, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 7739#[L39, L26, L81]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 7721#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 7725#[L39, L26, L81]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 8435#[L38, L26, L81]don't care [2023-10-12 17:14:36,523 INFO L750 eck$LassoCheckResult]: Loop: 8435#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 8437#[L39, L26, L81]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 8435#[L38, L26, L81]don't care [2023-10-12 17:14:36,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1245614179, now seen corresponding path program 3 times [2023-10-12 17:14:36,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166751657] [2023-10-12 17:14:36,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 4 times [2023-10-12 17:14:36,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797228982] [2023-10-12 17:14:36,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1260646356, now seen corresponding path program 4 times [2023-10-12 17:14:36,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805772834] [2023-10-12 17:14:36,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:36,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:36,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805772834] [2023-10-12 17:14:36,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805772834] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:14:36,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210465034] [2023-10-12 17:14:36,586 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-10-12 17:14:36,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:14:36,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:36,587 INFO L229 MonitoredProcess]: Starting monitored process 12 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:36,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-10-12 17:14:36,617 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-10-12 17:14:36,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:14:36,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:14:36,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:14:36,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:14:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:14:36,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210465034] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:14:36,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:14:36,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2023-10-12 17:14:36,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995160920] [2023-10-12 17:14:36,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:14:36,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:36,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-10-12 17:14:36,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-10-12 17:14:36,707 INFO L87 Difference]: Start difference. First operand 826 states and 3090 transitions. cyclomatic complexity: 2405 Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:36,805 INFO L93 Difference]: Finished difference Result 1565 states and 5776 transitions. [2023-10-12 17:14:36,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1565 states and 5776 transitions. [2023-10-12 17:14:36,819 INFO L131 ngComponentsAnalysis]: Automaton has 109 accepting balls. 234 [2023-10-12 17:14:36,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1565 states to 1547 states and 5690 transitions. [2023-10-12 17:14:36,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 730 [2023-10-12 17:14:36,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 730 [2023-10-12 17:14:36,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1547 states and 5690 transitions. [2023-10-12 17:14:36,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:36,841 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1547 states and 5690 transitions. [2023-10-12 17:14:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states and 5690 transitions. [2023-10-12 17:14:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1194. [2023-10-12 17:14:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1194 states have (on average 3.7889447236180906) internal successors, (4524), 1193 states have internal predecessors, (4524), 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,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 4524 transitions. [2023-10-12 17:14:36,903 INFO L241 hiAutomatonCegarLoop]: Abstraction has 1194 states and 4524 transitions. [2023-10-12 17:14:36,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:14:36,921 INFO L430 stractBuchiCegarLoop]: Abstraction has 1194 states and 4524 transitions. [2023-10-12 17:14:36,921 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:14:36,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1194 states and 4524 transitions. [2023-10-12 17:14:36,928 INFO L131 ngComponentsAnalysis]: Automaton has 65 accepting balls. 146 [2023-10-12 17:14:36,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:36,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:36,929 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2023-10-12 17:14:36,929 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:36,929 INFO L748 eck$LassoCheckResult]: Stem: 10855#[$Ultimate##0]don't care [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 10717#[L80]don't care [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 10719#[L80-1, L26]don't care [116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 10821#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 11533#[L39, L26, L81]don't care [119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 11535#[L39, L82, L55, L26]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 11525#[L39, L82, L55, L26]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 11561#[L82, L55, L26, L38]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 11969#[L39, L82, L55, L26]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 12089#[L39, L82, L55, L26]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 12509#[L82, L55, L26, L38]don't care [2023-10-12 17:14:36,929 INFO L750 eck$LassoCheckResult]: Loop: 12509#[L82, L55, L26, L38]don't care [105] L55-->L56: Formula: v_v_assert_7 InVars {v_assert=v_v_assert_7} OutVars{v_assert=v_v_assert_7} AuxVars[] AssignedVars[] 12587#[L82, L26, L56, L38]don't care [136] L56-->L55: Formula: (and (< v_front2_19 v_back2_20) (= (+ v_front2_19 1) v_front2_18) (= v_temp2_9 (select v_queue2_13 v_front2_19)) (= v_d2_17 (+ v_temp2_9 v_d2_18))) InVars {d2=v_d2_18, back2=v_back2_20, front2=v_front2_19, queue2=v_queue2_13} OutVars{d2=v_d2_17, back2=v_back2_20, temp2=v_temp2_9, front2=v_front2_18, queue2=v_queue2_13} AuxVars[] AssignedVars[d2, temp2, front2] 12509#[L82, L55, L26, L38]don't care [2023-10-12 17:14:36,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash -699136386, now seen corresponding path program 2 times [2023-10-12 17:14:36,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962434631] [2023-10-12 17:14:36,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,958 INFO L85 PathProgramCache]: Analyzing trace with hash 4352, now seen corresponding path program 3 times [2023-10-12 17:14:36,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660853230] [2023-10-12 17:14:36,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:36,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:36,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1855165379, now seen corresponding path program 2 times [2023-10-12 17:14:36,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:36,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670159734] [2023-10-12 17:14:36,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:36,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:36,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:37,287 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:37,287 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:37,287 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:37,287 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:37,287 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:37,287 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,287 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:37,287 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:37,287 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:14:37,287 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:37,287 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:37,288 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,290 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,293 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,411 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,415 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,417 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,418 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,421 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,422 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,662 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:37,662 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:37,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,677 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: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,705 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,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,707 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:37,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:37,724 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:37,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,726 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,728 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,729 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,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,737 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:37,757 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,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,758 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,760 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,761 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,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:37,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:37,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:37,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:37,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:37,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:37,785 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:37,793 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:14:37,793 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:37,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:37,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:37,796 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,796 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,797 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:37,818 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:37,819 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:37,819 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back2, front2) = 1*back2 - 1*front2 Supporting invariants [] [2023-10-12 17:14:37,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:37,831 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2023-10-12 17:14:37,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:37,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:37,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:37,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:37,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:37,872 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,872 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,872 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1194 states and 4524 transitions. cyclomatic complexity: 3509 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:37,910 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1194 states and 4524 transitions. cyclomatic complexity: 3509. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2111 states and 7816 transitions. Complement of second has 5 states. [2023-10-12 17:14:37,910 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,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2023-10-12 17:14:37,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:37,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:37,911 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:37,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:37,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:37,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:37,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:37,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:37,944 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,944 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:14:37,944 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1194 states and 4524 transitions. cyclomatic complexity: 3509 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:37,977 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1194 states and 4524 transitions. cyclomatic complexity: 3509. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2111 states and 7816 transitions. Complement of second has 5 states. [2023-10-12 17:14:37,977 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,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2023-10-12 17:14:37,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:37,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:37,978 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:37,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:37,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:37,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:38,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:38,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:38,010 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:38,011 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:38,011 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1194 states and 4524 transitions. cyclomatic complexity: 3509 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:38,052 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1194 states and 4524 transitions. cyclomatic complexity: 3509. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2913 states and 10970 transitions. Complement of second has 5 states. [2023-10-12 17:14:38,053 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:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:38,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2023-10-12 17:14:38,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:38,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:38,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:14:38,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:38,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 10 letters. Loop has 4 letters. [2023-10-12 17:14:38,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:38,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2913 states and 10970 transitions. [2023-10-12 17:14:38,078 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 138 [2023-10-12 17:14:38,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2913 states to 1143 states and 4208 transitions. [2023-10-12 17:14:38,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 273 [2023-10-12 17:14:38,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2023-10-12 17:14:38,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1143 states and 4208 transitions. [2023-10-12 17:14:38,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:38,088 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1143 states and 4208 transitions. [2023-10-12 17:14:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states and 4208 transitions. [2023-10-12 17:14:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 405. [2023-10-12 17:14:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 405 states have (on average 3.925925925925926) internal successors, (1590), 404 states have internal predecessors, (1590), 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:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1590 transitions. [2023-10-12 17:14:38,099 INFO L241 hiAutomatonCegarLoop]: Abstraction has 405 states and 1590 transitions. [2023-10-12 17:14:38,099 INFO L430 stractBuchiCegarLoop]: Abstraction has 405 states and 1590 transitions. [2023-10-12 17:14:38,099 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:14:38,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 405 states and 1590 transitions. [2023-10-12 17:14:38,101 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 114 [2023-10-12 17:14:38,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:38,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:38,102 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2023-10-12 17:14:38,102 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:38,102 INFO L748 eck$LassoCheckResult]: Stem: 20571#[$Ultimate##0]don't care [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 20409#[L80]don't care [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 20411#[L80-1, L26]don't care [116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 20543#[L38, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 20547#[L38, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 20601#[L38, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 20963#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 20541#[L39, L26, L81]don't care [2023-10-12 17:14:38,102 INFO L750 eck$LassoCheckResult]: Loop: 20541#[L39, L26, L81]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 20603#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 20541#[L39, L26, L81]don't care [2023-10-12 17:14:38,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:38,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1141555674, now seen corresponding path program 1 times [2023-10-12 17:14:38,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:38,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076717957] [2023-10-12 17:14:38,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:38,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:38,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:38,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:38,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:38,109 INFO L85 PathProgramCache]: Analyzing trace with hash 5400, now seen corresponding path program 5 times [2023-10-12 17:14:38,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:38,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123354697] [2023-10-12 17:14:38,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:38,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:38,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:38,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:38,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1818337795, now seen corresponding path program 5 times [2023-10-12 17:14:38,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:38,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605965500] [2023-10-12 17:14:38,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:38,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:38,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:38,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:38,198 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:38,344 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:38,345 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:38,345 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:38,345 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:38,345 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:38,345 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,345 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:38,345 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:38,345 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration9_Lasso [2023-10-12 17:14:38,345 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:38,345 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:38,346 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,349 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,353 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,355 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,356 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,358 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,398 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,508 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:38,508 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:38,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,519 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:38,552 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:38,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:38,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,572 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:38,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,573 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:38,575 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:38,576 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,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,617 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:38,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,620 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:38,623 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,629 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:38,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,662 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:38,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,685 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:38,710 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:38,711 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,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,763 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:38,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,785 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:38,817 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:38,818 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,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,878 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:38,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,893 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:38,894 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:38,906 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,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,939 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:38,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,941 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:38,945 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,945 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:38,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,968 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:38,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:38,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:38,969 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:38,971 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:38,973 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,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:38,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:38,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:38,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:38,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:38,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:38,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:38,999 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:39,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,000 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:39,002 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:39,003 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:39,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:39,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:39,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:39,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:39,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:39,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:39,026 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:39,035 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:39,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,036 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:39,038 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:39,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:39,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:39,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:39,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:39,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:39,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:39,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:39,062 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:39,067 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:14:39,067 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:14:39,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,068 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:39,070 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:39,071 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:39,092 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:39,092 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:39,092 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back1, front1) = 1*back1 - 1*front1 Supporting invariants [] [2023-10-12 17:14:39,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:39,102 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:14:39,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:39,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:39,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:39,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:39,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:39,138 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:39,138 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 405 states and 1590 transitions. cyclomatic complexity: 1211 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:39,164 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 405 states and 1590 transitions. cyclomatic complexity: 1211. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1204 states and 4562 transitions. Complement of second has 5 states. [2023-10-12 17:14:39,165 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,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2023-10-12 17:14:39,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:14:39,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:39,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:14:39,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1204 states and 4562 transitions. [2023-10-12 17:14:39,174 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 114 [2023-10-12 17:14:39,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1204 states to 720 states and 2735 transitions. [2023-10-12 17:14:39,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2023-10-12 17:14:39,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2023-10-12 17:14:39,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 720 states and 2735 transitions. [2023-10-12 17:14:39,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:39,179 INFO L219 hiAutomatonCegarLoop]: Abstraction has 720 states and 2735 transitions. [2023-10-12 17:14:39,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states and 2735 transitions. [2023-10-12 17:14:39,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 644. [2023-10-12 17:14:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 644 states have (on average 3.849378881987578) internal successors, (2479), 643 states have internal predecessors, (2479), 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,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 2479 transitions. [2023-10-12 17:14:39,190 INFO L241 hiAutomatonCegarLoop]: Abstraction has 644 states and 2479 transitions. [2023-10-12 17:14:39,190 INFO L430 stractBuchiCegarLoop]: Abstraction has 644 states and 2479 transitions. [2023-10-12 17:14:39,190 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:14:39,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 644 states and 2479 transitions. [2023-10-12 17:14:39,194 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 114 [2023-10-12 17:14:39,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:39,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:39,194 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1] [2023-10-12 17:14:39,194 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:39,194 INFO L748 eck$LassoCheckResult]: Stem: 22636#[$Ultimate##0]don't care [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 22472#[L80]don't care [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 22474#[L80-1, L26]don't care [116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 22612#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 23132#[L39, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 23094#[L39, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 23088#[L39, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 23030#[L39, L26, L81]don't care [130] L26-->thread1EXIT: Formula: (or (<= v_w_8 0) (not v_v_assert_15)) InVars {v_assert=v_v_assert_15, w=v_w_8} OutVars{v_assert=v_v_assert_15, w=v_w_8} AuxVars[] AssignedVars[] 22538#[L39, thread1EXIT, L81]don't care [2023-10-12 17:14:39,194 INFO L750 eck$LassoCheckResult]: Loop: 22538#[L39, thread1EXIT, L81]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 23008#[L38, thread1EXIT, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 22538#[L39, thread1EXIT, L81]don't care [2023-10-12 17:14:39,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1068197466, now seen corresponding path program 1 times [2023-10-12 17:14:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:39,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481103309] [2023-10-12 17:14:39,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:39,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:39,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,201 INFO L85 PathProgramCache]: Analyzing trace with hash 5400, now seen corresponding path program 6 times [2023-10-12 17:14:39,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:39,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94019168] [2023-10-12 17:14:39,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:39,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:39,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash -40576643, now seen corresponding path program 1 times [2023-10-12 17:14:39,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:39,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660246030] [2023-10-12 17:14:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:39,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:39,359 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:39,359 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:39,359 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:39,360 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:39,360 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:39,360 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,360 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:39,360 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:39,360 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration10_Lasso [2023-10-12 17:14:39,360 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:39,360 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:39,361 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,366 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,368 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,370 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,372 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,373 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,375 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,525 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:39,549 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:39,549 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:39,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,581 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:39,597 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:39,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:39,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:39,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:39,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:39,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:39,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:39,609 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:39,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:39,639 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:39,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,645 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:39,646 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:39,656 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:39,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:39,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:39,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:39,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:39,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:39,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:39,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:39,673 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:39,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,674 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:39,676 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:39,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:39,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:39,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:39,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:39,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:39,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:39,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:39,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:39,690 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,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,691 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:39,693 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:39,694 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:39,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:39,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:39,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:39,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:39,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:39,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:39,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:39,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:39,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,722 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:39,724 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:39,735 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:39,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:39,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:39,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:39,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:39,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:39,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:39,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:39,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:39,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,756 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:39,757 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:39,759 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:39,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:39,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:39,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:39,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:39,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:39,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:39,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:39,775 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:39,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,776 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:39,779 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:39,780 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:39,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:39,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:39,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:39,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:39,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:39,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:39,805 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:39,810 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:39,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,811 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:39,817 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:39,817 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:39,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:39,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:39,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:39,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:39,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:39,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:39,830 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:39,837 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:14:39,837 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:39,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:39,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:39,838 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:39,840 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:39,841 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:39,850 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:39,850 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:39,850 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back1, front1) = 1*back1 - 1*front1 Supporting invariants [] [2023-10-12 17:14:39,855 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:39,866 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:14:39,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:39,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:39,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:39,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:39,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:39,902 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,903 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:39,903 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 644 states and 2479 transitions. cyclomatic complexity: 1892 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:39,945 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 644 states and 2479 transitions. cyclomatic complexity: 1892. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 903 states and 3508 transitions. Complement of second has 4 states. [2023-10-12 17:14:39,945 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,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2023-10-12 17:14:39,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:39,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,948 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,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:14:39,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:39,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 903 states and 3508 transitions. [2023-10-12 17:14:39,956 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 43 [2023-10-12 17:14:39,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 903 states to 530 states and 1968 transitions. [2023-10-12 17:14:39,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2023-10-12 17:14:39,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2023-10-12 17:14:39,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 1968 transitions. [2023-10-12 17:14:39,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:39,961 INFO L219 hiAutomatonCegarLoop]: Abstraction has 530 states and 1968 transitions. [2023-10-12 17:14:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 1968 transitions. [2023-10-12 17:14:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2023-10-12 17:14:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 3.7132075471698114) internal successors, (1968), 529 states have internal predecessors, (1968), 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,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1968 transitions. [2023-10-12 17:14:39,973 INFO L241 hiAutomatonCegarLoop]: Abstraction has 530 states and 1968 transitions. [2023-10-12 17:14:39,973 INFO L430 stractBuchiCegarLoop]: Abstraction has 530 states and 1968 transitions. [2023-10-12 17:14:39,973 INFO L337 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-10-12 17:14:39,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 1968 transitions. [2023-10-12 17:14:39,975 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 43 [2023-10-12 17:14:39,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:39,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:39,976 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1] [2023-10-12 17:14:39,976 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:39,976 INFO L748 eck$LassoCheckResult]: Stem: 24724#[$Ultimate##0]don't care [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 24658#[L80]don't care [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 24660#[L80-1, L26]don't care [116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 24670#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 24672#[L39, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 24848#[L39, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 24796#[L39, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 24764#[L39, L26, L81]don't care [119] L81-->L55: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 24644#[L39, L82, L55, L26]don't care [2023-10-12 17:14:39,976 INFO L750 eck$LassoCheckResult]: Loop: 24644#[L39, L82, L55, L26]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 24918#[L82, L55, L26, L38]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 24644#[L39, L82, L55, L26]don't care [2023-10-12 17:14:39,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1068197477, now seen corresponding path program 1 times [2023-10-12 17:14:39,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:39,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107094641] [2023-10-12 17:14:39,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:39,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:39,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,986 INFO L85 PathProgramCache]: Analyzing trace with hash 5400, now seen corresponding path program 7 times [2023-10-12 17:14:39,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:39,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856358453] [2023-10-12 17:14:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:39,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:39,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:39,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash -40587214, now seen corresponding path program 3 times [2023-10-12 17:14:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:39,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337416592] [2023-10-12 17:14:39,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:39,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:40,238 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:40,238 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:40,238 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:40,238 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:40,238 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:40,238 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,238 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:40,239 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:40,239 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration11_Lasso [2023-10-12 17:14:40,239 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:40,239 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:40,240 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,242 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:40,244 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:40,247 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:40,249 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:40,250 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,254 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:40,256 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,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:40,259 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:40,435 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:40,436 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:40,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,437 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,441 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,442 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,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,468 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,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,469 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,471 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,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:40,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,499 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,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,500 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,503 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,503 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,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,545 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,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,547 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,551 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,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:40,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-10-12 17:14:40,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,579 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,580 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,583 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,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,609 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,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,610 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,612 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,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:40,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,643 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,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,650 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,652 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,653 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,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,681 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:40,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,682 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:40,684 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:40,685 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,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,713 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:40,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,715 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:40,716 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:40,717 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,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:40,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,744 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:40,746 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:40,747 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,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,773 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:40,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,774 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:40,776 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:40,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:40,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:40,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:40,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,796 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:40,798 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:40,799 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,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:40,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:40,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:40,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:40,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:40,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:40,822 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:40,828 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:14:40,828 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:14:40,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:40,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:40,830 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:40,831 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:40,832 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:40,853 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:40,853 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:40,853 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back1, front1) = 1*back1 - 1*front1 Supporting invariants [] [2023-10-12 17:14:40,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:40,858 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:14:40,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:40,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:40,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:40,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:40,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:40,901 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,901 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:40,901 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 530 states and 1968 transitions. cyclomatic complexity: 1487 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:40,922 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 530 states and 1968 transitions. cyclomatic complexity: 1487. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1434 states and 5172 transitions. Complement of second has 5 states. [2023-10-12 17:14:40,923 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,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2023-10-12 17:14:40,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:40,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:40,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:40,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:40,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:14:40,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:40,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1434 states and 5172 transitions. [2023-10-12 17:14:40,933 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 43 [2023-10-12 17:14:40,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1434 states to 1067 states and 3891 transitions. [2023-10-12 17:14:40,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2023-10-12 17:14:40,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2023-10-12 17:14:40,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1067 states and 3891 transitions. [2023-10-12 17:14:40,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:40,940 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1067 states and 3891 transitions. [2023-10-12 17:14:40,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states and 3891 transitions. [2023-10-12 17:14:40,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 574. [2023-10-12 17:14:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 574 states have (on average 3.710801393728223) internal successors, (2130), 573 states have internal predecessors, (2130), 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,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 2130 transitions. [2023-10-12 17:14:40,954 INFO L241 hiAutomatonCegarLoop]: Abstraction has 574 states and 2130 transitions. [2023-10-12 17:14:40,954 INFO L430 stractBuchiCegarLoop]: Abstraction has 574 states and 2130 transitions. [2023-10-12 17:14:40,954 INFO L337 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-10-12 17:14:40,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 574 states and 2130 transitions. [2023-10-12 17:14:40,956 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 43 [2023-10-12 17:14:40,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:40,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:40,957 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1] [2023-10-12 17:14:40,957 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:40,957 INFO L748 eck$LassoCheckResult]: Stem: 27266#[$Ultimate##0]don't care [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 27208#[L80]don't care [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 27210#[L80-1, L26]don't care [116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 27242#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 27632#[L39, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 27568#[L39, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 27330#[L39, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 27312#[L39, L26, L81]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 27212#[L38, L26, L81]don't care [2023-10-12 17:14:40,957 INFO L750 eck$LassoCheckResult]: Loop: 27212#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 27214#[L39, L26, L81]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 27212#[L38, L26, L81]don't care [2023-10-12 17:14:40,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:40,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1068197456, now seen corresponding path program 6 times [2023-10-12 17:14:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:40,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526770875] [2023-10-12 17:14:40,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:40,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:40,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:40,992 INFO L85 PathProgramCache]: Analyzing trace with hash 4170, now seen corresponding path program 8 times [2023-10-12 17:14:40,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:40,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425033392] [2023-10-12 17:14:40,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:40,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:40,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:40,995 INFO L85 PathProgramCache]: Analyzing trace with hash -40568263, now seen corresponding path program 7 times [2023-10-12 17:14:40,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:40,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091460599] [2023-10-12 17:14:40,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:40,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:40,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:41,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:41,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:41,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:41,229 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:41,229 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:41,229 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:41,229 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:41,229 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:41,229 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,229 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:41,229 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:41,229 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration12_Lasso [2023-10-12 17:14:41,230 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:41,230 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:41,230 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,233 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,236 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,238 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,310 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,314 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,316 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,451 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:41,451 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:41,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,453 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,455 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,457 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,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,481 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,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,482 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,484 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,485 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,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,510 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:41,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,511 INFO L229 MonitoredProcess]: Starting monitored process 52 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,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-10-12 17:14:41,515 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,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:41,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,541 INFO L229 MonitoredProcess]: Starting monitored process 53 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,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-10-12 17:14:41,544 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,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,551 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,561 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:41,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,564 INFO L229 MonitoredProcess]: Starting monitored process 54 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,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-10-12 17:14:41,568 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,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:41,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,593 INFO L229 MonitoredProcess]: Starting monitored process 55 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,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-10-12 17:14:41,596 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,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:41,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:41,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,623 INFO L229 MonitoredProcess]: Starting monitored process 56 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,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-10-12 17:14:41,626 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,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:41,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:41,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:41,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:41,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:41,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:41,650 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:41,655 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:14:41,655 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:14:41,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:41,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:41,656 INFO L229 MonitoredProcess]: Starting monitored process 57 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,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-10-12 17:14:41,659 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:41,680 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:41,680 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:41,680 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(front1, back1) = -1*front1 + 1*back1 Supporting invariants [] [2023-10-12 17:14:41,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:41,686 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:14:41,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:41,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:41,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:41,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:41,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:41,720 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,721 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,721 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 574 states and 2130 transitions. cyclomatic complexity: 1611 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:41,746 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 574 states and 2130 transitions. cyclomatic complexity: 1611. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1426 states and 5120 transitions. Complement of second has 5 states. [2023-10-12 17:14:41,746 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,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2023-10-12 17:14:41,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:41,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:41,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:41,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:41,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:14:41,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:41,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 5120 transitions. [2023-10-12 17:14:41,758 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 43 [2023-10-12 17:14:41,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1079 states and 3922 transitions. [2023-10-12 17:14:41,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2023-10-12 17:14:41,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2023-10-12 17:14:41,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1079 states and 3922 transitions. [2023-10-12 17:14:41,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:41,765 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1079 states and 3922 transitions. [2023-10-12 17:14:41,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states and 3922 transitions. [2023-10-12 17:14:41,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 628. [2023-10-12 17:14:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 628 states have (on average 3.6353503184713376) internal successors, (2283), 627 states have internal predecessors, (2283), 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,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 2283 transitions. [2023-10-12 17:14:41,779 INFO L241 hiAutomatonCegarLoop]: Abstraction has 628 states and 2283 transitions. [2023-10-12 17:14:41,779 INFO L430 stractBuchiCegarLoop]: Abstraction has 628 states and 2283 transitions. [2023-10-12 17:14:41,779 INFO L337 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-10-12 17:14:41,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 628 states and 2283 transitions. [2023-10-12 17:14:41,782 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 43 [2023-10-12 17:14:41,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:41,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:41,782 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1, 1] [2023-10-12 17:14:41,782 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:41,783 INFO L748 eck$LassoCheckResult]: Stem: 29887#[$Ultimate##0]don't care [143] $Ultimate##0-->L80: Formula: (and (= v_d1_20 0) (= v_d2_51 v_d1_20) (= v_back1_52 v_front1_50) (= v_back2_50 v_front2_36) (= v_W_36 v_w_36) (<= 0 v_W_36) v_v_assert_74) InVars {d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} OutVars{d2=v_d2_51, d1=v_d1_20, back2=v_back2_50, back1=v_back1_52, v_assert=v_v_assert_74, w=v_w_36, W=v_W_36, front2=v_front2_36, front1=v_front1_50} AuxVars[] AssignedVars[] 29835#[L80]don't care [113] L80-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 29837#[L80-1, L26]don't care [116] L80-1-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 29865#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 30315#[L39, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 30301#[L39, L26, L81]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 30265#[L38, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 30273#[L38, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 30251#[L38, L26, L81]don't care [142] L26-->L26: Formula: (and (< 0 v_w_29) v_v_assert_70 (= (+ v_back1_43 1) v_back1_42) (= (select v_queue1_25 v_back1_43) 1) (= v_w_29 (+ v_w_28 1))) InVars {back1=v_back1_43, w=v_w_29, v_assert=v_v_assert_70, queue1=v_queue1_25} OutVars{back1=v_back1_42, w=v_w_28, v_assert=v_v_assert_70, queue1=v_queue1_25} AuxVars[] AssignedVars[back1, w] 29933#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 29841#[L39, L26, L81]don't care [2023-10-12 17:14:41,783 INFO L750 eck$LassoCheckResult]: Loop: 29841#[L39, L26, L81]don't care [140] L39-->L38: Formula: (and (= (select v_queue2_23 v_back2_37) (+ v_temp1_22 1)) (= (+ v_back2_37 1) v_back2_36) (= v_front1_36 (+ v_front1_37 1)) (= (select v_queue1_21 v_front1_37) v_temp1_22) (< v_front1_37 v_back1_34) (= v_d1_8 (+ v_d1_9 v_temp1_22))) InVars {d1=v_d1_9, back2=v_back2_37, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_37} OutVars{temp1=v_temp1_22, d1=v_d1_8, back2=v_back2_36, back1=v_back1_34, queue1=v_queue1_21, queue2=v_queue2_23, front1=v_front1_36} AuxVars[] AssignedVars[temp1, d1, back2, front1] 29839#[L38, L26, L81]don't care [99] L38-->L39: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 29841#[L39, L26, L81]don't care [2023-10-12 17:14:41,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:41,783 INFO L85 PathProgramCache]: Analyzing trace with hash -42412091, now seen corresponding path program 8 times [2023-10-12 17:14:41,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:41,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143270806] [2023-10-12 17:14:41,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:41,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:41,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:41,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:41,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:41,789 INFO L85 PathProgramCache]: Analyzing trace with hash 5400, now seen corresponding path program 9 times [2023-10-12 17:14:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:41,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618263185] [2023-10-12 17:14:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:41,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:41,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:41,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:41,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:41,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2103309348, now seen corresponding path program 9 times [2023-10-12 17:14:41,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:41,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561424482] [2023-10-12 17:14:41,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:41,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:41,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:41,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:42,036 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:42,036 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:42,036 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:42,036 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:42,036 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:42,036 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,036 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:42,036 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:42,036 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons3.wvr.bpl_BEv2_Iteration13_Lasso [2023-10-12 17:14:42,036 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:42,036 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:42,037 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:42,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:42,060 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:42,061 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:42,062 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:42,066 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:42,067 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:42,068 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:42,290 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:42,290 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:42,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,291 INFO L229 MonitoredProcess]: Starting monitored process 58 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:42,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-10-12 17:14:42,294 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:42,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:42,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:42,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:42,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:42,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:42,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:42,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:42,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:42,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,324 INFO L229 MonitoredProcess]: Starting monitored process 59 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:42,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-10-12 17:14:42,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:42,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:42,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:42,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:42,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:42,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:42,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:42,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:42,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:42,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,381 INFO L229 MonitoredProcess]: Starting monitored process 60 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:42,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-10-12 17:14:42,384 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:42,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:42,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:42,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:42,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:42,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:42,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:42,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:42,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:42,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,410 INFO L229 MonitoredProcess]: Starting monitored process 61 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:42,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-10-12 17:14:42,413 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:42,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:42,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:42,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:42,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:42,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:42,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:42,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:42,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:42,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,440 INFO L229 MonitoredProcess]: Starting monitored process 62 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:42,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2023-10-12 17:14:42,443 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:42,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:42,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:42,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:42,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:42,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:42,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:42,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:42,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:42,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,606 INFO L229 MonitoredProcess]: Starting monitored process 63 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:42,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2023-10-12 17:14:42,611 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:42,616 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:42,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:42,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:42,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:42,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:42,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:42,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:42,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:42,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,630 INFO L229 MonitoredProcess]: Starting monitored process 64 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:42,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-10-12 17:14:42,635 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:42,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:42,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:42,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:42,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:42,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:42,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:42,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:42,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:42,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,647 INFO L229 MonitoredProcess]: Starting monitored process 65 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:42,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-10-12 17:14:42,651 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:42,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:42,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:42,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:42,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:42,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:42,658 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:42,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:42,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2023-10-12 17:14:42,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,695 INFO L229 MonitoredProcess]: Starting monitored process 66 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:42,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-10-12 17:14:42,699 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:42,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:42,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:42,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:42,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:42,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:42,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:42,711 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:42,721 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:14:42,721 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:14:42,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:42,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:42,722 INFO L229 MonitoredProcess]: Starting monitored process 67 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:42,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-10-12 17:14:42,725 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:42,746 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:42,746 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:42,746 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(front1, back1) = -1*front1 + 1*back1 Supporting invariants [] [2023-10-12 17:14:42,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2023-10-12 17:14:42,751 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:14:42,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:42,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:42,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:42,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:42,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:42,796 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:42,796 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:42,796 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 628 states and 2283 transitions. cyclomatic complexity: 1718 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:42,817 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 628 states and 2283 transitions. cyclomatic complexity: 1718. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1167 states and 4126 transitions. Complement of second has 5 states. [2023-10-12 17:14:42,818 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:42,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2023-10-12 17:14:42,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:42,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:42,818 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:42,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:42,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:42,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:42,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:42,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:42,860 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:42,860 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:42,860 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 628 states and 2283 transitions. cyclomatic complexity: 1718 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:42,894 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 628 states and 2283 transitions. cyclomatic complexity: 1718. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2058 states and 7007 transitions. Complement of second has 7 states. [2023-10-12 17:14:42,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2023-10-12 17:14:42,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:42,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:42,895 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:42,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:42,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:42,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:42,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:42,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:42,932 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:42,932 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 2 loop predicates [2023-10-12 17:14:42,933 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 628 states and 2283 transitions. cyclomatic complexity: 1718 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:42,955 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 628 states and 2283 transitions. cyclomatic complexity: 1718. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1913 states and 6334 transitions. Complement of second has 7 states. [2023-10-12 17:14:42,956 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:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2023-10-12 17:14:42,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:42,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:42,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:14:42,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:42,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 10 letters. Loop has 4 letters. [2023-10-12 17:14:42,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:42,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1913 states and 6334 transitions. [2023-10-12 17:14:42,967 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:42,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1913 states to 0 states and 0 transitions. [2023-10-12 17:14:42,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:14:42,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:14:42,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:14:42,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:14:42,967 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:42,968 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:42,968 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:42,968 INFO L337 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-10-12 17:14:42,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:14:42,968 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:42,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:14:42,972 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:42 BoogieIcfgContainer [2023-10-12 17:14:42,972 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:42,972 INFO L158 Benchmark]: Toolchain (without parser) took 9787.49ms. Allocated memory was 189.8MB in the beginning and 283.1MB in the end (delta: 93.3MB). Free memory was 142.8MB in the beginning and 154.7MB in the end (delta: -11.9MB). Peak memory consumption was 81.4MB. Max. memory is 8.0GB. [2023-10-12 17:14:42,973 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.93ms. Allocated memory is still 189.8MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:42,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.01ms. Allocated memory is still 189.8MB. Free memory was 142.7MB in the beginning and 141.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:14:42,973 INFO L158 Benchmark]: Boogie Preprocessor took 13.04ms. Allocated memory is still 189.8MB. Free memory was 141.2MB in the beginning and 139.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:42,973 INFO L158 Benchmark]: RCFGBuilder took 223.34ms. Allocated memory is still 189.8MB. Free memory was 139.9MB in the beginning and 128.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-10-12 17:14:42,973 INFO L158 Benchmark]: BuchiAutomizer took 9521.99ms. Allocated memory was 189.8MB in the beginning and 283.1MB in the end (delta: 93.3MB). Free memory was 128.3MB in the beginning and 154.7MB in the end (delta: -26.3MB). Peak memory consumption was 66.7MB. Max. memory is 8.0GB. [2023-10-12 17:14:42,974 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.93ms. Allocated memory is still 189.8MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.01ms. Allocated memory is still 189.8MB. Free memory was 142.7MB in the beginning and 141.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.04ms. Allocated memory is still 189.8MB. Free memory was 141.2MB in the beginning and 139.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 223.34ms. Allocated memory is still 189.8MB. Free memory was 139.9MB in the beginning and 128.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 9521.99ms. Allocated memory was 189.8MB in the beginning and 283.1MB in the end (delta: 93.3MB). Free memory was 128.3MB in the beginning and 154.7MB in the end (delta: -26.3MB). Peak memory consumption was 66.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (5 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function w and consists of 4 locations. One deterministic module has affine ranking function back2 + -1 * front2 and consists of 3 locations. One deterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. One deterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. One deterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. One deterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. One nondeterministic module has affine ranking function back2 + -1 * front2 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * front1 + back1 and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.4s and 14 iterations. TraceHistogramMax:4. Analysis of lassos took 7.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 2574 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 502 IncrementalHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 54 mSDtfsCounter, 502 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU1 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf100 lsp67 ukn91 mio100 lsp56 div100 bol100 ite100 ukn100 eq212 hnf88 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 46 PlacesBefore, 30 PlacesAfterwards, 36 TransitionsBefore, 20 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 3 FixpointIterations, 8 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 542 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 332, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 231, independent: 215, independent conditional: 0, independent unconditional: 215, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 231, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 332, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 231, unknown conditional: 0, unknown unconditional: 231] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:14:42,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:43,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-10-12 17:14:43,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:43,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...