/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-more/nonblocking-counter-alt2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:40:37,943 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:40:38,002 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:40:38,026 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:40:38,026 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:40:38,027 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:40:38,028 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:40:38,029 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:40:38,029 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:40:38,032 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:40:38,032 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:40:38,032 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:40:38,032 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:40:38,033 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:40:38,034 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:40:38,034 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:40:38,034 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:40:38,034 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:40:38,034 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:40:38,035 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:40:38,035 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:40:38,035 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:40:38,035 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:40:38,036 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:40:38,036 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:40:38,036 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:40:38,036 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:40:38,036 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:40:38,036 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:40:38,037 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:40:38,037 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:40:38,038 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:40:38,038 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:40:38,039 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:40:38,039 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:40:38,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:40:38,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:40:38,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:40:38,241 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:40:38,241 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:40:38,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/nonblocking-counter-alt2.wvr.bpl [2023-10-12 17:40:38,242 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/nonblocking-counter-alt2.wvr.bpl' [2023-10-12 17:40:38,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:40:38,275 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:40:38,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:38,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:40:38,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:40:38,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:38" (1/1) ... [2023-10-12 17:40:38,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:38" (1/1) ... [2023-10-12 17:40:38,297 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:40:38,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:38,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:40:38,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:40:38,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:40:38,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:38" (1/1) ... [2023-10-12 17:40:38,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:38" (1/1) ... [2023-10-12 17:40:38,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:38" (1/1) ... [2023-10-12 17:40:38,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:38" (1/1) ... [2023-10-12 17:40:38,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:38" (1/1) ... [2023-10-12 17:40:38,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:38" (1/1) ... [2023-10-12 17:40:38,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:38" (1/1) ... [2023-10-12 17:40:38,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:38" (1/1) ... [2023-10-12 17:40:38,324 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:40:38,325 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:40:38,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:40:38,325 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:40:38,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:38" (1/1) ... [2023-10-12 17:40:38,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:38,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:38,351 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:40:38,373 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:40:38,402 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:40:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:40:38,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:40:38,407 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:40:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:40:38,408 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:40:38,408 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:40:38,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:40:38,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:40:38,409 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:40:38,445 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:40:38,446 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:40:38,546 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:40:38,556 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:40:38,556 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:40:38,558 INFO L201 PluginConnector]: Adding new model nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:38 BoogieIcfgContainer [2023-10-12 17:40:38,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:40:38,559 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:40:38,559 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:40:38,569 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:40:38,569 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:38,569 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:38" (1/2) ... [2023-10-12 17:40:38,570 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73b0a3b5 and model type nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:40:38, skipping insertion in model container [2023-10-12 17:40:38,571 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:38,571 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:38" (2/2) ... [2023-10-12 17:40:38,572 INFO L332 chiAutomizerObserver]: Analyzing ICFG nonblocking-counter-alt2.wvr.bpl [2023-10-12 17:40:38,614 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:40:38,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 66 flow [2023-10-12 17:40:38,644 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2023-10-12 17:40:38,645 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:40:38,647 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 4. Compared 17 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:40:38,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 66 flow [2023-10-12 17:40:38,650 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2023-10-12 17:40:38,652 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:40:38,660 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 54 flow [2023-10-12 17:40:38,662 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 21 transitions, 54 flow [2023-10-12 17:40:38,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 54 flow [2023-10-12 17:40:38,666 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2023-10-12 17:40:38,666 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:40:38,667 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 4. Compared 17 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:40:38,667 INFO L119 LiptonReduction]: Number of co-enabled transitions 48 [2023-10-12 17:40:38,815 INFO L134 LiptonReduction]: Checked pairs total: 48 [2023-10-12 17:40:38,816 INFO L136 LiptonReduction]: Total number of compositions: 11 [2023-10-12 17:40:38,824 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:40:38,824 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:40:38,825 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:40:38,825 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:40:38,825 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:40:38,825 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:40:38,825 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:40:38,825 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:40:38,825 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:40:38,827 ERROR L47 etriNetUnfolderRabin]: [1:1A:[78] $Ultimate##0-->L46: Formula: (and (= v_j2_20 0) (= v_counter_32 0) (= v_M1_10 v_M2_11) (= v_j1_18 0) (< 0 v_M2_11)) InVars {counter=v_counter_32, j2=v_j2_20, j1=v_j1_18, M1=v_M1_10, M2=v_M2_11} OutVars{counter=v_counter_32, j2=v_j2_20, j1=v_j1_18, M1=v_M1_10, M2=v_M2_11} AuxVars[] AssignedVars[][10], 2:2A:[62] L46-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[73] L20-1-->L20-1: Formula: (and (= v_counter_20 (+ v_counter_21 v_C_7)) (< v_j1_13 v_M1_8) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_21, j1=v_j1_13, M1=v_M1_8, C=v_C_7} OutVars{counter=v_counter_20, j1=v_j1_12, M1=v_M1_8, C=v_C_7} AuxVars[] AssignedVars[counter, j1][4]] [2023-10-12 17:40:38,829 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:38,829 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:38,829 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:38,829 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:38,831 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:40:38,831 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 16 places, 11 transitions, 34 flow [2023-10-12 17:40:38,832 ERROR L47 etriNetUnfolderRabin]: [1:1A:[78] $Ultimate##0-->L46: Formula: (and (= v_j2_20 0) (= v_counter_32 0) (= v_M1_10 v_M2_11) (= v_j1_18 0) (< 0 v_M2_11)) InVars {counter=v_counter_32, j2=v_j2_20, j1=v_j1_18, M1=v_M1_10, M2=v_M2_11} OutVars{counter=v_counter_32, j2=v_j2_20, j1=v_j1_18, M1=v_M1_10, M2=v_M2_11} AuxVars[] AssignedVars[][10], 2:2A:[62] L46-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[73] L20-1-->L20-1: Formula: (and (= v_counter_20 (+ v_counter_21 v_C_7)) (< v_j1_13 v_M1_8) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_21, j1=v_j1_13, M1=v_M1_8, C=v_C_7} OutVars{counter=v_counter_20, j1=v_j1_12, M1=v_M1_8, C=v_C_7} AuxVars[] AssignedVars[counter, j1][4]] [2023-10-12 17:40:38,832 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:38,832 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:38,832 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:38,832 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:38,835 INFO L748 eck$LassoCheckResult]: Stem: 32#[$Ultimate##0]true [78] $Ultimate##0-->L46: Formula: (and (= v_j2_20 0) (= v_counter_32 0) (= v_M1_10 v_M2_11) (= v_j1_18 0) (< 0 v_M2_11)) InVars {counter=v_counter_32, j2=v_j2_20, j1=v_j1_18, M1=v_M1_10, M2=v_M2_11} OutVars{counter=v_counter_32, j2=v_j2_20, j1=v_j1_18, M1=v_M1_10, M2=v_M2_11} AuxVars[] AssignedVars[] 34#[L46]true [62] L46-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 36#[L46-1, L20-1]true [2023-10-12 17:40:38,835 INFO L750 eck$LassoCheckResult]: Loop: 36#[L46-1, L20-1]true [73] L20-1-->L20-1: Formula: (and (= v_counter_20 (+ v_counter_21 v_C_7)) (< v_j1_13 v_M1_8) (= (+ v_j1_13 1) v_j1_12)) InVars {counter=v_counter_21, j1=v_j1_13, M1=v_M1_8, C=v_C_7} OutVars{counter=v_counter_20, j1=v_j1_12, M1=v_M1_8, C=v_C_7} AuxVars[] AssignedVars[counter, j1] 36#[L46-1, L20-1]true [2023-10-12 17:40:38,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:38,838 INFO L85 PathProgramCache]: Analyzing trace with hash 3441, now seen corresponding path program 1 times [2023-10-12 17:40:38,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:38,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932294124] [2023-10-12 17:40:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:38,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:38,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:38,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:38,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash 104, now seen corresponding path program 1 times [2023-10-12 17:40:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:38,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464644201] [2023-10-12 17:40:38,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:38,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:38,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:38,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:38,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash 106744, now seen corresponding path program 1 times [2023-10-12 17:40:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:38,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481645530] [2023-10-12 17:40:38,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:38,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:38,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:38,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:38,990 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:38,991 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:38,991 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:38,991 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:38,991 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:40:38,991 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:38,991 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:38,991 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:38,991 INFO L133 ssoRankerPreferences]: Filename of dumped script: nonblocking-counter-alt2.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:40:38,991 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:38,991 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:39,000 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:40:39,009 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:40:39,044 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:39,044 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:40:39,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:39,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:39,077 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:40:39,079 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:40:39,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:40:39,082 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:39,093 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:40:39,093 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=0, C=0} Honda state: {counter=0, C=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:40:39,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:40:39,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:39,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:39,104 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:40:39,108 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:40:39,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:40:39,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:39,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:39,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:39,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:39,123 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:40:39,125 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:40:39,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:40:39,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:40:39,226 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:40:39,233 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:40:39,233 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:39,233 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:39,233 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:39,233 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:39,233 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:39,233 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:39,234 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:39,234 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:39,234 INFO L133 ssoRankerPreferences]: Filename of dumped script: nonblocking-counter-alt2.wvr.bpl_BEv2_Iteration1_Loop [2023-10-12 17:40:39,234 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:39,234 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:39,235 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:40:39,238 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:39,260 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:39,263 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:39,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:39,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:39,285 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:40:39,306 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:40:39,323 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:40:39,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:39,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:40:39,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:39,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:39,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:39,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:40:39,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:40:39,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:39,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:39,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:39,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:39,353 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:40:39,355 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:40:39,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:39,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:40:39,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:39,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:39,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:39,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:40:39,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:40:39,366 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:40:39,374 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:39,378 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:40:39,379 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:40:39,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:39,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:39,381 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:40:39,394 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:40:39,395 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:39,396 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:40:39,396 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:39,397 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j1, M1) = -1*j1 + 1*M1 Supporting invariants [] [2023-10-12 17:40:39,400 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:40:39,403 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:39,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:39,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:39,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:39,443 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:39,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:39,445 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:40:39,464 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:40:39,558 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:40:39,563 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:40:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2023-10-12 17:40:39,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:40:39,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:39,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:39,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:39,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 144 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:40:39,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:39,568 INFO L430 stractBuchiCegarLoop]: Abstraction has has 20 places, 44 transitions, 224 flow [2023-10-12 17:40:39,568 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:40:39,568 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 20 places, 44 transitions, 224 flow [2023-10-12 17:40:39,570 ERROR L47 etriNetUnfolderRabin]: [1:1A:[78] $Ultimate##0-->L46: Formula: (and (= v_j2_20 0) (= v_counter_32 0) (= v_M1_10 v_M2_11) (= v_j1_18 0) (< 0 v_M2_11)) InVars {counter=v_counter_32, j2=v_j2_20, j1=v_j1_18, M1=v_M1_10, M2=v_M2_11} OutVars{counter=v_counter_32, j2=v_j2_20, j1=v_j1_18, M1=v_M1_10, M2=v_M2_11} AuxVars[] AssignedVars[][40], 2:2A:[62] L46-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][12], 4:3A:[65] L46-1-->L31-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][2]][5:4A:[75] L31-1-->L31-1: Formula: (let ((.cse0 (< 0 v_counter_25))) (and (= (ite .cse0 (+ v_j2_15 1) v_j2_15) v_j2_14) (< v_j2_15 v_M2_9) (= v_counter_24 (ite .cse0 (+ v_counter_25 (* (- 1) v_C_9)) v_counter_25)))) InVars {counter=v_counter_25, j2=v_j2_15, M2=v_M2_9, C=v_C_9} OutVars{counter=v_counter_24, j2=v_j2_14, M2=v_M2_9, C=v_C_9} AuxVars[] AssignedVars[counter, j2][27]] [2023-10-12 17:40:39,571 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:39,571 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:40:39,571 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:39,571 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:39,572 INFO L748 eck$LassoCheckResult]: Stem: 32#[$Ultimate##0]true [78] $Ultimate##0-->L46: Formula: (and (= v_j2_20 0) (= v_counter_32 0) (= v_M1_10 v_M2_11) (= v_j1_18 0) (< 0 v_M2_11)) InVars {counter=v_counter_32, j2=v_j2_20, j1=v_j1_18, M1=v_M1_10, M2=v_M2_11} OutVars{counter=v_counter_32, j2=v_j2_20, j1=v_j1_18, M1=v_M1_10, M2=v_M2_11} AuxVars[] AssignedVars[] 34#[L46]true [62] L46-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 36#[L46-1, L20-1]true [65] L46-1-->L31-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 71#[L47, L20-1, L31-1]true [2023-10-12 17:40:39,572 INFO L750 eck$LassoCheckResult]: Loop: 71#[L47, L20-1, L31-1]true [75] L31-1-->L31-1: Formula: (let ((.cse0 (< 0 v_counter_25))) (and (= (ite .cse0 (+ v_j2_15 1) v_j2_15) v_j2_14) (< v_j2_15 v_M2_9) (= v_counter_24 (ite .cse0 (+ v_counter_25 (* (- 1) v_C_9)) v_counter_25)))) InVars {counter=v_counter_25, j2=v_j2_15, M2=v_M2_9, C=v_C_9} OutVars{counter=v_counter_24, j2=v_j2_14, M2=v_M2_9, C=v_C_9} AuxVars[] AssignedVars[counter, j2] 71#[L47, L20-1, L31-1]true [2023-10-12 17:40:39,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash 106736, now seen corresponding path program 1 times [2023-10-12 17:40:39,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:39,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006231912] [2023-10-12 17:40:39,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:39,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:39,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash 106, now seen corresponding path program 1 times [2023-10-12 17:40:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:39,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094308423] [2023-10-12 17:40:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:39,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:39,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:39,615 INFO L85 PathProgramCache]: Analyzing trace with hash 3308891, now seen corresponding path program 1 times [2023-10-12 17:40:39,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:39,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309327788] [2023-10-12 17:40:39,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:39,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:39,781 INFO L201 PluginConnector]: Adding new model nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:40:39 BoogieIcfgContainer [2023-10-12 17:40:39,781 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:40:39,781 INFO L158 Benchmark]: Toolchain (without parser) took 1506.69ms. Allocated memory is still 188.7MB. Free memory was 147.2MB in the beginning and 122.6MB in the end (delta: 24.6MB). Peak memory consumption was 23.5MB. Max. memory is 8.0GB. [2023-10-12 17:40:39,782 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 188.7MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:40:39,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.11ms. Allocated memory is still 188.7MB. Free memory was 147.1MB in the beginning and 145.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:39,782 INFO L158 Benchmark]: Boogie Preprocessor took 25.23ms. Allocated memory is still 188.7MB. Free memory was 145.6MB in the beginning and 144.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:39,783 INFO L158 Benchmark]: RCFGBuilder took 233.08ms. Allocated memory is still 188.7MB. Free memory was 144.6MB in the beginning and 135.3MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:40:39,783 INFO L158 Benchmark]: BuchiAutomizer took 1222.43ms. Allocated memory is still 188.7MB. Free memory was 135.2MB in the beginning and 122.6MB in the end (delta: 12.5MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:39,787 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.21ms. Allocated memory is still 188.7MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.11ms. Allocated memory is still 188.7MB. Free memory was 147.1MB in the beginning and 145.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.23ms. Allocated memory is still 188.7MB. Free memory was 145.6MB in the beginning and 144.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 233.08ms. Allocated memory is still 188.7MB. Free memory was 144.6MB in the beginning and 135.3MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1222.43ms. Allocated memory is still 188.7MB. Free memory was 135.2MB in the beginning and 122.6MB in the end (delta: 12.5MB). Peak memory consumption was 11.0MB. 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * j1 + M1 and consists of 4 locations. The remainder module has 224 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 2 iterations. TraceHistogramMax:0. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 32 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp66 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 82ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 30]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L41] 0 assume j1 == 0; [L42] 0 assume j2 == 0; [L43] 0 assume counter == 0; [L44] 0 assume M2 == M1; [L45] 0 assume 0 < M2; VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L46] FORK 0 fork 1 thread1(); VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L47] FORK 0 fork 2, 2 thread2(); VAL [M1=1, M2=1, counter=0, j1=0, j2=0] Loop: [L30] COND TRUE j2 < M2 [L32] j2 := (if 0 < counter then j2 + 1 else j2); [L33] counter := (if 0 < counter then counter - C else counter); End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 30]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L41] 0 assume j1 == 0; [L42] 0 assume j2 == 0; [L43] 0 assume counter == 0; [L44] 0 assume M2 == M1; [L45] 0 assume 0 < M2; VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L46] FORK 0 fork 1 thread1(); VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L47] FORK 0 fork 2, 2 thread2(); VAL [M1=1, M2=1, counter=0, j1=0, j2=0] Loop: [L30] COND TRUE j2 < M2 [L32] j2 := (if 0 < counter then j2 + 1 else j2); [L33] counter := (if 0 < counter then counter - C else counter); End of lasso representation. * 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, 48 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 30, unknown conditional: 0, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:40:39,818 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:40:40,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...