/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 RABIN_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:38:46,964 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:47,010 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:38:47,041 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:47,042 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:47,042 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:47,043 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:47,043 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:47,043 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:47,043 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:47,044 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:47,044 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:47,044 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:47,044 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:47,045 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:47,045 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:47,045 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:47,045 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:47,046 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:47,046 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:47,046 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:47,049 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:47,049 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:47,049 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:47,049 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:47,050 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:47,050 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:47,050 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:47,050 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:47,050 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:47,051 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:47,051 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:47,051 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:47,052 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:47,052 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 -> RABIN_PETRI_NET [2023-10-12 17:38:47,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:47,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:47,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:47,255 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:47,257 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:47,258 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:38:47,258 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:38:47,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:47,280 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:47,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:47,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:47,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:47,290 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:38:47" (1/1) ... [2023-10-12 17:38:47,297 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:38:47" (1/1) ... [2023-10-12 17:38:47,301 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:47,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:47,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:47,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:47,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:47,310 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:38:47" (1/1) ... [2023-10-12 17:38:47,310 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:38:47" (1/1) ... [2023-10-12 17:38:47,312 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:38:47" (1/1) ... [2023-10-12 17:38:47,312 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:38:47" (1/1) ... [2023-10-12 17:38:47,314 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:38:47" (1/1) ... [2023-10-12 17:38:47,316 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:38:47" (1/1) ... [2023-10-12 17:38:47,317 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:38:47" (1/1) ... [2023-10-12 17:38:47,317 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:38:47" (1/1) ... [2023-10-12 17:38:47,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:47,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:47,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:47,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:47,320 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:38:47" (1/1) ... [2023-10-12 17:38:47,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:47,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:47,354 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:38:47,372 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:38:47,382 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:47,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:47,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:47,383 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:47,383 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:47,383 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:47,383 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:47,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:47,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:47,384 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:38:47,419 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:47,421 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:47,486 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:47,496 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:47,496 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:38:47,498 INFO L201 PluginConnector]: Adding new model counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:47 BoogieIcfgContainer [2023-10-12 17:38:47,498 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:47,498 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:47,499 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:47,501 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:47,502 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:47,502 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:38:47" (1/2) ... [2023-10-12 17:38:47,505 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69c2907f and model type counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:38:47, skipping insertion in model container [2023-10-12 17:38:47,505 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:47,505 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:38:47" (2/2) ... [2023-10-12 17:38:47,506 INFO L332 chiAutomizerObserver]: Analyzing ICFG counter-queue.wvr.bpl [2023-10-12 17:38:47,547 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:38:47,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 24 transitions, 64 flow [2023-10-12 17:38:47,581 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2023-10-12 17:38:47,581 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:38:47,609 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:38:47,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 24 transitions, 64 flow [2023-10-12 17:38:47,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 20 transitions, 52 flow [2023-10-12 17:38:47,615 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:38:47,629 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 52 flow [2023-10-12 17:38:47,631 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 52 flow [2023-10-12 17:38:47,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 52 flow [2023-10-12 17:38:47,635 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2023-10-12 17:38:47,635 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:38:47,636 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:38:47,636 INFO L119 LiptonReduction]: Number of co-enabled transitions 48 [2023-10-12 17:38:47,806 INFO L134 LiptonReduction]: Checked pairs total: 42 [2023-10-12 17:38:47,806 INFO L136 LiptonReduction]: Total number of compositions: 10 [2023-10-12 17:38:47,815 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:38:47,815 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:38:47,815 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:38:47,815 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:38:47,815 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:38:47,815 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:38:47,815 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:38:47,815 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:38:47,816 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:38:47,818 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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[][9], 2:2A:[60] L45-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2]][3:3A:[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][4]] [2023-10-12 17:38:47,820 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:47,820 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:47,820 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:47,820 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:47,822 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:38:47,822 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:38:47,823 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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[][9], 2:2A:[60] L45-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2]][3:3A:[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][4]] [2023-10-12 17:38:47,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:47,823 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:47,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:47,823 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:47,827 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:38:47,827 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:38:47,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:47,830 INFO L85 PathProgramCache]: Analyzing trace with hash 3346, now seen corresponding path program 1 times [2023-10-12 17:38:47,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:47,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506663355] [2023-10-12 17:38:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:47,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:47,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:47,903 INFO L85 PathProgramCache]: Analyzing trace with hash 100, now seen corresponding path program 1 times [2023-10-12 17:38:47,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:47,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294702820] [2023-10-12 17:38:47,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:47,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:47,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:47,952 INFO L85 PathProgramCache]: Analyzing trace with hash 103795, now seen corresponding path program 1 times [2023-10-12 17:38:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:47,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601674521] [2023-10-12 17:38:47,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:47,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:48,053 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:48,054 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:48,054 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:48,054 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:48,054 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:48,054 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:48,054 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:48,054 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:48,055 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-queue.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:38:48,055 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:48,055 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:48,065 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:38:48,074 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:38:48,078 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:38:48,158 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:48,160 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:48,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:48,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:48,223 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:38:48,224 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:38:48,226 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:38:48,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:48,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:48,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:48,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:48,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:48,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:48,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:48,258 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:38:48,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:48,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:48,259 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:38:48,260 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:38:48,262 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:38:48,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:48,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:48,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:48,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:48,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:48,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:48,281 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:48,286 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:38:48,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:48,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:48,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:38:48,302 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:38:48,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:38:48,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:48,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:48,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:48,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:48,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:48,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:48,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:48,348 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:38:48,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:48,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:48,350 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:38:48,353 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:38:48,354 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:38:48,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:48,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:48,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:48,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:48,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:48,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:48,389 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:48,405 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:38:48,405 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:38:48,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:48,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:48,410 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:38:48,411 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:38:48,458 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:48,478 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:48,479 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:48,479 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N1) = -1*i1 + 1*N1 Supporting invariants [] [2023-10-12 17:38:48,485 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:38:48,487 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:48,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:48,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:48,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:48,534 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:48,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:48,536 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:38:48,571 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:38:48,643 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:38:48,649 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:38:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2023-10-12 17:38:48,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:38:48,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:48,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:48,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:48,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:38:48,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:48,659 INFO L430 stractBuchiCegarLoop]: Abstraction has has 20 places, 44 transitions, 224 flow [2023-10-12 17:38:48,659 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:38:48,659 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 20 places, 44 transitions, 224 flow [2023-10-12 17:38:48,662 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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[][36], 2:2A:[60] L45-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][8], 4:3A:[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][15]][5:4A:[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][33]] [2023-10-12 17:38:48,662 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:48,663 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:38:48,663 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:48,663 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:48,663 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] 70#[L20-1, L46, L31-1]true [2023-10-12 17:38:48,664 INFO L750 eck$LassoCheckResult]: Loop: 70#[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] 70#[L20-1, L46, L31-1]true [2023-10-12 17:38:48,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 103789, now seen corresponding path program 1 times [2023-10-12 17:38:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:48,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488853370] [2023-10-12 17:38:48,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:48,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:48,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:48,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:48,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:48,692 INFO L85 PathProgramCache]: Analyzing trace with hash 103, now seen corresponding path program 1 times [2023-10-12 17:38:48,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:48,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012669639] [2023-10-12 17:38:48,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:48,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:48,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:48,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:48,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:48,708 INFO L85 PathProgramCache]: Analyzing trace with hash 3217531, now seen corresponding path program 1 times [2023-10-12 17:38:48,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:48,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653803116] [2023-10-12 17:38:48,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:48,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:48,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:48,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:48,800 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:48,801 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:48,801 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:48,801 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:48,801 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:48,801 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:48,801 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:48,801 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:48,801 INFO L133 ssoRankerPreferences]: Filename of dumped script: counter-queue.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:38:48,801 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:48,801 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:48,803 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:38:48,805 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:38:48,817 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:38:48,820 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:38:48,822 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:38:48,880 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:48,880 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:48,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:48,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:48,885 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:38:48,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:38:48,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:38:48,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:48,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:48,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:48,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:48,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:48,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:48,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:48,925 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:38:48,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:48,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:48,926 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:38:48,929 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:38:48,930 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:38:48,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:48,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:48,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:48,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:48,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:48,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:48,957 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:48,968 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:38:48,968 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:38:48,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:48,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:48,975 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:38:48,976 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:38:48,977 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:48,992 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:48,992 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:48,993 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2023-10-12 17:38:49,007 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:38:49,008 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:49,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:49,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:49,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:49,039 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:49,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:49,040 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:38:49,041 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:38:49,098 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:38:49,098 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:38:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2023-10-12 17:38:49,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:49,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:49,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:49,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:49,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:38:49,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:49,100 INFO L430 stractBuchiCegarLoop]: Abstraction has has 24 places, 176 transitions, 1248 flow [2023-10-12 17:38:49,100 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:38:49,100 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 176 transitions, 1248 flow [2023-10-12 17:38:49,105 INFO L124 PetriNetUnfolderBase]: 16/32 cut-off events. [2023-10-12 17:38:49,105 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:38:49,105 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:38:49,109 INFO L201 PluginConnector]: Adding new model counter-queue.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:38:49 BoogieIcfgContainer [2023-10-12 17:38:49,110 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:38:49,110 INFO L158 Benchmark]: Toolchain (without parser) took 1829.87ms. Allocated memory was 181.4MB in the beginning and 291.5MB in the end (delta: 110.1MB). Free memory was 132.0MB in the beginning and 202.6MB in the end (delta: -70.6MB). Peak memory consumption was 39.4MB. Max. memory is 8.0GB. [2023-10-12 17:38:49,110 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 181.4MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:38:49,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.06ms. Allocated memory is still 181.4MB. Free memory was 131.8MB in the beginning and 130.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:49,111 INFO L158 Benchmark]: Boogie Preprocessor took 14.37ms. Allocated memory is still 181.4MB. Free memory was 130.3MB in the beginning and 129.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:49,111 INFO L158 Benchmark]: RCFGBuilder took 178.68ms. Allocated memory is still 181.4MB. Free memory was 129.3MB in the beginning and 119.9MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:38:49,112 INFO L158 Benchmark]: BuchiAutomizer took 1611.11ms. Allocated memory was 181.4MB in the beginning and 291.5MB in the end (delta: 110.1MB). Free memory was 119.7MB in the beginning and 202.6MB in the end (delta: -82.9MB). Peak memory consumption was 26.9MB. Max. memory is 8.0GB. [2023-10-12 17:38:49,113 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.20ms. Allocated memory is still 181.4MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.06ms. Allocated memory is still 181.4MB. Free memory was 131.8MB in the beginning and 130.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.37ms. Allocated memory is still 181.4MB. Free memory was 130.3MB in the beginning and 129.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 178.68ms. Allocated memory is still 181.4MB. Free memory was 129.3MB in the beginning and 119.9MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1611.11ms. Allocated memory was 181.4MB in the beginning and 291.5MB in the end (delta: 110.1MB). Free memory was 119.7MB in the beginning and 202.6MB in the end (delta: -82.9MB). Peak memory consumption was 26.9MB. 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 + N2 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 60 mSDtfsCounter, 98 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital35 mio100 ax100 hnf100 lsp74 ukn92 mio100 lsp66 div100 bol100 ite100 ukn100 eq187 hnf89 smp100 dnf100 smp100 tf100 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 88ms 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.2s - 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.2s, 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:38:49,130 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:38:49,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:49,536 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...