/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/figure1-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:41:24,920 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:41:24,982 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:41:25,004 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:41:25,005 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:41:25,005 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:41:25,006 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:41:25,006 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:41:25,007 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:41:25,010 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:41:25,010 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:41:25,010 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:41:25,010 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:41:25,011 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:41:25,011 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:41:25,011 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:41:25,012 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:41:25,012 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:41:25,012 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:41:25,012 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:41:25,013 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:41:25,014 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:41:25,014 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:41:25,014 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:41:25,014 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:41:25,014 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:41:25,014 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:41:25,015 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:41:25,015 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:41:25,015 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:41:25,016 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:41:25,016 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:41:25,016 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:41:25,017 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:41:25,018 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:41:25,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:41:25,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:41:25,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:41:25,213 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:41:25,214 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:41:25,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/figure1-alt.wvr.bpl [2023-10-12 17:41:25,215 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/figure1-alt.wvr.bpl' [2023-10-12 17:41:25,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:41:25,231 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:41:25,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:41:25,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:41:25,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:41:25,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,249 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:41:25,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:41:25,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:41:25,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:41:25,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:41:25,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,259 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:41:25,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:41:25,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:41:25,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:41:25,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/1) ... [2023-10-12 17:41:25,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:25,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:25,285 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:41:25,293 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:41:25,316 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:41:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:41:25,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:41:25,316 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:41:25,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:41:25,317 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:41:25,317 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:41:25,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:41:25,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:41:25,318 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:41:25,352 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:41:25,354 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:41:25,427 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:41:25,439 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:41:25,439 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:41:25,441 INFO L201 PluginConnector]: Adding new model figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:41:25 BoogieIcfgContainer [2023-10-12 17:41:25,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:41:25,442 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:41:25,442 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:41:25,445 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:41:25,445 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:41:25,445 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:25" (1/2) ... [2023-10-12 17:41:25,446 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d64b83d and model type figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:41:25, skipping insertion in model container [2023-10-12 17:41:25,447 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:41:25,447 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:41:25" (2/2) ... [2023-10-12 17:41:25,451 INFO L332 chiAutomizerObserver]: Analyzing ICFG figure1-alt.wvr.bpl [2023-10-12 17:41:25,487 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:41:25,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 66 flow [2023-10-12 17:41:25,520 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2023-10-12 17:41:25,520 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:41:25,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 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/18 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2023-10-12 17:41:25,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 66 flow [2023-10-12 17:41:25,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2023-10-12 17:41:25,528 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:41:25,543 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 54 flow [2023-10-12 17:41:25,545 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 54 flow [2023-10-12 17:41:25,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 54 flow [2023-10-12 17:41:25,550 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2023-10-12 17:41:25,550 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:41:25,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 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/18 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2023-10-12 17:41:25,551 INFO L119 LiptonReduction]: Number of co-enabled transitions 48 [2023-10-12 17:41:25,743 INFO L134 LiptonReduction]: Checked pairs total: 43 [2023-10-12 17:41:25,743 INFO L136 LiptonReduction]: Total number of compositions: 11 [2023-10-12 17:41:25,752 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:41:25,752 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:41:25,752 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:41:25,752 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:41:25,752 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:41:25,752 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:41:25,752 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:41:25,753 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:41:25,753 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:41:25,755 ERROR L47 etriNetUnfolderRabin]: [1:1A:[80] $Ultimate##0-->L46: Formula: (and (= v_i2_24 0) (<= 0 v_N2_15) (= v_i1_18 0) (<= 0 v_N1_15) (= v_counter_36 0)) InVars {counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} OutVars{counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} AuxVars[] AssignedVars[][10], 2:2A:[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[71] L19-1-->L19-1: Formula: (and (= v_i1_12 (+ v_i1_13 1)) (< v_i1_13 v_N1_7) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_7} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_7} AuxVars[] AssignedVars[counter, i1][4]] [2023-10-12 17:41:25,757 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:25,757 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:41:25,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:25,757 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:25,759 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:41:25,759 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:41:25,760 ERROR L47 etriNetUnfolderRabin]: [1:1A:[80] $Ultimate##0-->L46: Formula: (and (= v_i2_24 0) (<= 0 v_N2_15) (= v_i1_18 0) (<= 0 v_N1_15) (= v_counter_36 0)) InVars {counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} OutVars{counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} AuxVars[] AssignedVars[][10], 2:2A:[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[71] L19-1-->L19-1: Formula: (and (= v_i1_12 (+ v_i1_13 1)) (< v_i1_13 v_N1_7) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_7} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_7} AuxVars[] AssignedVars[counter, i1][4]] [2023-10-12 17:41:25,760 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:25,760 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:41:25,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:25,760 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:25,764 INFO L748 eck$LassoCheckResult]: Stem: 32#[$Ultimate##0]true [80] $Ultimate##0-->L46: Formula: (and (= v_i2_24 0) (<= 0 v_N2_15) (= v_i1_18 0) (<= 0 v_N1_15) (= v_counter_36 0)) InVars {counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} OutVars{counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} AuxVars[] AssignedVars[] 34#[L46]true [64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 36#[L19-1, L46-1]true [2023-10-12 17:41:25,764 INFO L750 eck$LassoCheckResult]: Loop: 36#[L19-1, L46-1]true [71] L19-1-->L19-1: Formula: (and (= v_i1_12 (+ v_i1_13 1)) (< v_i1_13 v_N1_7) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_7} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_7} AuxVars[] AssignedVars[counter, i1] 36#[L19-1, L46-1]true [2023-10-12 17:41:25,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:25,767 INFO L85 PathProgramCache]: Analyzing trace with hash 3505, now seen corresponding path program 1 times [2023-10-12 17:41:25,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:25,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061583706] [2023-10-12 17:41:25,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:25,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:25,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:25,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:25,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:25,847 INFO L85 PathProgramCache]: Analyzing trace with hash 102, now seen corresponding path program 1 times [2023-10-12 17:41:25,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:25,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434844607] [2023-10-12 17:41:25,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:25,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:25,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:25,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:25,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:25,891 INFO L85 PathProgramCache]: Analyzing trace with hash 108726, now seen corresponding path program 1 times [2023-10-12 17:41:25,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:25,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297345096] [2023-10-12 17:41:25,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:25,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:25,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:25,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:25,958 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:25,959 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:25,959 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:25,959 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:25,959 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:25,959 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:25,959 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:25,959 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:25,959 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:41:25,959 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:25,959 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:25,969 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:41:25,976 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:41:26,006 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:26,007 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:26,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,011 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:41:26,012 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:41:26,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:26,014 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:26,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:26,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,030 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:41:26,031 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:41:26,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:26,034 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:26,058 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:41:26,058 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=0} Honda state: {counter=0} Generalized eigenvectors: [{counter=1}, {counter=-2}, {counter=2}] Lambdas: [1, 2, 1] Nus: [0, 1] [2023-10-12 17:41:26,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:41:26,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,064 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:41:26,075 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:41:26,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:26,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:26,105 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:41:26,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,108 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:41:26,110 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:41:26,111 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:26,112 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:26,223 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:26,226 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:41:26,226 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:26,226 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:26,226 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:26,226 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:26,227 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:26,227 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,227 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:26,227 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:26,227 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:41:26,227 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:26,227 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:26,228 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:41:26,232 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:41:26,255 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:26,258 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:26,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,260 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:41:26,262 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:41:26,264 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:41:26,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:26,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:26,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:26,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:26,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:26,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:26,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:26,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:26,293 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:41:26,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,294 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:41:26,294 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:41:26,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:41:26,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:26,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:26,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:26,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:26,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:26,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:26,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:26,317 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:26,319 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:26,319 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:41:26,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,321 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:41:26,322 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:41:26,365 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:26,365 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:26,366 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:26,366 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, N1) = -1*i1 + 1*N1 Supporting invariants [] [2023-10-12 17:41:26,370 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:41:26,373 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:26,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:26,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:26,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:26,412 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:26,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:26,412 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:41:26,432 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:41:26,497 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:41:26,501 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:41:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2023-10-12 17:41:26,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:41:26,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:26,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:41:26,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:26,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:41:26,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:26,506 INFO L430 stractBuchiCegarLoop]: Abstraction has has 20 places, 44 transitions, 224 flow [2023-10-12 17:41:26,506 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:41:26,506 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 20 places, 44 transitions, 224 flow [2023-10-12 17:41:26,507 ERROR L47 etriNetUnfolderRabin]: [1:1A:[80] $Ultimate##0-->L46: Formula: (and (= v_i2_24 0) (<= 0 v_N2_15) (= v_i1_18 0) (<= 0 v_N1_15) (= v_counter_36 0)) InVars {counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} OutVars{counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} AuxVars[] AssignedVars[][40], 2:2A:[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][12], 4:3A:[67] L46-1-->L30-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][2]][5:4A:[75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2][27]] [2023-10-12 17:41:26,507 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:26,507 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:41:26,507 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:26,508 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:26,508 INFO L748 eck$LassoCheckResult]: Stem: 32#[$Ultimate##0]true [80] $Ultimate##0-->L46: Formula: (and (= v_i2_24 0) (<= 0 v_N2_15) (= v_i1_18 0) (<= 0 v_N1_15) (= v_counter_36 0)) InVars {counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} OutVars{counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} AuxVars[] AssignedVars[] 34#[L46]true [64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 36#[L19-1, L46-1]true [67] L46-1-->L30-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] 71#[L19-1, L47, L30-1]true [2023-10-12 17:41:26,508 INFO L750 eck$LassoCheckResult]: Loop: 71#[L19-1, L47, L30-1]true [75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2] 71#[L19-1, L47, L30-1]true [2023-10-12 17:41:26,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash 108722, now seen corresponding path program 1 times [2023-10-12 17:41:26,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:26,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412289741] [2023-10-12 17:41:26,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:26,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:26,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash 106, now seen corresponding path program 1 times [2023-10-12 17:41:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:26,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386838565] [2023-10-12 17:41:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:26,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,522 INFO L85 PathProgramCache]: Analyzing trace with hash 3370457, now seen corresponding path program 1 times [2023-10-12 17:41:26,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:26,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236481646] [2023-10-12 17:41:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:26,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:26,554 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:41:26,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:41:26,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236481646] [2023-10-12 17:41:26,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236481646] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:41:26,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:41:26,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:41:26,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554703163] [2023-10-12 17:41:26,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:41:26,575 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:26,575 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:26,575 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:26,575 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:26,575 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:26,575 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,575 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:26,575 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:26,576 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:41:26,576 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:26,576 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:26,576 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:41:26,580 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:41:26,601 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:26,601 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:26,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,602 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:26,604 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:41:26,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:26,606 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:26,632 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:41:26,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,634 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:26,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:41:26,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:26,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:26,665 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:26,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:26,671 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:26,671 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:26,671 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:26,671 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:26,671 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:26,671 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,671 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:26,671 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:26,671 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_BEv2_Iteration2_Loop [2023-10-12 17:41:26,671 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:26,672 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:26,672 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:41:26,677 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:41:26,709 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:26,709 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:26,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,710 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:26,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:41:26,714 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:41:26,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:26,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:26,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:26,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:26,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:26,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:26,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:26,729 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:26,730 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:41:26,731 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:41:26,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:26,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:26,733 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:26,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:41:26,736 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:26,736 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:26,736 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:26,736 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:41:26,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:26,750 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:26,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:26,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:26,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:26,782 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:26,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:26,783 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:41:26,784 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:41:26,850 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:41:26,851 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:41:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2023-10-12 17:41:26,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:41:26,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:26,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:41:26,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:26,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:41:26,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:26,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:41:26,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:41:26,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:41:26,856 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 25 places, 220 transitions, 1560 flow. Second operand has 3 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:41:26,856 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:41:26,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:41:26,895 INFO L124 PetriNetUnfolderBase]: 28/62 cut-off events. [2023-10-12 17:41:26,895 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-10-12 17:41:26,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 62 events. 28/62 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 149 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 164. Up to 50 conditions per place. [2023-10-12 17:41:26,899 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 39 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2023-10-12 17:41:26,899 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 24 places, 43 transitions, 383 flow [2023-10-12 17:41:26,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:41:26,901 INFO L430 stractBuchiCegarLoop]: Abstraction has has 24 places, 43 transitions, 383 flow [2023-10-12 17:41:26,901 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:41:26,901 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 43 transitions, 383 flow [2023-10-12 17:41:26,911 ERROR L47 etriNetUnfolderRabin]: [1:1A:[80] $Ultimate##0-->L46: Formula: (and (= v_i2_24 0) (<= 0 v_N2_15) (= v_i1_18 0) (<= 0 v_N1_15) (= v_counter_36 0)) InVars {counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} OutVars{counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} AuxVars[] AssignedVars[][0], 2:2A:[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[67] L46-1-->L30-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][2], 8:4A:[71] L19-1-->L19-1: Formula: (and (= v_i1_12 (+ v_i1_13 1)) (< v_i1_13 v_N1_7) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_7} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_7} AuxVars[] AssignedVars[counter, i1][6], 22:5A:[70] L19-1-->thread1EXIT: Formula: (<= v_N1_5 v_i1_10) InVars {i1=v_i1_10, N1=v_N1_5} OutVars{i1=v_i1_10, N1=v_N1_5} AuxVars[] AssignedVars[][15]][24:6A:[75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2][28]] [2023-10-12 17:41:26,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:26,912 INFO L124 PetriNetUnfolderBase]: 9/23 cut-off events. [2023-10-12 17:41:26,912 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:41:26,912 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:26,914 INFO L748 eck$LassoCheckResult]: Stem: 32#[$Ultimate##0]true [80] $Ultimate##0-->L46: Formula: (and (= v_i2_24 0) (<= 0 v_N2_15) (= v_i1_18 0) (<= 0 v_N1_15) (= v_counter_36 0)) InVars {counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} OutVars{counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} AuxVars[] AssignedVars[] 34#[L46]true [64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 36#[L19-1, L46-1]true [67] L46-1-->L30-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] 71#[L19-1, L47, L30-1]true [71] L19-1-->L19-1: Formula: (and (= v_i1_12 (+ v_i1_13 1)) (< v_i1_13 v_N1_7) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_7} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_7} AuxVars[] AssignedVars[counter, i1] 71#[L19-1, L47, L30-1]true [70] L19-1-->thread1EXIT: Formula: (<= v_N1_5 v_i1_10) InVars {i1=v_i1_10, N1=v_N1_5} OutVars{i1=v_i1_10, N1=v_N1_5} AuxVars[] AssignedVars[] 108#[L47, L30-1, thread1EXIT]true [2023-10-12 17:41:26,914 INFO L750 eck$LassoCheckResult]: Loop: 108#[L47, L30-1, thread1EXIT]true [75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2] 108#[L47, L30-1, thread1EXIT]true [2023-10-12 17:41:26,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,914 INFO L85 PathProgramCache]: Analyzing trace with hash 104484113, now seen corresponding path program 1 times [2023-10-12 17:41:26,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:26,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831537161] [2023-10-12 17:41:26,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:26,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:26,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,943 INFO L85 PathProgramCache]: Analyzing trace with hash 106, now seen corresponding path program 2 times [2023-10-12 17:41:26,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:26,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24667803] [2023-10-12 17:41:26,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:26,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:26,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1055959718, now seen corresponding path program 1 times [2023-10-12 17:41:26,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:26,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053914618] [2023-10-12 17:41:26,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:26,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:26,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:26,988 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:41:27,008 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:27,008 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:27,008 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:27,008 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:27,008 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:27,008 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,008 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:27,008 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:27,008 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:41:27,009 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:27,009 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:27,010 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:27,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,014 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:41:27,038 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:27,038 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:27,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,040 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:41:27,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:27,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:27,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,074 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:41:27,077 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:27,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:27,090 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:27,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,095 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:27,095 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:27,095 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:27,095 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:27,095 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:27,095 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,095 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:27,095 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:27,095 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_BEv2_Iteration3_Loop [2023-10-12 17:41:27,095 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:27,096 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:27,096 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:41:27,105 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:41:27,134 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:27,135 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:27,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,137 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:41:27,141 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:41:27,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:27,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:27,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:27,170 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:27,173 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:27,173 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:27,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,174 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:41:27,177 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:27,177 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:27,177 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:27,177 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:41:27,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,183 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:27,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:27,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:27,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:27,210 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:27,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:41:27,211 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:41:27,262 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:41:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2023-10-12 17:41:27,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:41:27,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:27,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:41:27,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:27,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:41:27,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:27,266 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 215 transitions, 2345 flow [2023-10-12 17:41:27,266 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:41:27,266 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 215 transitions, 2345 flow [2023-10-12 17:41:27,273 ERROR L47 etriNetUnfolderRabin]: [1:1A:[80] $Ultimate##0-->L46: Formula: (and (= v_i2_24 0) (<= 0 v_N2_15) (= v_i1_18 0) (<= 0 v_N1_15) (= v_counter_36 0)) InVars {counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} OutVars{counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} AuxVars[] AssignedVars[][2], 2:2A:[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][7], 3:3A:[67] L46-1-->L30-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][12], 8:4A:[71] L19-1-->L19-1: Formula: (and (= v_i1_12 (+ v_i1_13 1)) (< v_i1_13 v_N1_7) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_7} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_7} AuxVars[] AssignedVars[counter, i1][32], 23:5A:[75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2][82]][27:6A:[75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2][142]] [2023-10-12 17:41:27,273 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:27,273 INFO L124 PetriNetUnfolderBase]: 11/26 cut-off events. [2023-10-12 17:41:27,273 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:41:27,273 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:27,273 INFO L748 eck$LassoCheckResult]: Stem: 32#[$Ultimate##0]true [80] $Ultimate##0-->L46: Formula: (and (= v_i2_24 0) (<= 0 v_N2_15) (= v_i1_18 0) (<= 0 v_N1_15) (= v_counter_36 0)) InVars {counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} OutVars{counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} AuxVars[] AssignedVars[] 34#[L46]true [64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 36#[L19-1, L46-1]true [67] L46-1-->L30-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] 71#[L19-1, L47, L30-1]true [71] L19-1-->L19-1: Formula: (and (= v_i1_12 (+ v_i1_13 1)) (< v_i1_13 v_N1_7) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_7} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_7} AuxVars[] AssignedVars[counter, i1] 71#[L19-1, L47, L30-1]true [75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2] 71#[L19-1, L47, L30-1]true [2023-10-12 17:41:27,274 INFO L750 eck$LassoCheckResult]: Loop: 71#[L19-1, L47, L30-1]true [75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2] 71#[L19-1, L47, L30-1]true [2023-10-12 17:41:27,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,274 INFO L85 PathProgramCache]: Analyzing trace with hash 104484118, now seen corresponding path program 1 times [2023-10-12 17:41:27,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:27,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302016497] [2023-10-12 17:41:27,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:27,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:27,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,303 INFO L85 PathProgramCache]: Analyzing trace with hash 106, now seen corresponding path program 3 times [2023-10-12 17:41:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:27,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45548318] [2023-10-12 17:41:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:27,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1055959563, now seen corresponding path program 2 times [2023-10-12 17:41:27,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:27,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862297011] [2023-10-12 17:41:27,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:27,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:27,334 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:41:27,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:41:27,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862297011] [2023-10-12 17:41:27,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862297011] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:41:27,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:41:27,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:41:27,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036963350] [2023-10-12 17:41:27,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:41:27,351 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:27,351 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:27,351 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:27,352 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:27,352 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:27,352 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,352 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:27,352 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:27,352 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:41:27,352 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:27,352 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:27,352 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:41:27,356 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:41:27,376 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:27,376 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:27,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,377 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:27,391 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:27,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:41:27,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,418 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:41:27,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:27,422 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:27,444 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:27,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,449 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:27,449 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:27,449 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:27,449 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:27,449 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:27,449 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,449 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:27,449 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:27,449 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_BEv2_Iteration4_Loop [2023-10-12 17:41:27,449 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:27,449 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:27,450 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:41:27,456 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:41:27,488 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:27,489 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:27,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,490 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:41:27,494 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:41:27,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:27,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:27,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:27,517 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:27,518 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:41:27,518 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:41:27,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,521 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:41:27,526 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:27,526 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:27,526 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:27,526 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(counter) = 1*counter Supporting invariants [] [2023-10-12 17:41:27,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,529 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:27,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:27,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:27,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:27,558 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:27,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:27,559 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:41:27,559 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:41:27,602 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:41:27,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2023-10-12 17:41:27,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:41:27,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:27,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:41:27,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:27,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 140 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:41:27,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:27,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:41:27,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:41:27,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:41:27,604 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 34 places, 1075 transitions, 13875 flow. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:27,604 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:41:27,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:41:27,683 INFO L124 PetriNetUnfolderBase]: 88/221 cut-off events. [2023-10-12 17:41:27,684 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-10-12 17:41:27,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1625 conditions, 221 events. 88/221 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1031 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 873. Up to 205 conditions per place. [2023-10-12 17:41:27,686 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 162 selfloop transitions, 26 changer transitions 0/188 dead transitions. [2023-10-12 17:41:27,686 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 34 places, 188 transitions, 2782 flow [2023-10-12 17:41:27,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:41:27,687 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 188 transitions, 2782 flow [2023-10-12 17:41:27,687 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:41:27,687 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 188 transitions, 2782 flow [2023-10-12 17:41:27,705 ERROR L47 etriNetUnfolderRabin]: [1:1A:[80] $Ultimate##0-->L46: Formula: (and (= v_i2_24 0) (<= 0 v_N2_15) (= v_i1_18 0) (<= 0 v_N1_15) (= v_counter_36 0)) InVars {counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} OutVars{counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} AuxVars[] AssignedVars[][0], 2:2A:[64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 3:3A:[71] L19-1-->L19-1: Formula: (and (= v_i1_12 (+ v_i1_13 1)) (< v_i1_13 v_N1_7) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_7} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_7} AuxVars[] AssignedVars[counter, i1][2], 7:4A:[71] L19-1-->L19-1: Formula: (and (= v_i1_12 (+ v_i1_13 1)) (< v_i1_13 v_N1_7) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_7} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_7} AuxVars[] AssignedVars[counter, i1][6], 19:5A:[67] L46-1-->L30-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], 51:6A:[75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2][36], 96:7A:[71] L19-1-->L19-1: Formula: (and (= v_i1_12 (+ v_i1_13 1)) (< v_i1_13 v_N1_7) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_7} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_7} AuxVars[] AssignedVars[counter, i1][73], 156:8A:[75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2][118]][160:9A:[75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2][157]] [2023-10-12 17:41:27,705 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:27,706 INFO L124 PetriNetUnfolderBase]: 72/159 cut-off events. [2023-10-12 17:41:27,706 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-10-12 17:41:27,706 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:27,706 INFO L748 eck$LassoCheckResult]: Stem: 32#[$Ultimate##0]true [80] $Ultimate##0-->L46: Formula: (and (= v_i2_24 0) (<= 0 v_N2_15) (= v_i1_18 0) (<= 0 v_N1_15) (= v_counter_36 0)) InVars {counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} OutVars{counter=v_counter_36, i1=v_i1_18, i2=v_i2_24, N2=v_N2_15, N1=v_N1_15} AuxVars[] AssignedVars[] 34#[L46]true [64] L46-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 36#[L19-1, L46-1]true [71] L19-1-->L19-1: Formula: (and (= v_i1_12 (+ v_i1_13 1)) (< v_i1_13 v_N1_7) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_7} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_7} AuxVars[] AssignedVars[counter, i1] 36#[L19-1, L46-1]true [71] L19-1-->L19-1: Formula: (and (= v_i1_12 (+ v_i1_13 1)) (< v_i1_13 v_N1_7) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_7} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_7} AuxVars[] AssignedVars[counter, i1] 36#[L19-1, L46-1]true [67] L46-1-->L30-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] 71#[L19-1, L47, L30-1]true [75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2] 71#[L19-1, L47, L30-1]true [71] L19-1-->L19-1: Formula: (and (= v_i1_12 (+ v_i1_13 1)) (< v_i1_13 v_N1_7) (= v_counter_20 (+ v_counter_21 1))) InVars {counter=v_counter_21, i1=v_i1_13, N1=v_N1_7} OutVars{counter=v_counter_20, i1=v_i1_12, N1=v_N1_7} AuxVars[] AssignedVars[counter, i1] 71#[L19-1, L47, L30-1]true [75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2] 71#[L19-1, L47, L30-1]true [2023-10-12 17:41:27,706 INFO L750 eck$LassoCheckResult]: Loop: 71#[L19-1, L47, L30-1]true [75] L30-1-->L30-1: Formula: (and (= (+ v_i2_17 1) v_i2_16) (< 0 v_counter_25) (= v_counter_25 (+ v_counter_24 1)) (< v_i2_17 v_N2_9)) InVars {counter=v_counter_25, i2=v_i2_17, N2=v_N2_9} OutVars{counter=v_counter_24, i2=v_i2_16, N2=v_N2_9} AuxVars[] AssignedVars[counter, i2] 71#[L19-1, L47, L30-1]true [2023-10-12 17:41:27,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1050577635, now seen corresponding path program 3 times [2023-10-12 17:41:27,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:27,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214018547] [2023-10-12 17:41:27,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:27,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:27,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,718 INFO L85 PathProgramCache]: Analyzing trace with hash 106, now seen corresponding path program 4 times [2023-10-12 17:41:27,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:27,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940007143] [2023-10-12 17:41:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:27,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:27,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:27,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1791831758, now seen corresponding path program 4 times [2023-10-12 17:41:27,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:27,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300058771] [2023-10-12 17:41:27,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:27,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:27,749 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:27,749 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:27,749 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:27,749 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:27,749 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:41:27,749 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,749 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:27,749 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:27,749 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_BEv2_Iteration5_Loop [2023-10-12 17:41:27,749 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:27,749 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:27,750 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:41:27,753 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:41:27,777 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:27,777 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:41:27,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,779 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:41:27,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:41:27,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:27,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,803 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:41:27,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:41:27,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:41:27,907 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:41:27,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:27,912 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:27,912 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:27,912 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:27,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:27,912 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:27,912 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,912 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:27,912 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:27,912 INFO L133 ssoRankerPreferences]: Filename of dumped script: figure1-alt.wvr.bpl_BEv2_Iteration5_Loop [2023-10-12 17:41:27,912 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:27,912 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:27,913 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:41:27,925 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:41:27,947 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:27,947 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:27,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,948 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,953 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:41:27,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:27,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:27,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:27,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:27,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:27,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:27,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:27,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:41:27,977 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:27,989 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:27,989 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:41:27,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:27,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:27,992 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:27,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:41:27,998 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:27,998 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:41:27,998 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:27,998 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N2, i2) = 1*N2 - 1*i2 Supporting invariants [] [2023-10-12 17:41:28,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:28,004 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:28,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:28,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:28,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:28,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:28,047 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:28,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:28,047 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:41:28,047 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:41:28,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-10-12 17:41:28,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:28,092 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:41:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2023-10-12 17:41:28,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:41:28,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:28,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:41:28,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:28,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:41:28,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:28,094 INFO L430 stractBuchiCegarLoop]: Abstraction has has 38 places, 752 transitions, 12632 flow [2023-10-12 17:41:28,094 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:41:28,094 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 38 places, 752 transitions, 12632 flow [2023-10-12 17:41:28,130 INFO L124 PetriNetUnfolderBase]: 91/226 cut-off events. [2023-10-12 17:41:28,130 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2023-10-12 17:41:28,130 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:41:28,134 INFO L201 PluginConnector]: Adding new model figure1-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:41:28 BoogieIcfgContainer [2023-10-12 17:41:28,134 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:41:28,134 INFO L158 Benchmark]: Toolchain (without parser) took 2903.66ms. Allocated memory was 188.7MB in the beginning and 263.2MB in the end (delta: 74.4MB). Free memory was 136.2MB in the beginning and 205.0MB in the end (delta: -68.8MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2023-10-12 17:41:28,135 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 188.7MB. Free memory was 137.4MB in the beginning and 137.2MB in the end (delta: 164.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:41:28,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.44ms. Allocated memory is still 188.7MB. Free memory was 136.2MB in the beginning and 134.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:41:28,135 INFO L158 Benchmark]: Boogie Preprocessor took 11.70ms. Allocated memory is still 188.7MB. Free memory was 134.6MB in the beginning and 133.7MB in the end (delta: 931.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:41:28,135 INFO L158 Benchmark]: RCFGBuilder took 178.26ms. Allocated memory is still 188.7MB. Free memory was 133.5MB in the beginning and 123.9MB in the end (delta: 9.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-10-12 17:41:28,136 INFO L158 Benchmark]: BuchiAutomizer took 2692.17ms. Allocated memory was 188.7MB in the beginning and 263.2MB in the end (delta: 74.4MB). Free memory was 123.8MB in the beginning and 205.0MB in the end (delta: -81.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:41:28,136 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.22ms. Allocated memory is still 188.7MB. Free memory was 137.4MB in the beginning and 137.2MB in the end (delta: 164.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.44ms. Allocated memory is still 188.7MB. Free memory was 136.2MB in the beginning and 134.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.70ms. Allocated memory is still 188.7MB. Free memory was 134.6MB in the beginning and 133.7MB in the end (delta: 931.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 178.26ms. Allocated memory is still 188.7MB. Free memory was 133.5MB in the beginning and 123.9MB in the end (delta: 9.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2692.17ms. Allocated memory was 188.7MB in the beginning and 263.2MB in the end (delta: 74.4MB). Free memory was 123.8MB in the beginning and 205.0MB in the end (delta: -81.2MB). There was no memory consumed. 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 7 terminating modules (2 trivial, 5 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 counter and consists of 4 locations. One deterministic module has affine ranking function counter and consists of 4 locations. One deterministic module has affine ranking function counter and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 6 iterations. TraceHistogramMax:0. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. 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 [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 337 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 298 IncrementalHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 164 mSDtfsCounter, 298 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp57 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s 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, 26 PlacesBefore, 16 PlacesAfterwards, 21 TransitionsBefore, 11 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 43 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 43, independent conditional: 0, independent unconditional: 43, 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: 28, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 28, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 43, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , 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:41:28,146 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...