/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_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/counter-queue.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:25:22,482 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:25:22,542 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:25:22,563 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:25:22,564 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:25:22,564 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:25:22,566 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:25:22,566 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:25:22,566 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:25:22,569 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:25:22,570 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:25:22,570 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:25:22,570 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:25:22,571 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:25:22,572 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:25:22,572 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:25:22,572 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:25:22,572 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:25:22,572 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:25:22,572 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:25:22,573 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:25:22,573 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:25:22,573 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:25:22,573 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:25:22,573 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:25:22,574 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:25:22,574 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:25:22,574 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:25:22,574 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:25:22,574 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:25:22,575 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:25:22,575 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:25:22,575 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:25:22,576 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:25:22,577 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_PETRI_NET [2023-10-12 17:25:22,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:25:22,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:25:22,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:25:22,788 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:25:22,788 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:25:22,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/counter-queue.wvr.bpl [2023-10-12 17:25:22,790 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/counter-queue.wvr.bpl' [2023-10-12 17:25:22,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:25:22,811 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:25:22,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:25:22,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:25:22,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:25:22,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:22" (1/1) ... [2023-10-12 17:25:22,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:22" (1/1) ... [2023-10-12 17:25:22,833 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:25:22,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:25:22,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:25:22,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:25:22,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:25:22,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:22" (1/1) ... [2023-10-12 17:25:22,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:22" (1/1) ... [2023-10-12 17:25:22,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:22" (1/1) ... [2023-10-12 17:25:22,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:22" (1/1) ... [2023-10-12 17:25:22,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:22" (1/1) ... [2023-10-12 17:25:22,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:22" (1/1) ... [2023-10-12 17:25:22,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:22" (1/1) ... [2023-10-12 17:25:22,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:22" (1/1) ... [2023-10-12 17:25:22,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:25:22,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:25:22,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:25:22,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:25:22,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:22" (1/1) ... [2023-10-12 17:25:22,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:22,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:22,874 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:25:22,882 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:25:22,905 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:25:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:25:22,905 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:25:22,905 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:25:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:25:22,905 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:25:22,906 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:25:22,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:25:22,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:25:22,906 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:25:22,941 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:25:22,943 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:25:23,023 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:25:23,037 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:25:23,037 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:25:23,039 INFO L201 PluginConnector]: Adding new model counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:25:23 BoogieIcfgContainer [2023-10-12 17:25:23,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:25:23,040 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:25:23,040 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:25:23,042 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:25:23,043 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:25:23,043 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:25:22" (1/2) ... [2023-10-12 17:25:23,044 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c70d65a and model type counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:25:23, skipping insertion in model container [2023-10-12 17:25:23,044 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:25:23,044 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:25:23" (2/2) ... [2023-10-12 17:25:23,045 INFO L332 chiAutomizerObserver]: Analyzing ICFG counter-queue.wvr.bpl [2023-10-12 17:25:23,096 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:25:23,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 64 flow [2023-10-12 17:25:23,127 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2023-10-12 17:25:23,128 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:25:23,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-10-12 17:25:23,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 24 transitions, 64 flow [2023-10-12 17:25:23,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 20 transitions, 52 flow [2023-10-12 17:25:23,136 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:25:23,145 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 52 flow [2023-10-12 17:25:23,147 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 52 flow [2023-10-12 17:25:23,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 52 flow [2023-10-12 17:25:23,151 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2023-10-12 17:25:23,151 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:25:23,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 2/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-10-12 17:25:23,152 INFO L119 LiptonReduction]: Number of co-enabled transitions 48 [2023-10-12 17:25:23,283 INFO L134 LiptonReduction]: Checked pairs total: 42 [2023-10-12 17:25:23,284 INFO L136 LiptonReduction]: Total number of compositions: 10 [2023-10-12 17:25:23,292 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:25:23,293 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:25:23,293 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:25:23,293 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:25:23,293 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:25:23,293 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:25:23,293 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:25:23,293 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:25:23,293 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:25:23,296 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:23,296 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:25:23,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:25:23,296 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:23,298 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:25:23,298 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:25:23,299 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:23,299 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:25:23,299 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:25:23,299 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:23,302 INFO L748 eck$LassoCheckResult]: Stem: 31#[$Ultimate##0]true [75] $Ultimate##0-->L45: Formula: (and (= v_counter_29 0) (= v_i1_19 0) (= v_N2_10 v_N1_10) (= v_i2_19 0)) InVars {counter=v_counter_29, i1=v_i1_19, i2=v_i2_19, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_29, i1=v_i1_19, i2=v_i2_19, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 33#[L45]true [60] L45-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 35#[L20-1, L45-1]true [2023-10-12 17:25:23,303 INFO L750 eck$LassoCheckResult]: Loop: 35#[L20-1, L45-1]true [69] L20-1-->L20-1: Formula: (and (< v_i1_14 v_N1_8) (= v_counter_15 (+ v_counter_16 (select v_A_7 v_i1_14))) (= (+ v_i1_14 1) v_i1_13)) InVars {A=v_A_7, counter=v_counter_16, i1=v_i1_14, N1=v_N1_8} OutVars{A=v_A_7, counter=v_counter_15, i1=v_i1_13, N1=v_N1_8} AuxVars[] AssignedVars[counter, i1] 35#[L20-1, L45-1]true [2023-10-12 17:25:23,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash 3346, now seen corresponding path program 1 times [2023-10-12 17:25:23,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:23,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515658880] [2023-10-12 17:25:23,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:23,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:23,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:23,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:23,417 INFO L85 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 1 times [2023-10-12 17:25:23,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:23,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189672985] [2023-10-12 17:25:23,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:23,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:23,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:23,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:23,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:23,455 INFO L85 PathProgramCache]: Analyzing trace with hash 103795, now seen corresponding path program 1 times [2023-10-12 17:25:23,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:23,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838729170] [2023-10-12 17:25:23,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:23,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:23,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:23,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:23,552 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:23,553 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:23,553 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:23,553 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:23,553 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:23,553 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:23,553 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:23,553 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:23,553 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-queue.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:25:23,553 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:23,554 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:23,564 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:25:23,572 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:25:23,575 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:25:23,650 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:23,653 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:23,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:23,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:23,673 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:25:23,674 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:25:23,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:25:23,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:23,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:23,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:23,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:23,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:23,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:23,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:23,724 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:25:23,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:23,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:23,726 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:25:23,728 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:25:23,730 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:25:23,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:23,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:23,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:23,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:23,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:23,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:23,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:23,770 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:25:23,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:23,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:23,778 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:25:23,780 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:25:23,781 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:25:23,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:23,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:23,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:23,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:23,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:23,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:23,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:23,810 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:25:23,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:23,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:23,812 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:25:23,813 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:25:23,815 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:25:23,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:23,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:23,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:23,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:23,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:23,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:23,845 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:23,852 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:25:23,852 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:25:23,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:23,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:23,855 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:25:23,856 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:25:23,858 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:23,879 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:25:23,879 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:23,880 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N1) = -1*i1 + 1*N1 Supporting invariants [] [2023-10-12 17:25:23,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:25:23,895 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:25:23,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:23,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:25:23,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:23,933 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:25:23,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:23,933 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:25:23,960 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:25:23,962 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:24,017 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 196 transitions. [2023-10-12 17:25:24,019 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:25:24,020 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:25:24,021 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:25:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:25:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2023-10-12 17:25:24,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:25:24,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:24,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:25:24,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:24,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:25:24,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:24,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 124 transitions, 640 flow [2023-10-12 17:25:24,036 INFO L124 PetriNetUnfolderBase]: 31/63 cut-off events. [2023-10-12 17:25:24,036 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-10-12 17:25:24,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 63 events. 31/63 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 149 event pairs, 2 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 96. Up to 21 conditions per place. [2023-10-12 17:25:24,036 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 26 places, 124 transitions, 640 flow [2023-10-12 17:25:24,039 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 26 places, 124 transitions, 640 flow [2023-10-12 17:25:24,039 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 124 transitions, 640 flow [2023-10-12 17:25:24,039 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:25:24,039 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 places, 124 transitions, 640 flow [2023-10-12 17:25:24,044 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:25:24,044 INFO L124 PetriNetUnfolderBase]: 18/31 cut-off events. [2023-10-12 17:25:24,044 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:25:24,044 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:25:24,044 INFO L748 eck$LassoCheckResult]: Stem: 31#[$Ultimate##0]true [75] $Ultimate##0-->L45: Formula: (and (= v_counter_29 0) (= v_i1_19 0) (= v_N2_10 v_N1_10) (= v_i2_19 0)) InVars {counter=v_counter_29, i1=v_i1_19, i2=v_i2_19, N2=v_N2_10, N1=v_N1_10} OutVars{counter=v_counter_29, i1=v_i1_19, i2=v_i2_19, N2=v_N2_10, N1=v_N1_10} AuxVars[] AssignedVars[] 33#[L45]true [60] L45-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 35#[L20-1, L45-1]true [63] L45-1-->L31-1: 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] 80#[L20-1, L46, L31-1]true [2023-10-12 17:25:24,044 INFO L750 eck$LassoCheckResult]: Loop: 80#[L20-1, L46, L31-1]true [72] L31-1-->L31-1: Formula: (and (= v_counter_22 (+ v_counter_21 (select v_A_9 v_i2_16))) (= (+ v_i2_16 1) v_i2_15) (< v_i2_16 v_N2_8)) InVars {A=v_A_9, counter=v_counter_22, i2=v_i2_16, N2=v_N2_8} OutVars{A=v_A_9, counter=v_counter_21, i2=v_i2_15, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2] 80#[L20-1, L46, L31-1]true [72] L31-1-->L31-1: Formula: (and (= v_counter_22 (+ v_counter_21 (select v_A_9 v_i2_16))) (= (+ v_i2_16 1) v_i2_15) (< v_i2_16 v_N2_8)) InVars {A=v_A_9, counter=v_counter_22, i2=v_i2_16, N2=v_N2_8} OutVars{A=v_A_9, counter=v_counter_21, i2=v_i2_15, N2=v_N2_8} AuxVars[] AssignedVars[counter, i2] 80#[L20-1, L46, L31-1]true [2023-10-12 17:25:24,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:24,045 INFO L85 PathProgramCache]: Analyzing trace with hash 103789, now seen corresponding path program 1 times [2023-10-12 17:25:24,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:24,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127391245] [2023-10-12 17:25:24,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:24,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:24,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:24,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:24,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:24,051 INFO L85 PathProgramCache]: Analyzing trace with hash 3265, now seen corresponding path program 1 times [2023-10-12 17:25:24,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:24,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506795582] [2023-10-12 17:25:24,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:24,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:24,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:24,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:24,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:24,061 INFO L85 PathProgramCache]: Analyzing trace with hash 99743533, now seen corresponding path program 1 times [2023-10-12 17:25:24,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:25:24,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553400626] [2023-10-12 17:25:24,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:25:24,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:25:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:24,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:25:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:25:24,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:25:24,160 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:25:24,160 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:25:24,160 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:25:24,160 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:25:24,160 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:25:24,160 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:24,160 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:25:24,160 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:25:24,160 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-queue.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:25:24,160 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:25:24,162 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:25:24,164 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:25:24,166 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:25:24,183 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:25:24,188 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:25:24,196 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:25:24,249 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:25:24,281 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:25:24,281 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:25:24,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:24,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:24,287 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:25:24,293 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:25:24,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:24,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:24,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:24,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:24,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:24,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:24,303 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:25:24,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:25:24,339 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:25:24,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:24,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:24,353 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:25:24,384 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:25:24,385 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:25:24,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:25:24,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:25:24,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:25:24,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:25:24,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:25:24,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:25:24,417 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:25:24,435 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2023-10-12 17:25:24,435 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:25:24,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:25:24,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:25:24,457 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:25:24,494 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:25:24,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:25:24,517 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-10-12 17:25:24,517 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:25:24,518 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N1) = -1*i2 + 1*N1 Supporting invariants [-1*N2 + 1*N1 >= 0] [2023-10-12 17:25:24,534 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:25:24,540 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:25:24,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:25:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:24,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:25:24,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:25:24,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:25:24,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:25:24,595 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:25:24,596 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2023-10-12 17:25:24,596 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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:25:24,759 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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) Result 10 states and 364 transitions. [2023-10-12 17:25:24,760 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:25:24,772 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:25:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2023-10-12 17:25:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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:25:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2023-10-12 17:25:24,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:25:24,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:24,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:25:24,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:24,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:25:24,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:25:24,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 2632 transitions, 18960 flow [2023-10-12 17:25:24,837 INFO L124 PetriNetUnfolderBase]: 67/136 cut-off events. [2023-10-12 17:25:24,837 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-10-12 17:25:24,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 136 events. 67/136 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 240. Up to 48 conditions per place. [2023-10-12 17:25:24,838 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 46 places, 2632 transitions, 18960 flow [2023-10-12 17:25:24,865 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 46 places, 2632 transitions, 18960 flow [2023-10-12 17:25:24,865 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 2632 transitions, 18960 flow [2023-10-12 17:25:24,865 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:25:24,865 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 places, 2632 transitions, 18960 flow [2023-10-12 17:25:24,891 INFO L124 PetriNetUnfolderBase]: 67/136 cut-off events. [2023-10-12 17:25:24,891 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-10-12 17:25:24,891 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:25:24,895 INFO L201 PluginConnector]: Adding new model counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:25:24 BoogieIcfgContainer [2023-10-12 17:25:24,896 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:25:24,896 INFO L158 Benchmark]: Toolchain (without parser) took 2085.13ms. Allocated memory was 215.0MB in the beginning and 276.8MB in the end (delta: 61.9MB). Free memory was 165.3MB in the beginning and 185.5MB in the end (delta: -20.2MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. [2023-10-12 17:25:24,897 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 215.0MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:25:24,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.56ms. Allocated memory is still 215.0MB. Free memory was 165.3MB in the beginning and 163.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:25:24,897 INFO L158 Benchmark]: Boogie Preprocessor took 12.20ms. Allocated memory is still 215.0MB. Free memory was 163.7MB in the beginning and 162.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:25:24,898 INFO L158 Benchmark]: RCFGBuilder took 191.29ms. Allocated memory is still 215.0MB. Free memory was 162.7MB in the beginning and 153.2MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:25:24,898 INFO L158 Benchmark]: BuchiAutomizer took 1855.94ms. Allocated memory was 215.0MB in the beginning and 276.8MB in the end (delta: 61.9MB). Free memory was 153.0MB in the beginning and 185.5MB in the end (delta: -32.5MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. [2023-10-12 17:25:24,899 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24ms. Allocated memory is still 215.0MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.56ms. Allocated memory is still 215.0MB. Free memory was 165.3MB in the beginning and 163.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.20ms. Allocated memory is still 215.0MB. Free memory was 163.7MB in the beginning and 162.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 191.29ms. Allocated memory is still 215.0MB. Free memory was 162.7MB in the beginning and 153.2MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1855.94ms. Allocated memory was 215.0MB in the beginning and 276.8MB in the end (delta: 61.9MB). Free memory was 153.0MB in the beginning and 185.5MB in the end (delta: -32.5MB). Peak memory consumption was 28.5MB. 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N1 + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + N1 and consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 253 IncrementalHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 92 mSDtfsCounter, 253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp77 ukn87 mio100 lsp66 div100 bol100 ite100 ukn100 eq182 hnf90 smp100 dnf100 smp100 tf100 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 65ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s - 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.1s, 25 PlacesBefore, 16 PlacesAfterwards, 20 TransitionsBefore, 11 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 30, unknown conditional: 0, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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:25:24,911 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:25:25,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...