/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-more/queue-add-3-nl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:14:09,903 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:14:09,968 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:10,001 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:14:10,002 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:14:10,002 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:14:10,003 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:14:10,004 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:14:10,004 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:14:10,008 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:14:10,008 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:14:10,009 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:14:10,009 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:14:10,010 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:14:10,010 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:14:10,011 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:14:10,011 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:14:10,011 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:14:10,011 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:14:10,011 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:14:10,012 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:14:10,012 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:14:10,013 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:14:10,013 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:14:10,014 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:14:10,014 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:14:10,014 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:14:10,014 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:14:10,014 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:14:10,015 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:14:10,015 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:14:10,016 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:14:10,016 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:14:10,017 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:14:10,017 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:10,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:14:10,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:14:10,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:14:10,317 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:14:10,318 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:14:10,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl [2023-10-12 17:14:10,319 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-3-nl.wvr.bpl' [2023-10-12 17:14:10,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:14:10,348 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:14:10,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:10,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:14:10,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:14:10,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:10" (1/1) ... [2023-10-12 17:14:10,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:10" (1/1) ... [2023-10-12 17:14:10,372 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:14:10,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:10,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:14:10,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:14:10,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:14:10,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:10" (1/1) ... [2023-10-12 17:14:10,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:10" (1/1) ... [2023-10-12 17:14:10,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:10" (1/1) ... [2023-10-12 17:14:10,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:10" (1/1) ... [2023-10-12 17:14:10,397 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:10" (1/1) ... [2023-10-12 17:14:10,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:10" (1/1) ... [2023-10-12 17:14:10,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:10" (1/1) ... [2023-10-12 17:14:10,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:10" (1/1) ... [2023-10-12 17:14:10,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:14:10,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:14:10,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:14:10,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:14:10,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:10" (1/1) ... [2023-10-12 17:14:10,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:10,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:10,439 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:10,442 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:10,467 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:14:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:14:10,468 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:14:10,469 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:14:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:14:10,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:14:10,469 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:14:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:14:10,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:14:10,470 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:14:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:14:10,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:14:10,471 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:10,519 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:14:10,521 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:14:10,687 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:14:10,715 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:14:10,716 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:14:10,717 INFO L201 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:10 BoogieIcfgContainer [2023-10-12 17:14:10,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:14:10,718 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:14:10,718 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:14:10,724 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:14:10,725 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:10,725 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:10" (1/2) ... [2023-10-12 17:14:10,727 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46bc84bc and model type queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:14:10, skipping insertion in model container [2023-10-12 17:14:10,727 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:10,727 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:10" (2/2) ... [2023-10-12 17:14:10,737 INFO L332 chiAutomizerObserver]: Analyzing ICFG queue-add-3-nl.wvr.bpl [2023-10-12 17:14:10,819 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:14:10,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 114 flow [2023-10-12 17:14:10,916 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-10-12 17:14:10,916 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:10,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:14:10,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 114 flow [2023-10-12 17:14:10,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 96 flow [2023-10-12 17:14:10,927 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:14:10,939 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 96 flow [2023-10-12 17:14:10,941 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 39 transitions, 96 flow [2023-10-12 17:14:10,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 39 transitions, 96 flow [2023-10-12 17:14:10,950 INFO L124 PetriNetUnfolderBase]: 3/39 cut-off events. [2023-10-12 17:14:10,950 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:10,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:14:10,952 INFO L119 LiptonReduction]: Number of co-enabled transitions 634 [2023-10-12 17:14:11,795 INFO L134 LiptonReduction]: Checked pairs total: 535 [2023-10-12 17:14:11,795 INFO L136 LiptonReduction]: Total number of compositions: 22 [2023-10-12 17:14:11,817 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:14:11,817 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:14:11,817 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:14:11,817 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:14:11,818 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:14:11,818 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:14:11,818 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:14:11,818 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:14:11,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:14:11,855 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:14:11,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:11,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:11,860 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:11,860 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:11,861 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:14:11,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 55 states, but on-demand construction may add more states [2023-10-12 17:14:11,867 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:14:11,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:11,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:11,868 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:11,868 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:11,872 INFO L748 eck$LassoCheckResult]: Stem: 52#[$Ultimate##0]don't care [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 55#[L89]don't care [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 57#[$Ultimate##0, L89-1]don't care [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 59#[L32-1, L89-1]don't care [2023-10-12 17:14:11,872 INFO L750 eck$LassoCheckResult]: Loop: 59#[L32-1, L89-1]don't care [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 59#[L32-1, L89-1]don't care [2023-10-12 17:14:11,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:11,877 INFO L85 PathProgramCache]: Analyzing trace with hash 132071, now seen corresponding path program 1 times [2023-10-12 17:14:11,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:11,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613578203] [2023-10-12 17:14:11,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:11,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:11,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:11,963 INFO L85 PathProgramCache]: Analyzing trace with hash 194, now seen corresponding path program 1 times [2023-10-12 17:14:11,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:11,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727811578] [2023-10-12 17:14:11,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:11,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:11,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:11,980 INFO L85 PathProgramCache]: Analyzing trace with hash 4094364, now seen corresponding path program 1 times [2023-10-12 17:14:11,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:11,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698640694] [2023-10-12 17:14:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:11,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:12,094 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:12,094 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:12,094 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:12,094 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:12,095 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:12,095 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:12,095 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:12,095 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:12,095 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:14:12,095 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:12,095 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:12,108 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:12,121 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:12,133 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:12,137 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:12,139 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:12,142 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:12,144 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:12,242 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:12,245 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:12,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:12,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:12,250 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:12,254 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:12,256 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:12,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:12,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:12,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:12,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:12,272 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:12,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:12,289 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:12,310 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:14:12,310 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:12,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:12,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:12,314 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:12,316 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:12,317 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:12,349 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:12,350 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:12,350 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:14:12,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:14:12,356 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:12,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:12,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:12,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:12,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:12,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:12,415 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:12,443 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:12,445 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 55 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:12,530 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 55 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 143 states and 489 transitions. Complement of second has 5 states. [2023-10-12 17:14:12,532 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:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2023-10-12 17:14:12,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:12,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:12,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:14:12,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:12,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:14:12,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:12,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 489 transitions. [2023-10-12 17:14:12,554 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:14:12,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 103 states and 354 transitions. [2023-10-12 17:14:12,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2023-10-12 17:14:12,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2023-10-12 17:14:12,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 354 transitions. [2023-10-12 17:14:12,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:12,561 INFO L219 hiAutomatonCegarLoop]: Abstraction has 103 states and 354 transitions. [2023-10-12 17:14:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 354 transitions. [2023-10-12 17:14:12,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2023-10-12 17:14:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 3.5853658536585367) internal successors, (294), 81 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 294 transitions. [2023-10-12 17:14:12,586 INFO L241 hiAutomatonCegarLoop]: Abstraction has 82 states and 294 transitions. [2023-10-12 17:14:12,587 INFO L430 stractBuchiCegarLoop]: Abstraction has 82 states and 294 transitions. [2023-10-12 17:14:12,587 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:14:12,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 294 transitions. [2023-10-12 17:14:12,589 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:14:12,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:12,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:12,589 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:12,590 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:12,590 INFO L748 eck$LassoCheckResult]: Stem: 495#[$Ultimate##0]don't care [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 369#[L89]don't care [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 371#[$Ultimate##0, L89-1]don't care [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 353#[$Ultimate##0, L90, $Ultimate##0]don't care [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 357#[L52-1, L90, $Ultimate##0]don't care [2023-10-12 17:14:12,590 INFO L750 eck$LassoCheckResult]: Loop: 357#[L52-1, L90, $Ultimate##0]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 357#[L52-1, L90, $Ultimate##0]don't care [2023-10-12 17:14:12,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash 4095378, now seen corresponding path program 1 times [2023-10-12 17:14:12,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:12,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138545238] [2023-10-12 17:14:12,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:12,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:12,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,602 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 1 times [2023-10-12 17:14:12,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:12,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013545079] [2023-10-12 17:14:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:12,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:12,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,615 INFO L85 PathProgramCache]: Analyzing trace with hash 126956883, now seen corresponding path program 1 times [2023-10-12 17:14:12,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:12,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012269492] [2023-10-12 17:14:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:12,669 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:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012269492] [2023-10-12 17:14:12,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012269492] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:12,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:12,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:12,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718992109] [2023-10-12 17:14:12,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:12,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:12,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:12,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:12,781 INFO L87 Difference]: Start difference. First operand 82 states and 294 transitions. cyclomatic complexity: 248 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:12,813 INFO L93 Difference]: Finished difference Result 104 states and 340 transitions. [2023-10-12 17:14:12,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 340 transitions. [2023-10-12 17:14:12,818 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2023-10-12 17:14:12,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 104 states and 340 transitions. [2023-10-12 17:14:12,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2023-10-12 17:14:12,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2023-10-12 17:14:12,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 340 transitions. [2023-10-12 17:14:12,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:12,822 INFO L219 hiAutomatonCegarLoop]: Abstraction has 104 states and 340 transitions. [2023-10-12 17:14:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 340 transitions. [2023-10-12 17:14:12,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-10-12 17:14:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 3.3469387755102042) internal successors, (328), 97 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 328 transitions. [2023-10-12 17:14:12,831 INFO L241 hiAutomatonCegarLoop]: Abstraction has 98 states and 328 transitions. [2023-10-12 17:14:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:12,832 INFO L430 stractBuchiCegarLoop]: Abstraction has 98 states and 328 transitions. [2023-10-12 17:14:12,832 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:14:12,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 328 transitions. [2023-10-12 17:14:12,834 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 23 [2023-10-12 17:14:12,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:12,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:12,835 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:14:12,835 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:12,835 INFO L748 eck$LassoCheckResult]: Stem: 783#[$Ultimate##0]don't care [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 645#[L89]don't care [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 647#[$Ultimate##0, L89-1]don't care [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 623#[$Ultimate##0, L90, $Ultimate##0]don't care [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 629#[$Ultimate##0, L91, $Ultimate##0, $Ultimate##0]don't care [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 615#[$Ultimate##0, L73-1, L91, $Ultimate##0]don't care [2023-10-12 17:14:12,837 INFO L750 eck$LassoCheckResult]: Loop: 615#[$Ultimate##0, L73-1, L91, $Ultimate##0]don't care [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 615#[$Ultimate##0, L73-1, L91, $Ultimate##0]don't care [2023-10-12 17:14:12,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,837 INFO L85 PathProgramCache]: Analyzing trace with hash 126956435, now seen corresponding path program 1 times [2023-10-12 17:14:12,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:12,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483811828] [2023-10-12 17:14:12,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:12,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:12,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash 193, now seen corresponding path program 1 times [2023-10-12 17:14:12,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:12,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31613935] [2023-10-12 17:14:12,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:12,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:12,869 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:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:12,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,881 INFO L85 PathProgramCache]: Analyzing trace with hash -359317649, now seen corresponding path program 1 times [2023-10-12 17:14:12,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:12,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802860728] [2023-10-12 17:14:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:12,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:12,938 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:12,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:12,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802860728] [2023-10-12 17:14:12,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802860728] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:12,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:12,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:12,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721660403] [2023-10-12 17:14:12,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:13,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:13,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:13,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:13,012 INFO L87 Difference]: Start difference. First operand 98 states and 328 transitions. cyclomatic complexity: 267 Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:13,039 INFO L93 Difference]: Finished difference Result 133 states and 413 transitions. [2023-10-12 17:14:13,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 413 transitions. [2023-10-12 17:14:13,046 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2023-10-12 17:14:13,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 111 states and 338 transitions. [2023-10-12 17:14:13,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2023-10-12 17:14:13,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2023-10-12 17:14:13,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 338 transitions. [2023-10-12 17:14:13,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:13,052 INFO L219 hiAutomatonCegarLoop]: Abstraction has 111 states and 338 transitions. [2023-10-12 17:14:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 338 transitions. [2023-10-12 17:14:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2023-10-12 17:14:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 105 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 327 transitions. [2023-10-12 17:14:13,069 INFO L241 hiAutomatonCegarLoop]: Abstraction has 106 states and 327 transitions. [2023-10-12 17:14:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:13,076 INFO L430 stractBuchiCegarLoop]: Abstraction has 106 states and 327 transitions. [2023-10-12 17:14:13,076 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:14:13,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 327 transitions. [2023-10-12 17:14:13,078 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2023-10-12 17:14:13,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:13,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:13,082 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:13,085 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:13,085 INFO L748 eck$LassoCheckResult]: Stem: 1118#[$Ultimate##0]don't care [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 982#[L89]don't care [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 984#[$Ultimate##0, L89-1]don't care [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 1028#[L32-1, L89-1]don't care [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 1030#[L32-1, L89-1]don't care [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1038#[L32-1, $Ultimate##0, L90]don't care [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 1132#[L52-1, L32-1, L90]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 1148#[L52-1, L32-1, L90]don't care [2023-10-12 17:14:13,086 INFO L750 eck$LassoCheckResult]: Loop: 1148#[L52-1, L32-1, L90]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 1148#[L52-1, L32-1, L90]don't care [2023-10-12 17:14:13,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:13,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1716250232, now seen corresponding path program 1 times [2023-10-12 17:14:13,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:13,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966444776] [2023-10-12 17:14:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:13,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 2 times [2023-10-12 17:14:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:13,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709460234] [2023-10-12 17:14:13,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:13,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:13,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1664149805, now seen corresponding path program 2 times [2023-10-12 17:14:13,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:13,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16752577] [2023-10-12 17:14:13,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:13,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:13,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:13,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16752577] [2023-10-12 17:14:13,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16752577] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:13,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:13,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:14:13,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397558185] [2023-10-12 17:14:13,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:13,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:13,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:14:13,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:14:13,350 INFO L87 Difference]: Start difference. First operand 106 states and 327 transitions. cyclomatic complexity: 251 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:13,399 INFO L93 Difference]: Finished difference Result 202 states and 608 transitions. [2023-10-12 17:14:13,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 608 transitions. [2023-10-12 17:14:13,401 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 29 [2023-10-12 17:14:13,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 193 states and 579 transitions. [2023-10-12 17:14:13,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2023-10-12 17:14:13,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2023-10-12 17:14:13,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 579 transitions. [2023-10-12 17:14:13,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:13,405 INFO L219 hiAutomatonCegarLoop]: Abstraction has 193 states and 579 transitions. [2023-10-12 17:14:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 579 transitions. [2023-10-12 17:14:13,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 163. [2023-10-12 17:14:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 163 states have (on average 3.1901840490797544) internal successors, (520), 162 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 520 transitions. [2023-10-12 17:14:13,424 INFO L241 hiAutomatonCegarLoop]: Abstraction has 163 states and 520 transitions. [2023-10-12 17:14:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:14:13,430 INFO L430 stractBuchiCegarLoop]: Abstraction has 163 states and 520 transitions. [2023-10-12 17:14:13,430 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:14:13,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 520 transitions. [2023-10-12 17:14:13,432 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2023-10-12 17:14:13,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:13,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:13,432 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:13,432 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:13,433 INFO L748 eck$LassoCheckResult]: Stem: 1554#[$Ultimate##0]don't care [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 1404#[L89]don't care [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1406#[$Ultimate##0, L89-1]don't care [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 1450#[L32-1, L89-1]don't care [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 1452#[L32-1, L89-1]don't care [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 1460#[L32-1, L89-1]don't care [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1682#[L32-1, $Ultimate##0, L90]don't care [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 1680#[L52-1, L32-1, L90]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 1676#[L52-1, L32-1, L90]don't care [2023-10-12 17:14:13,433 INFO L750 eck$LassoCheckResult]: Loop: 1676#[L52-1, L32-1, L90]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 1676#[L52-1, L32-1, L90]don't care [2023-10-12 17:14:13,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:13,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1664907693, now seen corresponding path program 3 times [2023-10-12 17:14:13,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:13,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488534385] [2023-10-12 17:14:13,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:13,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:13,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 3 times [2023-10-12 17:14:13,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:13,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908904744] [2023-10-12 17:14:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:13,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:13,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:13,489 INFO L85 PathProgramCache]: Analyzing trace with hash 72531096, now seen corresponding path program 4 times [2023-10-12 17:14:13,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:13,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130173763] [2023-10-12 17:14:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:13,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:13,905 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:13,905 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:13,905 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:13,905 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:13,905 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:13,905 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:13,905 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:13,905 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:13,905 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:14:13,906 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:13,906 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:13,908 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:13,917 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:13,919 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:13,999 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:14,002 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:14,004 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:14,007 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:14,010 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:14,298 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:14,298 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:14,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:14,301 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:14,304 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:14,305 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:14,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:14,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:14,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:14,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:14,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:14,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:14,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:14,353 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:14,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:14,355 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:14,363 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:14,364 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:14,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:14,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:14,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:14,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:14,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:14,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:14,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:14,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:14,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:14,397 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:14,407 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:14,407 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:14,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:14,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:14,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:14,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:14,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:14,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:14,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:14,439 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:14,440 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:14:14,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:14,441 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:14,468 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:14,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:14:14,497 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:14,498 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:14,498 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:14:14,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:14:14,512 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:14:14,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:14,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:14,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:14,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:14,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:14,565 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:14,566 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:14,566 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 520 transitions. cyclomatic complexity: 397 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:14,615 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 520 transitions. cyclomatic complexity: 397. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 302 states and 944 transitions. Complement of second has 5 states. [2023-10-12 17:14:14,616 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:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2023-10-12 17:14:14,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:14,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:14,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:14,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:14,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:14,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:14,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 302 states and 944 transitions. [2023-10-12 17:14:14,623 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2023-10-12 17:14:14,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 302 states to 264 states and 805 transitions. [2023-10-12 17:14:14,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2023-10-12 17:14:14,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2023-10-12 17:14:14,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 264 states and 805 transitions. [2023-10-12 17:14:14,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:14,630 INFO L219 hiAutomatonCegarLoop]: Abstraction has 264 states and 805 transitions. [2023-10-12 17:14:14,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states and 805 transitions. [2023-10-12 17:14:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 200. [2023-10-12 17:14:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 200 states have (on average 3.25) internal successors, (650), 199 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 650 transitions. [2023-10-12 17:14:14,656 INFO L241 hiAutomatonCegarLoop]: Abstraction has 200 states and 650 transitions. [2023-10-12 17:14:14,656 INFO L430 stractBuchiCegarLoop]: Abstraction has 200 states and 650 transitions. [2023-10-12 17:14:14,656 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:14:14,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 650 transitions. [2023-10-12 17:14:14,658 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 22 [2023-10-12 17:14:14,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:14,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:14,658 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:14,659 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:14,661 INFO L748 eck$LassoCheckResult]: Stem: 2252#[$Ultimate##0]don't care [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 2086#[L89]don't care [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 2088#[$Ultimate##0, L89-1]don't care [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 2128#[L32-1, L89-1]don't care [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 2130#[L32-1, L89-1]don't care [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 2138#[L32-1, L89-1]don't care [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2302#[L32-1, $Ultimate##0, L90]don't care [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 2304#[L52-1, L32-1, L90]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 2396#[L52-1, L32-1, L90]don't care [164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back] 2358#[L52-1, thread1EXIT, L90]don't care [2023-10-12 17:14:14,661 INFO L750 eck$LassoCheckResult]: Loop: 2358#[L52-1, thread1EXIT, L90]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 2358#[L52-1, thread1EXIT, L90]don't care [2023-10-12 17:14:14,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:14,662 INFO L85 PathProgramCache]: Analyzing trace with hash 72531095, now seen corresponding path program 1 times [2023-10-12 17:14:14,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:14,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492473192] [2023-10-12 17:14:14,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:14,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:14,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:14,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:14,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 4 times [2023-10-12 17:14:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585913523] [2023-10-12 17:14:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:14,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:14,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:14,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:14,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2046503186, now seen corresponding path program 2 times [2023-10-12 17:14:14,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:14,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716537580] [2023-10-12 17:14:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:14,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:14,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:14,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:15,107 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:15,108 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:15,108 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:15,108 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:15,108 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:15,108 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,108 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:15,108 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:15,108 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:14:15,108 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:15,108 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:15,110 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:15,113 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:15,115 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:15,123 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:15,126 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:15,130 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:15,223 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:15,226 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:15,525 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:15,525 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:15,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,529 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:15,532 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:15,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:15,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:15,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:15,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:15,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:15,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:15,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:15,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:15,600 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:15,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,602 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:15,605 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:15,641 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:15,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:15,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:15,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:15,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:15,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:15,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:15,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:15,670 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:15,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,671 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:15,673 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:15,675 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:15,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:15,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:15,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:15,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:15,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:15,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:15,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:15,708 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:15,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,710 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:15,715 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:15,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:15,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:15,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:15,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:15,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:15,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:15,729 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:15,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:15,751 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:15,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,882 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:15,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:14:15,885 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:15,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:15,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:15,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:15,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:15,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:15,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:15,912 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:15,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:15,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,921 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:15,925 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:15,925 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:15,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:15,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:15,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:15,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:15,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:15,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:15,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:15,993 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:15,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,994 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:16,004 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:16,004 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:16,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:16,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:16,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:16,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:16,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:16,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:16,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:16,050 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:14:16,050 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:14:16,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:16,057 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:16,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:16,077 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:16,085 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:16,086 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:16,086 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:14:16,092 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:16,095 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:14:16,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:16,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:16,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:16,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:16,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:14:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:16,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:16,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:16,163 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:16,164 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:16,164 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 650 transitions. cyclomatic complexity: 505 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:16,203 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 650 transitions. cyclomatic complexity: 505. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 312 states and 988 transitions. Complement of second has 4 states. [2023-10-12 17:14:16,204 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:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2023-10-12 17:14:16,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:16,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:16,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:16,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 988 transitions. [2023-10-12 17:14:16,210 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 17 [2023-10-12 17:14:16,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 241 states and 754 transitions. [2023-10-12 17:14:16,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2023-10-12 17:14:16,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2023-10-12 17:14:16,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 241 states and 754 transitions. [2023-10-12 17:14:16,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:16,214 INFO L219 hiAutomatonCegarLoop]: Abstraction has 241 states and 754 transitions. [2023-10-12 17:14:16,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states and 754 transitions. [2023-10-12 17:14:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 190. [2023-10-12 17:14:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 190 states have (on average 3.221052631578947) internal successors, (612), 189 states have internal predecessors, (612), 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:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 612 transitions. [2023-10-12 17:14:16,221 INFO L241 hiAutomatonCegarLoop]: Abstraction has 190 states and 612 transitions. [2023-10-12 17:14:16,222 INFO L430 stractBuchiCegarLoop]: Abstraction has 190 states and 612 transitions. [2023-10-12 17:14:16,224 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:14:16,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 612 transitions. [2023-10-12 17:14:16,226 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:14:16,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:16,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:16,227 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:16,227 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:16,228 INFO L748 eck$LassoCheckResult]: Stem: 3026#[$Ultimate##0]don't care [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 2858#[L89]don't care [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 2860#[$Ultimate##0, L89-1]don't care [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 2900#[L32-1, L89-1]don't care [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 2902#[L32-1, L89-1]don't care [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3168#[L32-1, $Ultimate##0, L90]don't care [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 2960#[L52-1, L32-1, L90]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 2964#[L52-1, L32-1, L90]don't care [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 3016#[L91, L52-1, L32-1, $Ultimate##0]don't care [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 2870#[L73-1, L52-1, L91, L32-1]don't care [2023-10-12 17:14:16,228 INFO L750 eck$LassoCheckResult]: Loop: 2870#[L73-1, L52-1, L91, L32-1]don't care [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 2870#[L73-1, L52-1, L91, L32-1]don't care [2023-10-12 17:14:16,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash 49035779, now seen corresponding path program 1 times [2023-10-12 17:14:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:16,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651438728] [2023-10-12 17:14:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:16,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:16,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:16,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:16,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:16,254 INFO L85 PathProgramCache]: Analyzing trace with hash 193, now seen corresponding path program 2 times [2023-10-12 17:14:16,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:16,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713931700] [2023-10-12 17:14:16,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:16,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:16,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:16,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:16,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1520109311, now seen corresponding path program 1 times [2023-10-12 17:14:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:16,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884455889] [2023-10-12 17:14:16,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:16,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:16,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:16,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:16,634 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:16,634 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:16,634 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:16,634 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:16,634 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:16,635 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,635 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:16,635 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:16,635 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:14:16,635 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:16,635 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:16,637 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:16,639 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:16,641 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:16,643 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:16,645 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:16,648 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:16,650 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:16,651 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:16,653 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:16,655 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:16,729 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:17,043 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:17,043 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:17,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,044 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:17,056 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:17,063 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:17,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:17,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:17,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:17,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:17,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:17,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:17,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:17,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-10-12 17:14:17,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,071 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:17,074 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:17,075 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:17,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:17,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:17,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:17,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:17,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:17,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:17,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:17,099 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:17,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,101 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:17,101 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:17,104 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:17,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:17,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:17,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:17,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:17,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:17,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:17,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:17,125 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:17,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,126 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:17,127 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:17,129 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:17,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:17,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:17,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:17,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:17,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:17,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:17,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:17,157 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:17,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,158 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:17,159 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:17,161 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:17,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:17,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:17,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:17,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:17,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:17,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:17,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:17,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-10-12 17:14:17,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,196 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:17,197 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:17,217 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:17,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:17,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:17,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:17,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:17,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:17,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:17,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:17,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-10-12 17:14:17,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,241 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:17,246 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:17,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:17,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:17,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:17,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:17,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:17,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:17,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:17,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:17,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-10-12 17:14:17,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,320 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:17,321 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:17,339 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:17,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:17,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:17,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:17,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:17,349 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:17,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:17,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:17,365 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:17,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,366 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:17,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:17,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:17,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:17,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:17,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:17,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:17,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:17,386 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:17,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:17,402 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:17,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,404 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:17,406 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:17,407 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:17,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:17,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:17,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:17,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:17,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:17,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:17,421 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:17,426 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:14:17,426 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:17,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:17,429 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:17,431 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:17,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:17,440 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:17,441 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:17,441 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2023-10-12 17:14:17,445 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:17,447 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:14:17,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:17,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:17,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:17,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:17,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:17,490 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:17,490 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:17,490 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 190 states and 612 transitions. cyclomatic complexity: 469 Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:17,522 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 190 states and 612 transitions. cyclomatic complexity: 469. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 364 states and 1077 transitions. Complement of second has 5 states. [2023-10-12 17:14:17,523 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:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2023-10-12 17:14:17,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:17,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:17,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:17,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:17,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:17,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:17,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 364 states and 1077 transitions. [2023-10-12 17:14:17,528 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:14:17,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 364 states to 257 states and 733 transitions. [2023-10-12 17:14:17,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2023-10-12 17:14:17,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2023-10-12 17:14:17,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 257 states and 733 transitions. [2023-10-12 17:14:17,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:17,531 INFO L219 hiAutomatonCegarLoop]: Abstraction has 257 states and 733 transitions. [2023-10-12 17:14:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states and 733 transitions. [2023-10-12 17:14:17,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 202. [2023-10-12 17:14:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 202 states have (on average 3.0693069306930694) internal successors, (620), 201 states have internal predecessors, (620), 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:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 620 transitions. [2023-10-12 17:14:17,537 INFO L241 hiAutomatonCegarLoop]: Abstraction has 202 states and 620 transitions. [2023-10-12 17:14:17,537 INFO L430 stractBuchiCegarLoop]: Abstraction has 202 states and 620 transitions. [2023-10-12 17:14:17,537 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:14:17,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 202 states and 620 transitions. [2023-10-12 17:14:17,539 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:14:17,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:17,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:17,539 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:17,540 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:17,540 INFO L748 eck$LassoCheckResult]: Stem: 3803#[$Ultimate##0]don't care [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 3659#[L89]don't care [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 3661#[$Ultimate##0, L89-1]don't care [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 3701#[L32-1, L89-1]don't care [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 3703#[L32-1, L89-1]don't care [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3715#[L32-1, $Ultimate##0, L90]don't care [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 3899#[L52-1, L32-1, L90]don't care [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 3741#[L91, L52-1, L32-1, $Ultimate##0]don't care [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 3967#[L73-1, L52-1, L91, L32-1]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 3833#[L73-1, L52-1, L91, L32-1]don't care [2023-10-12 17:14:17,540 INFO L750 eck$LassoCheckResult]: Loop: 3833#[L73-1, L52-1, L91, L32-1]don't care [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 3833#[L73-1, L52-1, L91, L32-1]don't care [2023-10-12 17:14:17,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:17,540 INFO L85 PathProgramCache]: Analyzing trace with hash 49012109, now seen corresponding path program 2 times [2023-10-12 17:14:17,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:17,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269166405] [2023-10-12 17:14:17,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:17,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:17,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:17,551 INFO L85 PathProgramCache]: Analyzing trace with hash 193, now seen corresponding path program 3 times [2023-10-12 17:14:17,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:17,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291595788] [2023-10-12 17:14:17,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:17,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:17,573 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:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:17,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1519375541, now seen corresponding path program 2 times [2023-10-12 17:14:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:17,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863349713] [2023-10-12 17:14:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:17,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:17,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:17,928 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:17,928 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:17,928 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:17,928 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:17,928 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:17,928 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:17,928 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:17,928 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:17,928 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:14:17,928 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:17,928 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:17,930 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:17,933 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:17,935 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:17,937 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:17,939 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:17,941 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:17,944 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:17,946 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:17,954 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:17,956 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:17,958 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:18,321 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:18,321 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:18,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,322 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:18,324 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:18,325 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:18,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:18,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:18,336 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:18,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-10-12 17:14:18,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,347 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:18,348 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:18,350 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:18,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:18,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:18,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:18,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-10-12 17:14:18,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,364 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:18,365 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:18,367 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:18,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:18,375 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:18,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:18,387 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:18,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,388 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:18,389 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:18,391 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:18,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:18,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:18,406 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:18,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:18,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,410 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:18,417 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:18,420 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:18,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:18,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:18,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:18,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-10-12 17:14:18,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,431 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:18,432 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:18,434 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:18,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:18,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:18,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:18,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-10-12 17:14:18,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,470 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:18,472 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:18,474 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:18,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:18,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:18,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:18,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-10-12 17:14:18,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,513 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:18,514 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:18,516 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:18,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:18,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:18,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:18,531 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:18,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,532 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:18,533 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:18,535 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:18,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:18,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:18,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:18,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2023-10-12 17:14:18,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,548 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:18,550 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:18,551 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:18,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:18,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:18,561 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:18,565 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:18,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,567 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:18,568 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:18,570 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:18,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:18,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:18,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:18,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:18,581 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:18,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:18,594 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:18,601 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:14:18,601 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:18,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:18,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:18,602 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:18,604 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:18,606 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:18,612 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:18,613 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:18,613 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2023-10-12 17:14:18,617 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:18,619 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:14:18,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:18,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:18,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:18,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:18,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:18,656 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:18,656 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:18,656 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 202 states and 620 transitions. cyclomatic complexity: 474 Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:18,702 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 202 states and 620 transitions. cyclomatic complexity: 474. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 450 states and 1358 transitions. Complement of second has 5 states. [2023-10-12 17:14:18,703 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:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2023-10-12 17:14:18,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:18,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:18,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:18,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:18,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:18,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:18,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 450 states and 1358 transitions. [2023-10-12 17:14:18,710 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:14:18,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 450 states to 373 states and 1082 transitions. [2023-10-12 17:14:18,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2023-10-12 17:14:18,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2023-10-12 17:14:18,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 1082 transitions. [2023-10-12 17:14:18,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:18,715 INFO L219 hiAutomatonCegarLoop]: Abstraction has 373 states and 1082 transitions. [2023-10-12 17:14:18,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 1082 transitions. [2023-10-12 17:14:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 266. [2023-10-12 17:14:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 266 states have (on average 2.9586466165413534) internal successors, (787), 265 states have internal predecessors, (787), 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:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 787 transitions. [2023-10-12 17:14:18,723 INFO L241 hiAutomatonCegarLoop]: Abstraction has 266 states and 787 transitions. [2023-10-12 17:14:18,723 INFO L430 stractBuchiCegarLoop]: Abstraction has 266 states and 787 transitions. [2023-10-12 17:14:18,723 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:14:18,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 787 transitions. [2023-10-12 17:14:18,726 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:14:18,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:18,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:18,726 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1] [2023-10-12 17:14:18,726 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:18,727 INFO L748 eck$LassoCheckResult]: Stem: 4702#[$Ultimate##0]don't care [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 4558#[L89]don't care [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 4560#[$Ultimate##0, L89-1]don't care [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 4598#[L32-1, L89-1]don't care [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 4600#[L32-1, L89-1]don't care [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 4604#[L32-1, L89-1]don't care [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 4610#[L32-1, $Ultimate##0, L90]don't care [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 4676#[L52-1, L32-1, L90]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 4884#[L52-1, L32-1, L90]don't care [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 4846#[L52-1, L32-1, L90]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 4924#[L52-1, L32-1, L90]don't care [2023-10-12 17:14:18,727 INFO L750 eck$LassoCheckResult]: Loop: 4924#[L52-1, L32-1, L90]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 4924#[L52-1, L32-1, L90]don't care [2023-10-12 17:14:18,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:18,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2046503217, now seen corresponding path program 5 times [2023-10-12 17:14:18,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:18,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945873191] [2023-10-12 17:14:18,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:18,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:18,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash 196, now seen corresponding path program 5 times [2023-10-12 17:14:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:18,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189553323] [2023-10-12 17:14:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:18,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:18,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:18,773 INFO L85 PathProgramCache]: Analyzing trace with hash 982909878, now seen corresponding path program 6 times [2023-10-12 17:14:18,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:18,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266330286] [2023-10-12 17:14:18,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:18,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:18,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:19,083 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:19,226 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:19,227 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:19,227 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:19,227 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:19,227 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:19,227 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,227 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:19,227 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:19,227 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration9_Lasso [2023-10-12 17:14:19,227 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:19,227 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:19,229 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:19,231 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:19,241 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:19,243 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:19,245 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:19,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:19,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:19,383 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:19,758 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:19,758 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:19,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,761 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:19,765 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:19,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:19,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:19,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:19,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:19,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:19,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:19,777 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:19,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:19,792 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:19,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,795 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:19,801 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:19,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:19,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:19,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:19,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:19,809 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:19,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:19,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:19,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:19,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:19,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,818 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:19,820 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:19,821 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:19,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:19,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:19,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:19,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:19,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:19,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:19,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:19,836 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:19,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,837 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:19,846 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:19,849 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:19,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:19,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:19,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:19,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:19,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:19,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:19,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:19,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2023-10-12 17:14:19,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,859 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:19,860 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:19,862 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:19,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:19,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:19,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:19,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:19,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:19,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:19,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:19,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-10-12 17:14:19,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,884 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:19,890 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:19,891 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:19,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:19,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:19,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:19,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:19,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:19,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:19,914 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:19,918 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:19,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,919 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:19,921 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:19,922 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:19,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:19,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:19,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:19,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:19,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:19,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:19,952 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:19,958 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:19,959 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:14:19,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:19,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:19,961 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:19,972 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:19,980 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:19,994 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:19,994 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:19,994 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2023-10-12 17:14:19,998 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:20,002 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:14:20,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:20,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:20,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:20,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:20,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:20,052 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:20,052 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:20,052 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 266 states and 787 transitions. cyclomatic complexity: 581 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,091 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 266 states and 787 transitions. cyclomatic complexity: 581. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 392 states and 1088 transitions. Complement of second has 5 states. [2023-10-12 17:14:20,091 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:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2023-10-12 17:14:20,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:20,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:20,092 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:20,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:20,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:20,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:20,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:20,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:20,141 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:20,142 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:20,142 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 266 states and 787 transitions. cyclomatic complexity: 581 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,169 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 266 states and 787 transitions. cyclomatic complexity: 581. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 392 states and 1088 transitions. Complement of second has 5 states. [2023-10-12 17:14:20,170 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:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2023-10-12 17:14:20,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:20,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:20,171 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:20,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:20,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:20,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:20,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:20,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:20,210 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:20,211 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:20,211 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 266 states and 787 transitions. cyclomatic complexity: 581 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,244 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 266 states and 787 transitions. cyclomatic complexity: 581. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 435 states and 1229 transitions. Complement of second has 4 states. [2023-10-12 17:14:20,244 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:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2023-10-12 17:14:20,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:20,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:20,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:14:20,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:20,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:20,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:20,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 435 states and 1229 transitions. [2023-10-12 17:14:20,250 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 17 [2023-10-12 17:14:20,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 435 states to 333 states and 940 transitions. [2023-10-12 17:14:20,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2023-10-12 17:14:20,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2023-10-12 17:14:20,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 333 states and 940 transitions. [2023-10-12 17:14:20,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:20,254 INFO L219 hiAutomatonCegarLoop]: Abstraction has 333 states and 940 transitions. [2023-10-12 17:14:20,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states and 940 transitions. [2023-10-12 17:14:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 255. [2023-10-12 17:14:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 255 states have (on average 2.9098039215686273) internal successors, (742), 254 states have internal predecessors, (742), 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:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 742 transitions. [2023-10-12 17:14:20,261 INFO L241 hiAutomatonCegarLoop]: Abstraction has 255 states and 742 transitions. [2023-10-12 17:14:20,261 INFO L430 stractBuchiCegarLoop]: Abstraction has 255 states and 742 transitions. [2023-10-12 17:14:20,261 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:14:20,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 742 transitions. [2023-10-12 17:14:20,263 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2023-10-12 17:14:20,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:20,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:20,264 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:20,264 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:20,264 INFO L748 eck$LassoCheckResult]: Stem: 6564#[$Ultimate##0]don't care [102] $Ultimate##0-->L89: Formula: (and (<= 0 v_N_3) (= v_x_5 0) (= v_q2_front_1 v_q2_back_4) (= v_y_3 v_x_5) (= v_q1_back_8 v_q1_front_5) (= v_z_1 v_x_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, z=v_z_1, q2_back=v_q2_back_4, y=v_y_3, x=v_x_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 6440#[L89]don't care [134] L89-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 6442#[$Ultimate##0, L89-1]don't care [104] $Ultimate##0-->L32-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 6468#[L32-1, L89-1]don't care [163] L32-1-->L32-1: Formula: (and (= (+ v_C_27 v_x_32) v_x_31) (< v_i_13 v_N_15) (= (+ 1 v_q1_back_64) v_q1_back_63) (= 1 (select v_q1_38 v_q1_back_64)) (= (+ v_i_13 1) v_i_12)) InVars {q1=v_q1_38, N=v_N_15, i=v_i_13, x=v_x_32, C=v_C_27, q1_back=v_q1_back_64} OutVars{q1=v_q1_38, N=v_N_15, i=v_i_12, x=v_x_31, C=v_C_27, q1_back=v_q1_back_63} AuxVars[] AssignedVars[i, x, q1_back] 6470#[L32-1, L89-1]don't care [137] L89-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 6478#[L32-1, $Ultimate##0, L90]don't care [154] $Ultimate##0-->L52-1: Formula: (and v_f_7 (= v_s_4 0)) InVars {} OutVars{f=v_f_7, s=v_s_4} AuxVars[] AssignedVars[f, s] 6608#[L52-1, L32-1, L90]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 6602#[L52-1, L32-1, L90]don't care [164] L32-1-->thread1EXIT: Formula: (and (<= v_N_19 v_i_18) (= (select v_q1_42 v_q1_back_72) 0) (= (+ 1 v_q1_back_72) v_q1_back_71) (= v_x_39 (+ v_C_31 v_x_40))) InVars {q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_40, C=v_C_31, q1_back=v_q1_back_72} OutVars{q1=v_q1_42, N=v_N_19, i=v_i_18, x=v_x_39, C=v_C_31, q1_back=v_q1_back_71} AuxVars[] AssignedVars[x, q1_back] 6600#[L52-1, thread1EXIT, L90]don't care [140] L90-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 6586#[L91, thread1EXIT, L52-1, $Ultimate##0]don't care [151] $Ultimate##0-->L73-1: Formula: (and v_g_9 (= v_t_9 0)) InVars {} OutVars{g=v_g_9, t=v_t_9} AuxVars[] AssignedVars[g, t] 6588#[L52-1, thread1EXIT, L91, L73-1]don't care [165] L52-1-->L52-1: Formula: (and (= v_q2_back_50 (+ v_q2_back_51 1)) (let ((.cse0 (= v_j_39 0))) (or (and .cse0 (not v_f_25)) (and v_f_25 (not .cse0)))) (= v_j_39 (select v_q2_31 v_q2_back_51)) v_f_26 (= (+ v_j_39 v_s_11) v_s_10) (= v_y_17 (+ v_C_37 v_y_18)) (< v_q1_front_63 v_q1_back_81) (= (select v_q1_48 v_q1_front_63) v_j_39) (= v_q1_front_62 (+ v_q1_front_63 1))) InVars {q1_front=v_q1_front_63, q1=v_q1_48, q2=v_q2_31, q2_back=v_q2_back_51, y=v_y_18, f=v_f_26, C=v_C_37, s=v_s_11, q1_back=v_q1_back_81} OutVars{q1_front=v_q1_front_62, q1=v_q1_48, q2=v_q2_31, j=v_j_39, q2_back=v_q2_back_50, y=v_y_17, f=v_f_25, C=v_C_37, s=v_s_10, q1_back=v_q1_back_81} AuxVars[] AssignedVars[q1_front, j, q2_back, y, f, s] 6662#[L52-1, thread1EXIT, L91, L73-1]don't care [2023-10-12 17:14:20,264 INFO L750 eck$LassoCheckResult]: Loop: 6662#[L52-1, thread1EXIT, L91, L73-1]don't care [162] L73-1-->L73-1: Formula: (and (= v_k_18 (select v_q2_21 v_q2_front_31)) v_g_18 (= v_q2_front_30 (+ v_q2_front_31 1)) (= v_t_23 (+ v_k_18 v_t_24)) (< v_q2_front_31 v_q2_back_32) (= (+ v_C_23 v_z_22) v_z_21) (let ((.cse0 (= v_k_18 0))) (or (and (not v_g_17) .cse0) (and v_g_17 (not .cse0))))) InVars {q2=v_q2_21, z=v_z_22, q2_back=v_q2_back_32, g=v_g_18, t=v_t_24, C=v_C_23, q2_front=v_q2_front_31} OutVars{q2=v_q2_21, k=v_k_18, z=v_z_21, q2_back=v_q2_back_32, g=v_g_17, t=v_t_23, C=v_C_23, q2_front=v_q2_front_30} AuxVars[] AssignedVars[k, z, g, t, q2_front] 6662#[L52-1, thread1EXIT, L91, L73-1]don't care [2023-10-12 17:14:20,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,265 INFO L85 PathProgramCache]: Analyzing trace with hash -120547378, now seen corresponding path program 1 times [2023-10-12 17:14:20,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:20,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924272979] [2023-10-12 17:14:20,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:20,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,280 INFO L85 PathProgramCache]: Analyzing trace with hash 193, now seen corresponding path program 4 times [2023-10-12 17:14:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:20,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292313888] [2023-10-12 17:14:20,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:20,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:20,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:20,285 INFO L85 PathProgramCache]: Analyzing trace with hash 557998740, now seen corresponding path program 1 times [2023-10-12 17:14:20,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:20,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562217496] [2023-10-12 17:14:20,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:20,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:20,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:20,539 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:20,755 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:20,755 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:20,755 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:20,755 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:20,755 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:20,755 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,755 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:20,755 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:20,755 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-3-nl.wvr.bpl_BEv2_Iteration10_Lasso [2023-10-12 17:14:20,755 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:20,755 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:20,757 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:20,761 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:20,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:20,767 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,770 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,772 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,774 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,892 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:20,895 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:20,897 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:20,899 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:21,273 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:21,273 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:21,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:21,277 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:21,280 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:21,282 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:21,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:21,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:21,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:21,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:21,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:21,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:21,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:21,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-10-12 17:14:21,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:21,295 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:21,297 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:21,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:21,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:21,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:21,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:21,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:21,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:21,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:21,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:21,310 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:21,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:21,311 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:21,313 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:21,314 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:21,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:21,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:21,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:21,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:21,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:21,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:21,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:21,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2023-10-12 17:14:21,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:21,327 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:21,329 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:21,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:21,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:21,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:21,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:21,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:21,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:21,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:21,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:21,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2023-10-12 17:14:21,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:21,343 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:21,345 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:21,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:21,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:21,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:21,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:21,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:21,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:21,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:21,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:21,358 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:21,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:21,359 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:21,361 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:21,363 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:21,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:21,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:21,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:21,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:21,370 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:21,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:21,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:21,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2023-10-12 17:14:21,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:21,401 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:21,403 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:21,404 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:21,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:21,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:21,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:21,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:21,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:21,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:21,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:21,431 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:21,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:21,432 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:21,434 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:21,436 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:21,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:21,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:21,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:21,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:21,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:21,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:21,450 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:21,455 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:14:21,455 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:21,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:21,461 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:21,464 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:21,466 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:21,474 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:21,474 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:21,474 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2023-10-12 17:14:21,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2023-10-12 17:14:21,483 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-10-12 17:14:21,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:21,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:21,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:21,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:21,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:21,533 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:21,534 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:21,534 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 255 states and 742 transitions. cyclomatic complexity: 537 Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,562 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 255 states and 742 transitions. cyclomatic complexity: 537. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 408 states and 1118 transitions. Complement of second has 5 states. [2023-10-12 17:14:21,562 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:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2023-10-12 17:14:21,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:14:21,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:21,563 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:21,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:21,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:21,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:21,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:21,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:21,613 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:21,614 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:21,614 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 255 states and 742 transitions. cyclomatic complexity: 537 Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,645 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 255 states and 742 transitions. cyclomatic complexity: 537. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 408 states and 1118 transitions. Complement of second has 5 states. [2023-10-12 17:14:21,646 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:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2023-10-12 17:14:21,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:14:21,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:21,647 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:21,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:21,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:21,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:21,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:21,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:21,698 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:21,698 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:21,698 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 255 states and 742 transitions. cyclomatic complexity: 537 Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,732 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 255 states and 742 transitions. cyclomatic complexity: 537. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 518 states and 1504 transitions. Complement of second has 5 states. [2023-10-12 17:14:21,733 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:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2023-10-12 17:14:21,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:14:21,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:21,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 12 letters. Loop has 1 letters. [2023-10-12 17:14:21,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:21,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:14:21,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:21,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 518 states and 1504 transitions. [2023-10-12 17:14:21,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:21,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 518 states to 0 states and 0 transitions. [2023-10-12 17:14:21,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:14:21,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:14:21,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:14:21,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:14:21,739 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:21,739 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:21,739 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:21,740 INFO L337 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-10-12 17:14:21,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:14:21,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:21,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:14:21,745 INFO L201 PluginConnector]: Adding new model queue-add-3-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:21 BoogieIcfgContainer [2023-10-12 17:14:21,745 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:21,746 INFO L158 Benchmark]: Toolchain (without parser) took 11398.05ms. Allocated memory was 185.6MB in the beginning and 293.6MB in the end (delta: 108.0MB). Free memory was 139.3MB in the beginning and 125.0MB in the end (delta: 14.3MB). Peak memory consumption was 123.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:21,746 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.28ms. Allocated memory is still 185.6MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:21,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.37ms. Allocated memory is still 185.6MB. Free memory was 139.3MB in the beginning and 137.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:14:21,746 INFO L158 Benchmark]: Boogie Preprocessor took 30.05ms. Allocated memory is still 185.6MB. Free memory was 137.7MB in the beginning and 136.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:21,747 INFO L158 Benchmark]: RCFGBuilder took 313.00ms. Allocated memory is still 185.6MB. Free memory was 136.7MB in the beginning and 125.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-10-12 17:14:21,747 INFO L158 Benchmark]: BuchiAutomizer took 11027.02ms. Allocated memory was 185.6MB in the beginning and 293.6MB in the end (delta: 108.0MB). Free memory was 124.9MB in the beginning and 125.0MB in the end (delta: -148.0kB). Peak memory consumption was 108.3MB. Max. memory is 8.0GB. [2023-10-12 17:14:21,748 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.28ms. Allocated memory is still 185.6MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.37ms. Allocated memory is still 185.6MB. Free memory was 139.3MB in the beginning and 137.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.05ms. Allocated memory is still 185.6MB. Free memory was 137.7MB in the beginning and 136.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 313.00ms. Allocated memory is still 185.6MB. Free memory was 136.7MB in the beginning and 125.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 11027.02ms. Allocated memory was 185.6MB in the beginning and 293.6MB in the end (delta: 108.0MB). Free memory was 124.9MB in the beginning and 125.0MB in the end (delta: -148.0kB). Peak memory consumption was 108.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (3 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One nondeterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One nondeterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.8s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 8.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 417 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 270 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 259 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 398 IncrementalHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 29 mSDtfsCounter, 398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf100 lsp62 ukn98 mio100 lsp67 div100 bol111 ite100 ukn100 eq190 hnf90 smp100 dnf231 smp65 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 103ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.9s - 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.9s, 46 PlacesBefore, 25 PlacesAfterwards, 39 TransitionsBefore, 18 TransitionsAfterwards, 634 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 22 TotalNumberOfCompositions, 535 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 503, independent: 497, independent conditional: 0, independent unconditional: 497, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 395, independent: 389, independent conditional: 0, independent unconditional: 389, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 395, independent: 384, independent conditional: 0, independent unconditional: 384, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 503, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 395, unknown conditional: 0, unknown unconditional: 395] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:14:21,765 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:21,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...