/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/ConcurrentTerminationBpl/concurrent_increment_nonterminating2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:36:39,688 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:36:39,745 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:36:39,759 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:36:39,760 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:36:39,760 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:36:39,761 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:36:39,761 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:36:39,761 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:36:39,761 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:36:39,762 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:36:39,762 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:36:39,762 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:36:39,762 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:36:39,763 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:36:39,763 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:36:39,763 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:36:39,763 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:36:39,764 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:36:39,764 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:36:39,764 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:36:39,767 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:36:39,767 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:36:39,767 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:36:39,770 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:36:39,770 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:36:39,770 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:36:39,770 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:36:39,770 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:36:39,771 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:36:39,771 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:36:39,772 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:36:39,772 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:36:39,773 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:36:39,773 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:36:39,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:36:39,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:36:39,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:36:39,970 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:36:39,971 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:36:39,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_increment_nonterminating2.bpl [2023-10-12 17:36:39,972 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_increment_nonterminating2.bpl' [2023-10-12 17:36:39,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:36:39,988 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:36:39,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:39,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:36:39,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:36:39,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:40,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:40,012 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:36:40,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:40,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:36:40,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:36:40,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:36:40,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:40,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:40,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:40,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:40,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:40,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:40,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:40,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:40,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:36:40,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:36:40,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:36:40,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:36:40,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:40,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:40,120 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:36:40,134 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:36:40,156 INFO L124 BoogieDeclarations]: Specification and implementation of procedure dec given in one single declaration [2023-10-12 17:36:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure dec [2023-10-12 17:36:40,156 INFO L138 BoogieDeclarations]: Found implementation of procedure dec [2023-10-12 17:36:40,157 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:36:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:36:40,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:36:40,157 INFO L124 BoogieDeclarations]: Specification and implementation of procedure inc given in one single declaration [2023-10-12 17:36:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure inc [2023-10-12 17:36:40,157 INFO L138 BoogieDeclarations]: Found implementation of procedure inc [2023-10-12 17:36:40,158 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:36:40,190 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:36:40,192 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:36:40,249 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:36:40,253 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:36:40,253 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:36:40,254 INFO L201 PluginConnector]: Adding new model concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:40 BoogieIcfgContainer [2023-10-12 17:36:40,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:36:40,255 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:36:40,255 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:36:40,258 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:36:40,259 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:40,259 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/2) ... [2023-10-12 17:36:40,260 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@319f5e75 and model type concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:36:40, skipping insertion in model container [2023-10-12 17:36:40,261 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:40,261 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:40" (2/2) ... [2023-10-12 17:36:40,264 INFO L332 chiAutomizerObserver]: Analyzing ICFG concurrent_increment_nonterminating2.bpl [2023-10-12 17:36:40,354 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:36:40,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 18 transitions, 52 flow [2023-10-12 17:36:40,400 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2023-10-12 17:36:40,400 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:36:40,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 14 events. 2/14 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-10-12 17:36:40,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 18 transitions, 52 flow [2023-10-12 17:36:40,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2023-10-12 17:36:40,408 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:36:40,417 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 40 flow [2023-10-12 17:36:40,419 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 14 transitions, 40 flow [2023-10-12 17:36:40,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 14 transitions, 40 flow [2023-10-12 17:36:40,423 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2023-10-12 17:36:40,423 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:36:40,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 14 events. 2/14 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-10-12 17:36:40,423 INFO L119 LiptonReduction]: Number of co-enabled transitions 48 [2023-10-12 17:36:40,496 INFO L134 LiptonReduction]: Checked pairs total: 43 [2023-10-12 17:36:40,496 INFO L136 LiptonReduction]: Total number of compositions: 4 [2023-10-12 17:36:40,505 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:36:40,506 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:36:40,506 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:36:40,506 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:36:40,506 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:36:40,506 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:36:40,506 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:36:40,506 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:36:40,506 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 15 places, 10 transitions, 32 flow [2023-10-12 17:36:40,509 ERROR L47 etriNetUnfolderRabin]: [1:1A:[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x][3], 2:2A:[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0][1]][3:3A:[53] L24-->L24: Formula: (and (= v_x_35 (+ v_x_34 1)) (< 0 (+ v_x_35 1))) InVars {x=v_x_35} OutVars{x=v_x_34} AuxVars[] AssignedVars[x][9]] [2023-10-12 17:36:40,510 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:40,510 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:36:40,510 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:40,510 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:40,513 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:36:40,513 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 15 places, 10 transitions, 32 flow [2023-10-12 17:36:40,514 ERROR L47 etriNetUnfolderRabin]: [1:1A:[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x][3], 2:2A:[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0][1]][3:3A:[53] L24-->L24: Formula: (and (= v_x_35 (+ v_x_34 1)) (< 0 (+ v_x_35 1))) InVars {x=v_x_35} OutVars{x=v_x_34} AuxVars[] AssignedVars[x][9]] [2023-10-12 17:36:40,514 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:40,514 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:36:40,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:40,514 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:40,518 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 27#[L15]true [44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0] 29#[L24, L15-1]true [2023-10-12 17:36:40,518 INFO L750 eck$LassoCheckResult]: Loop: 29#[L24, L15-1]true [53] L24-->L24: Formula: (and (= v_x_35 (+ v_x_34 1)) (< 0 (+ v_x_35 1))) InVars {x=v_x_35} OutVars{x=v_x_34} AuxVars[] AssignedVars[x] 29#[L24, L15-1]true [2023-10-12 17:36:40,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1873, now seen corresponding path program 1 times [2023-10-12 17:36:40,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:40,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119079658] [2023-10-12 17:36:40,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:40,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:40,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,591 INFO L85 PathProgramCache]: Analyzing trace with hash 84, now seen corresponding path program 1 times [2023-10-12 17:36:40,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:40,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224166647] [2023-10-12 17:36:40,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:40,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:40,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,604 INFO L85 PathProgramCache]: Analyzing trace with hash 58116, now seen corresponding path program 1 times [2023-10-12 17:36:40,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:40,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525755343] [2023-10-12 17:36:40,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:40,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:40,691 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:36:40,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:40,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525755343] [2023-10-12 17:36:40,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525755343] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:40,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:40,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:36:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76220050] [2023-10-12 17:36:40,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:40,723 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:40,723 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:40,723 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:40,723 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:40,723 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:40,724 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,724 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:40,724 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:40,724 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_BEv2_Iteration1_Loop [2023-10-12 17:36:40,724 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:40,724 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:40,734 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:36:40,760 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:40,761 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:40,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:40,765 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:36:40,766 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:36:40,767 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:40,767 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:40,795 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:36:40,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:40,800 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:36:40,801 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:36:40,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:40,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:40,825 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:40,829 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:36:40,829 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:40,829 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:40,829 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:40,830 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:40,830 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:40,830 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,830 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:40,830 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:40,830 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_BEv2_Iteration1_Loop [2023-10-12 17:36:40,830 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:40,830 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:40,831 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:36:40,859 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:40,862 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:40,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:40,864 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:36:40,866 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:36:40,867 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:36:40,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:40,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:40,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:40,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:40,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:40,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:40,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:40,896 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:40,900 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:40,901 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:40,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:40,904 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:36:40,906 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:36:40,953 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:40,954 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:40,954 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:40,955 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 2*x + 1 Supporting invariants [] [2023-10-12 17:36:40,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:36:40,961 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:40,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:40,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:40,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,000 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,002 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:36:41,031 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:36:41,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:41,088 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:36:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2023-10-12 17:36:41,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:36:41,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:36:41,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:36:41,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:41,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:36:41,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:36:41,105 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 19 places, 40 transitions, 208 flow. Second operand has 3 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:36:41,105 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:41,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:41,126 INFO L124 PetriNetUnfolderBase]: 10/24 cut-off events. [2023-10-12 17:36:41,126 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:36:41,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 24 events. 10/24 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 46. Up to 18 conditions per place. [2023-10-12 17:36:41,128 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 13 selfloop transitions, 2 changer transitions 0/15 dead transitions. [2023-10-12 17:36:41,129 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 21 places, 15 transitions, 108 flow [2023-10-12 17:36:41,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:36:41,130 INFO L430 stractBuchiCegarLoop]: Abstraction has has 21 places, 15 transitions, 108 flow [2023-10-12 17:36:41,130 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:36:41,130 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 21 places, 15 transitions, 108 flow [2023-10-12 17:36:41,135 ERROR L47 etriNetUnfolderRabin]: [1:1A:[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x][0], 2:2A:[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0][1], 4:3A:[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1][3], 7:4A:[51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x][5]][9:5A:[53] L24-->L24: Formula: (and (= v_x_35 (+ v_x_34 1)) (< 0 (+ v_x_35 1))) InVars {x=v_x_35} OutVars{x=v_x_34} AuxVars[] AssignedVars[x][9]] [2023-10-12 17:36:41,136 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:41,136 INFO L124 PetriNetUnfolderBase]: 2/8 cut-off events. [2023-10-12 17:36:41,136 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:36:41,136 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:41,137 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 27#[L15]true [44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0] 29#[L24, L15-1]true [47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1] 66#[L16, L24, L32]true [51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x] 66#[L16, L24, L32]true [2023-10-12 17:36:41,137 INFO L750 eck$LassoCheckResult]: Loop: 66#[L16, L24, L32]true [53] L24-->L24: Formula: (and (= v_x_35 (+ v_x_34 1)) (< 0 (+ v_x_35 1))) InVars {x=v_x_35} OutVars{x=v_x_34} AuxVars[] AssignedVars[x] 66#[L16, L24, L32]true [2023-10-12 17:36:41,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1801461, now seen corresponding path program 1 times [2023-10-12 17:36:41,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616227390] [2023-10-12 17:36:41,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:41,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,158 INFO L85 PathProgramCache]: Analyzing trace with hash 84, now seen corresponding path program 2 times [2023-10-12 17:36:41,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928393070] [2023-10-12 17:36:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:41,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash 55845344, now seen corresponding path program 1 times [2023-10-12 17:36:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398865415] [2023-10-12 17:36:41,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,192 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:36:41,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:41,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398865415] [2023-10-12 17:36:41,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398865415] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:41,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:41,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:36:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818220744] [2023-10-12 17:36:41,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:41,203 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,203 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,203 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,203 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,204 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:41,204 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,204 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,204 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,204 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_BEv2_Iteration2_Loop [2023-10-12 17:36:41,204 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,204 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,205 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:36:41,219 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,219 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:41,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,220 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:36:41,222 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:36:41,224 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:41,224 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,250 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:36:41,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,251 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:36:41,253 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:36:41,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:41,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,289 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:41,303 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:36:41,304 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,304 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,304 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,304 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,304 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:41,304 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,304 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,304 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,304 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_BEv2_Iteration2_Loop [2023-10-12 17:36:41,304 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,304 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,305 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:36:41,323 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,323 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:41,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,341 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:36:41,343 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:36:41,345 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:36:41,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:41,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:41,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:41,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:41,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:41,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:41,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:41,372 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:41,374 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:41,374 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:41,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,385 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:36:41,393 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:41,394 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:41,394 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:41,394 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 2*x + 1 Supporting invariants [] [2023-10-12 17:36:41,394 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:36:41,406 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:36:41,410 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:41,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,438 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,439 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:36:41,439 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:36:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2023-10-12 17:36:41,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:36:41,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:36:41,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:36:41,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:41,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:36:41,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:36:41,493 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 25 places, 60 transitions, 552 flow. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:41,493 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:41,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:41,527 INFO L124 PetriNetUnfolderBase]: 13/38 cut-off events. [2023-10-12 17:36:41,528 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-10-12 17:36:41,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 38 events. 13/38 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 69 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 152. Up to 32 conditions per place. [2023-10-12 17:36:41,529 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 18 selfloop transitions, 6 changer transitions 0/24 dead transitions. [2023-10-12 17:36:41,529 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 28 places, 24 transitions, 270 flow [2023-10-12 17:36:41,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:36:41,531 INFO L430 stractBuchiCegarLoop]: Abstraction has has 28 places, 24 transitions, 270 flow [2023-10-12 17:36:41,531 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:36:41,532 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 28 places, 24 transitions, 270 flow [2023-10-12 17:36:41,535 ERROR L47 etriNetUnfolderRabin]: [1:1A:[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x][0], 2:2A:[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0][1], 3:3A:[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1][2], 6:4A:[51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x][4], 12:5A:[51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x][8]][13:6A:[53] L24-->L24: Formula: (and (= v_x_35 (+ v_x_34 1)) (< 0 (+ v_x_35 1))) InVars {x=v_x_35} OutVars{x=v_x_34} AuxVars[] AssignedVars[x][14]] [2023-10-12 17:36:41,536 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:41,536 INFO L124 PetriNetUnfolderBase]: 3/12 cut-off events. [2023-10-12 17:36:41,536 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:36:41,536 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:41,538 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 27#[L15]true [44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0] 29#[L24, L15-1]true [47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1] 66#[L16, L24, L32]true [51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x] 66#[L16, L24, L32]true [51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x] 66#[L16, L24, L32]true [2023-10-12 17:36:41,538 INFO L750 eck$LassoCheckResult]: Loop: 66#[L16, L24, L32]true [53] L24-->L24: Formula: (and (= v_x_35 (+ v_x_34 1)) (< 0 (+ v_x_35 1))) InVars {x=v_x_35} OutVars{x=v_x_34} AuxVars[] AssignedVars[x] 66#[L16, L24, L32]true [2023-10-12 17:36:41,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,539 INFO L85 PathProgramCache]: Analyzing trace with hash 55845342, now seen corresponding path program 2 times [2023-10-12 17:36:41,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070801053] [2023-10-12 17:36:41,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:41,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,555 INFO L85 PathProgramCache]: Analyzing trace with hash 84, now seen corresponding path program 3 times [2023-10-12 17:36:41,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511702940] [2023-10-12 17:36:41,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:41,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1731205655, now seen corresponding path program 2 times [2023-10-12 17:36:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037238805] [2023-10-12 17:36:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:41,585 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,585 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,585 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,585 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,585 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:41,585 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,585 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,585 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,585 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_BEv2_Iteration3_Loop [2023-10-12 17:36:41,585 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,586 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,586 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:36:41,602 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,603 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:41,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,618 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:36:41,620 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:36:41,622 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:36:41,635 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:36:41,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:41,636 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,657 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:36:41,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,658 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:36:41,660 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:36:41,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:41,662 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,683 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:41,688 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:36:41,688 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,688 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,688 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,688 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,688 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:41,688 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,688 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,688 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,688 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_BEv2_Iteration3_Loop [2023-10-12 17:36:41,688 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,688 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,689 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:36:41,711 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,712 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:41,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,713 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:36:41,736 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:36:41,737 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:36:41,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:41,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:41,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:41,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:41,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:41,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:41,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:41,761 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:41,773 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:41,774 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:41,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,778 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:36:41,779 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:36:41,795 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:41,795 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:41,795 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:41,795 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 2*x + 1 Supporting invariants [] [2023-10-12 17:36:41,798 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:36:41,800 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:41,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,837 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,837 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:36:41,838 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:36:41,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:41,879 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:36:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2023-10-12 17:36:41,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:36:41,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,880 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:36:41,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,904 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,904 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:36:41,904 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:36:41,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:41,948 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:36:41,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2023-10-12 17:36:41,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:36:41,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,949 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:36:41,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,969 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,969 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:36:41,969 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:36:41,970 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:36:42,032 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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) Result 5 states and 142 transitions. [2023-10-12 17:36:42,033 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:36:42,039 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:36:42,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:42,041 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:36:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2023-10-12 17:36:42,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:36:42,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:36:42,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 61 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:36:42,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,043 INFO L430 stractBuchiCegarLoop]: Abstraction has has 38 places, 294 transitions, 3948 flow [2023-10-12 17:36:42,043 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:36:42,044 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 38 places, 294 transitions, 3948 flow [2023-10-12 17:36:42,050 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:42,050 INFO L124 PetriNetUnfolderBase]: 4/20 cut-off events. [2023-10-12 17:36:42,050 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-10-12 17:36:42,050 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:42,051 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 27#[L15]true [44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0] 29#[L24, L15-1]true [47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1] 66#[L16, L24, L32]true [51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x] 66#[L16, L24, L32]true [52] L24-->decEXIT: Formula: (<= (+ v_x_28 1) 0) InVars {x=v_x_28} OutVars{x=v_x_28} AuxVars[] AssignedVars[] 194#[L16, decEXIT, L32]true [51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x] 194#[L16, decEXIT, L32]true [51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x] 194#[L16, decEXIT, L32]true [2023-10-12 17:36:42,051 INFO L750 eck$LassoCheckResult]: Loop: 194#[L16, decEXIT, L32]true [51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x] 194#[L16, decEXIT, L32]true [51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x] 194#[L16, decEXIT, L32]true [2023-10-12 17:36:42,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2127768703, now seen corresponding path program 1 times [2023-10-12 17:36:42,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:42,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454020751] [2023-10-12 17:36:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:42,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:42,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454020751] [2023-10-12 17:36:42,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454020751] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:42,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:42,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:36:42,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644649177] [2023-10-12 17:36:42,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:42,087 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:36:42,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2593, now seen corresponding path program 1 times [2023-10-12 17:36:42,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:42,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060455056] [2023-10-12 17:36:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:42,134 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:42,134 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:42,134 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:42,134 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:42,134 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:42,134 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,134 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:42,134 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:42,134 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_BEv2_Iteration4_Loop [2023-10-12 17:36:42,134 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:42,134 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:42,135 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:36:42,148 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:42,148 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:42,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:42,149 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:36:42,168 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:36:42,168 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:42,169 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:42,205 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:36:42,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:42,206 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:36:42,209 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:36:42,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:42,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:42,233 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:42,237 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:36:42,238 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:42,238 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:42,238 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:42,238 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:42,238 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:42,238 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,238 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:42,238 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:42,238 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_BEv2_Iteration4_Loop [2023-10-12 17:36:42,238 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:42,238 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:42,239 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:36:42,254 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:42,254 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:42,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:42,264 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:36:42,265 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:36:42,268 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:36:42,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:42,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:42,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:42,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:42,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:42,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:42,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:42,284 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:42,286 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:42,287 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:36:42,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:42,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:42,288 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:36:42,289 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:36:42,291 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:42,292 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:42,292 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:42,292 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -1*x Supporting invariants [] [2023-10-12 17:36:42,296 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:36:42,297 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:42,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,341 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:36:42,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:42,365 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:36:42,365 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:36:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2023-10-12 17:36:42,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:36:42,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:36:42,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:36:42,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:42,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:42,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:36:42,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:36:42,473 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 43 places, 1470 transitions, 22680 flow. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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:36:42,473 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:42,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:42,604 INFO L124 PetriNetUnfolderBase]: 26/101 cut-off events. [2023-10-12 17:36:42,604 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-10-12 17:36:42,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 101 events. 26/101 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 403 event pairs, 0 based on Foata normal form. 3/80 useless extension candidates. Maximal degree in co-relation 653. Up to 95 conditions per place. [2023-10-12 17:36:42,605 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 37 selfloop transitions, 20 changer transitions 30/87 dead transitions. [2023-10-12 17:36:42,605 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 45 places, 87 transitions, 1485 flow [2023-10-12 17:36:42,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:36:42,606 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 87 transitions, 1485 flow [2023-10-12 17:36:42,606 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:36:42,606 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 45 places, 87 transitions, 1485 flow [2023-10-12 17:36:42,612 ERROR L47 etriNetUnfolderRabin]: [1:1A:[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x][0], 2:2A:[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0][1], 3:3A:[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1][2], 7:4A:[51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x][5], 13:5A:[51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x][11], 20:6A:[53] L24-->L24: Formula: (and (= v_x_35 (+ v_x_34 1)) (< 0 (+ v_x_35 1))) InVars {x=v_x_35} OutVars{x=v_x_34} AuxVars[] AssignedVars[x][18]][44:7A:[51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x][28], 45:8A:[53] L24-->L24: Formula: (and (= v_x_35 (+ v_x_34 1)) (< 0 (+ v_x_35 1))) InVars {x=v_x_35} OutVars{x=v_x_34} AuxVars[] AssignedVars[x][45]] [2023-10-12 17:36:42,612 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:42,612 INFO L124 PetriNetUnfolderBase]: 12/44 cut-off events. [2023-10-12 17:36:42,612 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-10-12 17:36:42,612 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:42,613 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x] 27#[L15]true [44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0] 29#[L24, L15-1]true [47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1] 66#[L16, L24, L32]true [51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x] 66#[L16, L24, L32]true [51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x] 66#[L16, L24, L32]true [53] L24-->L24: Formula: (and (= v_x_35 (+ v_x_34 1)) (< 0 (+ v_x_35 1))) InVars {x=v_x_35} OutVars{x=v_x_34} AuxVars[] AssignedVars[x] 66#[L16, L24, L32]true [2023-10-12 17:36:42,613 INFO L750 eck$LassoCheckResult]: Loop: 66#[L16, L24, L32]true [51] L32-->L32: Formula: (and (< v_x_21 0) (= (+ v_x_21 1) v_x_20)) InVars {x=v_x_21} OutVars{x=v_x_20} AuxVars[] AssignedVars[x] 66#[L16, L24, L32]true [53] L24-->L24: Formula: (and (= v_x_35 (+ v_x_34 1)) (< 0 (+ v_x_35 1))) InVars {x=v_x_35} OutVars{x=v_x_34} AuxVars[] AssignedVars[x] 66#[L16, L24, L32]true [2023-10-12 17:36:42,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1731205655, now seen corresponding path program 3 times [2023-10-12 17:36:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:42,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064468554] [2023-10-12 17:36:42,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:42,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:42,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2595, now seen corresponding path program 1 times [2023-10-12 17:36:42,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:42,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825518770] [2023-10-12 17:36:42,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:42,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:42,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1536292537, now seen corresponding path program 4 times [2023-10-12 17:36:42,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:42,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899836104] [2023-10-12 17:36:42,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:42,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:42,730 INFO L201 PluginConnector]: Adding new model concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:36:42 BoogieIcfgContainer [2023-10-12 17:36:42,730 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:36:42,731 INFO L158 Benchmark]: Toolchain (without parser) took 2743.29ms. Allocated memory was 215.0MB in the beginning and 268.4MB in the end (delta: 53.5MB). Free memory was 168.2MB in the beginning and 159.8MB in the end (delta: 8.4MB). Peak memory consumption was 61.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:42,731 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 215.0MB. Free memory is still 169.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:36:42,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.33ms. Allocated memory is still 215.0MB. Free memory was 168.2MB in the beginning and 166.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:42,732 INFO L158 Benchmark]: Boogie Preprocessor took 12.03ms. Allocated memory is still 215.0MB. Free memory was 166.6MB in the beginning and 165.6MB in the end (delta: 992.0kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:42,732 INFO L158 Benchmark]: RCFGBuilder took 225.76ms. Allocated memory is still 215.0MB. Free memory was 165.5MB in the beginning and 183.1MB in the end (delta: -17.6MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2023-10-12 17:36:42,732 INFO L158 Benchmark]: BuchiAutomizer took 2475.26ms. Allocated memory was 215.0MB in the beginning and 268.4MB in the end (delta: 53.5MB). Free memory was 182.9MB in the beginning and 159.8MB in the end (delta: 23.1MB). Peak memory consumption was 76.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:42,733 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 215.0MB. Free memory is still 169.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.33ms. Allocated memory is still 215.0MB. Free memory was 168.2MB in the beginning and 166.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.03ms. Allocated memory is still 215.0MB. Free memory was 166.6MB in the beginning and 165.6MB in the end (delta: 992.0kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 225.76ms. Allocated memory is still 215.0MB. Free memory was 165.5MB in the beginning and 183.1MB in the end (delta: -17.6MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * BuchiAutomizer took 2475.26ms. Allocated memory was 215.0MB in the beginning and 268.4MB in the end (delta: 53.5MB). Free memory was 182.9MB in the beginning and 159.8MB in the end (delta: 23.1MB). Peak memory consumption was 76.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 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 2 * x + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * x + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * x and consists of 4 locations. One nondeterministic module has affine ranking function 2 * x + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1485 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. 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 [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 265 mSDsluCounter, 201 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 320 IncrementalHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 147 mSDtfsCounter, 320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 91ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 32]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L13] 0 x := -2; VAL [x=-2] [L15] FORK 0 fork 1 dec(); VAL [x=-2] [L16] FORK 0 fork 2, 2 inc(); VAL [x=-2] [L32] COND TRUE 2 x < 0 [L33] 2 x := x + 1; VAL [x=-1] [L32] COND TRUE 2 x < 0 [L33] 2 x := x + 1; VAL [x=0] [L24] COND TRUE 1 x > -1 [L25] 1 x := x - 1; VAL [x=-1] Loop: [L32] COND TRUE x < 0 [L33] x := x + 1; [L24] COND TRUE x > -1 [L25] x := x - 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] 0 x := -2; VAL [x=-2] [L15] FORK 0 fork 1 dec(); VAL [x=-2] [L16] FORK 0 fork 2, 2 inc(); VAL [x=-2] [L32] COND TRUE 2 x < 0 [L33] 2 x := x + 1; VAL [x=-1] [L32] COND TRUE 2 x < 0 [L33] 2 x := x + 1; VAL [x=0] [L24] COND TRUE 1 x > -1 [L25] 1 x := x - 1; VAL [x=-1] Loop: [L32] COND TRUE x < 0 [L33] x := x + 1; [L24] COND TRUE x > -1 [L25] x := x - 1; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 19 PlacesBefore, 15 PlacesAfterwards, 14 TransitionsBefore, 10 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 43 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 34, unknown conditional: 0, unknown unconditional: 34] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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:36:42,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-10-12 17:36:42,947 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:36:43,150 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...