/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_increment_nonterminating2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:18:09,127 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:18:09,183 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:18:09,211 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:18:09,212 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:18:09,212 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:18:09,213 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:18:09,213 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:18:09,214 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:18:09,214 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:18:09,214 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:18:09,215 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:18:09,215 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:18:09,215 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:18:09,215 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:18:09,216 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:18:09,216 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:18:09,217 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:18:09,217 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:18:09,217 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:18:09,217 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:18:09,221 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:18:09,222 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:18:09,222 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:18:09,222 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:18:09,223 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:18:09,223 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:18:09,223 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:18:09,223 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:18:09,224 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:18:09,224 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:18:09,224 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:18:09,224 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:18:09,225 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:18:09,226 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:18:09,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:18:09,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:18:09,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:18:09,464 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:18:09,467 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:18:09,469 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:18:09,475 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_increment_nonterminating2.bpl' [2023-10-12 17:18:09,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:18:09,502 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:18:09,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:09,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:18:09,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:18:09,515 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:18:09" (1/1) ... [2023-10-12 17:18:09,527 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:18:09" (1/1) ... [2023-10-12 17:18:09,534 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:18:09,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:09,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:18:09,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:18:09,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:18:09,551 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:18:09" (1/1) ... [2023-10-12 17:18:09,551 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:18:09" (1/1) ... [2023-10-12 17:18:09,551 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:18:09" (1/1) ... [2023-10-12 17:18:09,552 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:18:09" (1/1) ... [2023-10-12 17:18:09,554 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:18:09" (1/1) ... [2023-10-12 17:18:09,556 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:18:09" (1/1) ... [2023-10-12 17:18:09,557 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:18:09" (1/1) ... [2023-10-12 17:18:09,557 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:18:09" (1/1) ... [2023-10-12 17:18:09,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:18:09,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:18:09,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:18:09,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:18:09,561 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:18:09" (1/1) ... [2023-10-12 17:18:09,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,594 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:18:09,619 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:18:09,635 INFO L124 BoogieDeclarations]: Specification and implementation of procedure dec given in one single declaration [2023-10-12 17:18:09,635 INFO L130 BoogieDeclarations]: Found specification of procedure dec [2023-10-12 17:18:09,635 INFO L138 BoogieDeclarations]: Found implementation of procedure dec [2023-10-12 17:18:09,635 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:18:09,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:18:09,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:18:09,636 INFO L124 BoogieDeclarations]: Specification and implementation of procedure inc given in one single declaration [2023-10-12 17:18:09,636 INFO L130 BoogieDeclarations]: Found specification of procedure inc [2023-10-12 17:18:09,636 INFO L138 BoogieDeclarations]: Found implementation of procedure inc [2023-10-12 17:18:09,637 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:18:09,678 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:18:09,680 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:18:09,762 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:18:09,770 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:18:09,770 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:18:09,776 INFO L201 PluginConnector]: Adding new model concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:09 BoogieIcfgContainer [2023-10-12 17:18:09,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:18:09,777 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:18:09,777 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:18:09,781 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:18:09,782 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:09,782 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:18:09" (1/2) ... [2023-10-12 17:18:09,784 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@693a079e and model type concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:18:09, skipping insertion in model container [2023-10-12 17:18:09,785 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:09,785 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:18:09" (2/2) ... [2023-10-12 17:18:09,789 INFO L332 chiAutomizerObserver]: Analyzing ICFG concurrent_increment_nonterminating2.bpl [2023-10-12 17:18:09,862 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:18:09,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 18 transitions, 52 flow [2023-10-12 17:18:09,910 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2023-10-12 17:18:09,911 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:18:09,915 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:18:09,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 18 transitions, 52 flow [2023-10-12 17:18:09,921 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2023-10-12 17:18:09,929 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:18:09,941 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 14 transitions, 40 flow [2023-10-12 17:18:09,943 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 14 transitions, 40 flow [2023-10-12 17:18:09,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 14 transitions, 40 flow [2023-10-12 17:18:09,947 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2023-10-12 17:18:09,947 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:18:09,948 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:18:09,948 INFO L119 LiptonReduction]: Number of co-enabled transitions 48 [2023-10-12 17:18:10,076 INFO L134 LiptonReduction]: Checked pairs total: 43 [2023-10-12 17:18:10,077 INFO L136 LiptonReduction]: Total number of compositions: 4 [2023-10-12 17:18:10,091 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:18:10,092 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:18:10,092 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:18:10,092 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:18:10,092 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:18:10,092 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:18:10,092 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:18:10,092 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:18:10,093 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 places, 10 transitions, 32 flow [2023-10-12 17:18:10,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:10,096 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:18:10,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:10,096 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:10,099 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:18:10,099 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 places, 10 transitions, 32 flow [2023-10-12 17:18:10,100 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:10,100 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:18:10,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:10,101 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:10,105 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:18:10,106 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:18:10,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:10,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1873, now seen corresponding path program 1 times [2023-10-12 17:18:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:10,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471160482] [2023-10-12 17:18:10,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:10,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:10,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:10,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:10,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:10,196 INFO L85 PathProgramCache]: Analyzing trace with hash 84, now seen corresponding path program 1 times [2023-10-12 17:18:10,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:10,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721010956] [2023-10-12 17:18:10,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:10,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:10,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:10,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:10,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:10,210 INFO L85 PathProgramCache]: Analyzing trace with hash 58116, now seen corresponding path program 1 times [2023-10-12 17:18:10,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:10,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503742071] [2023-10-12 17:18:10,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:10,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,288 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:18:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503742071] [2023-10-12 17:18:10,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503742071] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:10,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:10,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:18:10,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078552669] [2023-10-12 17:18:10,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:10,344 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:10,345 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:10,345 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:10,345 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:10,345 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:18:10,346 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,346 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:10,346 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:10,346 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_BEv2_Iteration1_Loop [2023-10-12 17:18:10,346 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:10,346 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:10,360 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:18:10,405 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:10,405 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:18:10,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:10,408 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:18:10,410 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:18:10,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:18:10,413 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:10,424 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:18:10,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:10,425 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:18:10,429 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:18:10,432 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:18:10,432 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:10,449 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:18:10,452 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:18:10,452 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:10,453 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:10,453 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:10,453 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:10,453 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:10,453 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,453 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:10,453 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:10,453 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_BEv2_Iteration1_Loop [2023-10-12 17:18:10,453 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:10,453 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:10,454 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:18:10,476 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:10,480 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:10,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:10,483 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:18:10,495 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:18:10,496 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:18:10,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:10,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:10,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:10,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:10,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:10,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:10,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:10,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:10,527 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:18:10,527 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:18:10,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:10,533 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:18:10,536 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:10,536 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:18:10,536 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:18:10,537 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:10,537 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 2*x + 1 Supporting invariants [] [2023-10-12 17:18:10,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:10,543 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:10,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:10,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,583 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:10,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:10,583 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:18:10,610 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:18:10,611 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:10,703 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 124 transitions. [2023-10-12 17:18:10,704 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:10,708 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:10,712 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:18:10,720 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:18:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2023-10-12 17:18:10,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:18:10,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:18:10,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 60 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:18:10,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 108 transitions, 576 flow [2023-10-12 17:18:10,756 INFO L124 PetriNetUnfolderBase]: 37/83 cut-off events. [2023-10-12 17:18:10,757 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:18:10,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 83 events. 37/83 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 262 event pairs, 2 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 116. Up to 18 conditions per place. [2023-10-12 17:18:10,759 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 25 places, 108 transitions, 576 flow [2023-10-12 17:18:10,767 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 25 places, 108 transitions, 576 flow [2023-10-12 17:18:10,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:18:10,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:18:10,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:18:10,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 108 transitions, 576 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:18:10,771 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:18:10,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:18:10,817 INFO L124 PetriNetUnfolderBase]: 17/43 cut-off events. [2023-10-12 17:18:10,818 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-10-12 17:18:10,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 43 events. 17/43 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 81 event pairs, 0 based on Foata normal form. 3/34 useless extension candidates. Maximal degree in co-relation 86. Up to 32 conditions per place. [2023-10-12 17:18:10,822 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 19 selfloop transitions, 3 changer transitions 6/28 dead transitions. [2023-10-12 17:18:10,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 201 flow [2023-10-12 17:18:10,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 28 transitions, 201 flow [2023-10-12 17:18:10,835 INFO L124 PetriNetUnfolderBase]: 17/43 cut-off events. [2023-10-12 17:18:10,835 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-10-12 17:18:10,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 43 events. 17/43 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 86. Up to 32 conditions per place. [2023-10-12 17:18:10,836 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 25 places, 28 transitions, 201 flow [2023-10-12 17:18:10,837 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 25 places, 28 transitions, 201 flow [2023-10-12 17:18:10,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:18:10,839 INFO L430 stractBuchiCegarLoop]: Abstraction has has 25 places, 28 transitions, 201 flow [2023-10-12 17:18:10,839 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:18:10,839 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 28 transitions, 201 flow [2023-10-12 17:18:10,843 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:10,843 INFO L124 PetriNetUnfolderBase]: 5/18 cut-off events. [2023-10-12 17:18:10,844 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-10-12 17:18:10,844 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:10,845 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] 75#[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] 75#[L16, L24, L32]true [2023-10-12 17:18:10,845 INFO L750 eck$LassoCheckResult]: Loop: 75#[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] 75#[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] 75#[L16, L24, L32]true [2023-10-12 17:18:10,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:10,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1801461, now seen corresponding path program 1 times [2023-10-12 17:18:10,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:10,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283966] [2023-10-12 17:18:10,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:10,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:10,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:10,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:10,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:10,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2593, now seen corresponding path program 1 times [2023-10-12 17:18:10,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:10,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297233352] [2023-10-12 17:18:10,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:10,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:10,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:10,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:10,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1731205653, now seen corresponding path program 2 times [2023-10-12 17:18:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:10,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152335032] [2023-10-12 17:18:10,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:10,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,931 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:18:10,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152335032] [2023-10-12 17:18:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152335032] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:10,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:10,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:18:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016953153] [2023-10-12 17:18:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:10,965 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:10,965 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:10,965 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:10,965 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:10,966 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:18:10,966 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,966 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:10,966 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:10,966 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_BEv2_Iteration2_Loop [2023-10-12 17:18:10,966 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:10,966 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:10,967 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:18:10,984 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:10,985 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:18:10,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:10,986 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:18:11,005 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:18:11,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:18:11,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:11,034 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:18:11,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:11,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:11,074 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:18:11,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:18:11,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:11,105 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:18:11,138 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:18:11,141 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:18:11,142 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:11,142 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:11,142 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:11,142 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:11,142 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:11,142 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:11,142 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:11,142 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:11,142 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_BEv2_Iteration2_Loop [2023-10-12 17:18:11,142 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:11,142 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:11,143 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:18:11,162 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:11,162 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:11,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:11,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:11,164 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:18:11,176 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:18:11,181 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:18:11,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:11,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:11,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:11,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:11,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:11,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:11,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:11,199 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:11,203 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:18:11,204 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:18:11,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:11,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:11,208 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:18:11,209 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:18:11,211 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:11,211 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:18:11,211 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:11,211 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -1*x Supporting invariants [] [2023-10-12 17:18:11,213 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:18:11,214 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:11,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:11,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:11,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:11,256 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:11,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:11,274 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:18:11,274 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:18:11,275 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:11,371 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 163 transitions. [2023-10-12 17:18:11,371 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:11,375 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:11,376 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:18:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:11,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2023-10-12 17:18:11,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:18:11,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:11,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:18:11,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:11,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:18:11,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:11,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 398 transitions, 3712 flow [2023-10-12 17:18:11,400 INFO L124 PetriNetUnfolderBase]: 61/134 cut-off events. [2023-10-12 17:18:11,400 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-10-12 17:18:11,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 134 events. 61/134 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 468 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 319. Up to 123 conditions per place. [2023-10-12 17:18:11,401 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 39 places, 398 transitions, 3712 flow [2023-10-12 17:18:11,407 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 39 places, 398 transitions, 3712 flow [2023-10-12 17:18:11,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:18:11,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:18:11,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:18:11,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 398 transitions, 3712 flow. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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:18:11,409 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:18:11,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:18:11,471 INFO L124 PetriNetUnfolderBase]: 44/129 cut-off events. [2023-10-12 17:18:11,471 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-10-12 17:18:11,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 129 events. 44/129 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 556 event pairs, 0 based on Foata normal form. 2/98 useless extension candidates. Maximal degree in co-relation 521. Up to 118 conditions per place. [2023-10-12 17:18:11,476 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 46 selfloop transitions, 26 changer transitions 24/96 dead transitions. [2023-10-12 17:18:11,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 96 transitions, 1059 flow [2023-10-12 17:18:11,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 96 transitions, 1059 flow [2023-10-12 17:18:11,499 INFO L124 PetriNetUnfolderBase]: 44/129 cut-off events. [2023-10-12 17:18:11,499 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-10-12 17:18:11,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 129 events. 44/129 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 559 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 521. Up to 118 conditions per place. [2023-10-12 17:18:11,502 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 38 places, 96 transitions, 1059 flow [2023-10-12 17:18:11,504 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 38 places, 96 transitions, 1059 flow [2023-10-12 17:18:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:18:11,506 INFO L430 stractBuchiCegarLoop]: Abstraction has has 38 places, 96 transitions, 1059 flow [2023-10-12 17:18:11,507 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:18:11,507 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 places, 96 transitions, 1059 flow [2023-10-12 17:18:11,512 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:11,512 INFO L124 PetriNetUnfolderBase]: 7/33 cut-off events. [2023-10-12 17:18:11,512 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:18:11,512 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:11,514 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] 75#[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] 75#[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] 75#[L16, L24, L32]true [2023-10-12 17:18:11,515 INFO L750 eck$LassoCheckResult]: Loop: 75#[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] 75#[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] 75#[L16, L24, L32]true [2023-10-12 17:18:11,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:11,518 INFO L85 PathProgramCache]: Analyzing trace with hash 55845344, now seen corresponding path program 1 times [2023-10-12 17:18:11,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:11,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534908212] [2023-10-12 17:18:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:11,576 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:18:11,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:11,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534908212] [2023-10-12 17:18:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534908212] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:11,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:11,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:18:11,591 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:18:11,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357137822] [2023-10-12 17:18:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:11,593 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:18:11,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:11,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2595, now seen corresponding path program 1 times [2023-10-12 17:18:11,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:11,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464610854] [2023-10-12 17:18:11,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:11,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:11,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:18:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:11,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:18:11,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:18:11,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:18:11,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 96 transitions, 1059 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:18:11,645 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:18:11,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:18:11,685 INFO L124 PetriNetUnfolderBase]: 30/103 cut-off events. [2023-10-12 17:18:11,686 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-10-12 17:18:11,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 103 events. 30/103 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 380 event pairs, 0 based on Foata normal form. 3/87 useless extension candidates. Maximal degree in co-relation 492. Up to 92 conditions per place. [2023-10-12 17:18:11,688 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 48 selfloop transitions, 14 changer transitions 18/80 dead transitions. [2023-10-12 17:18:11,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 80 transitions, 1041 flow [2023-10-12 17:18:11,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 80 transitions, 1041 flow [2023-10-12 17:18:11,700 INFO L124 PetriNetUnfolderBase]: 30/103 cut-off events. [2023-10-12 17:18:11,700 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-10-12 17:18:11,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 103 events. 30/103 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 380 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 492. Up to 92 conditions per place. [2023-10-12 17:18:11,701 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 41 places, 80 transitions, 1041 flow [2023-10-12 17:18:11,703 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 41 places, 80 transitions, 1041 flow [2023-10-12 17:18:11,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:18:11,706 INFO L430 stractBuchiCegarLoop]: Abstraction has has 41 places, 80 transitions, 1041 flow [2023-10-12 17:18:11,706 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:18:11,706 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 places, 80 transitions, 1041 flow [2023-10-12 17:18:11,714 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:11,714 INFO L124 PetriNetUnfolderBase]: 16/64 cut-off events. [2023-10-12 17:18:11,714 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-10-12 17:18:11,714 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:11,715 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] 75#[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] 75#[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] 75#[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] 75#[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] 75#[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] 75#[L16, L24, L32]true [2023-10-12 17:18:11,715 INFO L750 eck$LassoCheckResult]: Loop: 75#[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] 75#[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] 75#[L16, L24, L32]true [2023-10-12 17:18:11,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1536292597, now seen corresponding path program 2 times [2023-10-12 17:18:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:11,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881224837] [2023-10-12 17:18:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:11,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:18:11,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:11,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881224837] [2023-10-12 17:18:11,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881224837] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:11,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:11,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-10-12 17:18:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645778787] [2023-10-12 17:18:11,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:11,777 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:18:11,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:11,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2655, now seen corresponding path program 2 times [2023-10-12 17:18:11,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:11,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151246210] [2023-10-12 17:18:11,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:11,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:11,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:18:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:18:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:18:11,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 80 transitions, 1041 flow. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:18:11,812 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:18:11,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:18:11,837 INFO L124 PetriNetUnfolderBase]: 16/72 cut-off events. [2023-10-12 17:18:11,838 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-10-12 17:18:11,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 72 events. 16/72 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 240 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 253. Up to 61 conditions per place. [2023-10-12 17:18:11,839 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 33 selfloop transitions, 17 changer transitions 17/67 dead transitions. [2023-10-12 17:18:11,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 67 transitions, 1013 flow [2023-10-12 17:18:11,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 67 transitions, 1013 flow [2023-10-12 17:18:11,846 INFO L124 PetriNetUnfolderBase]: 16/72 cut-off events. [2023-10-12 17:18:11,847 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-10-12 17:18:11,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 72 events. 16/72 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 241 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 253. Up to 61 conditions per place. [2023-10-12 17:18:11,847 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 44 places, 67 transitions, 1013 flow [2023-10-12 17:18:11,849 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 44 places, 67 transitions, 1013 flow [2023-10-12 17:18:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:18:11,851 INFO L430 stractBuchiCegarLoop]: Abstraction has has 44 places, 67 transitions, 1013 flow [2023-10-12 17:18:11,851 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:18:11,851 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 44 places, 67 transitions, 1013 flow [2023-10-12 17:18:11,858 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:11,858 INFO L124 PetriNetUnfolderBase]: 15/63 cut-off events. [2023-10-12 17:18:11,858 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:18:11,858 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:11,859 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] 75#[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] 75#[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] 75#[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] 75#[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] 75#[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] 75#[L16, L24, L32]true [2023-10-12 17:18:11,859 INFO L750 eck$LassoCheckResult]: Loop: 75#[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] 75#[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] 75#[L16, L24, L32]true [2023-10-12 17:18:11,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1536292537, now seen corresponding path program 3 times [2023-10-12 17:18:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:11,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418463778] [2023-10-12 17:18:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:11,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:11,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2595, now seen corresponding path program 3 times [2023-10-12 17:18:11,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:11,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333040923] [2023-10-12 17:18:11,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:11,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:11,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:11,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1091620133, now seen corresponding path program 4 times [2023-10-12 17:18:11,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:11,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446372973] [2023-10-12 17:18:11,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:11,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:12,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:12,053 INFO L201 PluginConnector]: Adding new model concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:18:12 BoogieIcfgContainer [2023-10-12 17:18:12,053 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:18:12,054 INFO L158 Benchmark]: Toolchain (without parser) took 2552.12ms. Allocated memory was 194.0MB in the beginning and 294.6MB in the end (delta: 100.7MB). Free memory was 149.9MB in the beginning and 228.7MB in the end (delta: -78.8MB). Peak memory consumption was 22.7MB. Max. memory is 8.0GB. [2023-10-12 17:18:12,054 INFO L158 Benchmark]: Boogie PL CUP Parser took 5.44ms. Allocated memory is still 194.0MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:18:12,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.61ms. Allocated memory is still 194.0MB. Free memory was 149.7MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:18:12,055 INFO L158 Benchmark]: Boogie Preprocessor took 20.94ms. Allocated memory is still 194.0MB. Free memory was 148.2MB in the beginning and 147.2MB in the end (delta: 991.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:18:12,056 INFO L158 Benchmark]: RCFGBuilder took 216.29ms. Allocated memory is still 194.0MB. Free memory was 147.2MB in the beginning and 138.6MB in the end (delta: 8.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:18:12,056 INFO L158 Benchmark]: BuchiAutomizer took 2276.56ms. Allocated memory was 194.0MB in the beginning and 294.6MB in the end (delta: 100.7MB). Free memory was 138.4MB in the beginning and 228.7MB in the end (delta: -90.3MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2023-10-12 17:18:12,058 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 5.44ms. Allocated memory is still 194.0MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.61ms. Allocated memory is still 194.0MB. Free memory was 149.7MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.94ms. Allocated memory is still 194.0MB. Free memory was 148.2MB in the beginning and 147.2MB in the end (delta: 991.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 216.29ms. Allocated memory is still 194.0MB. Free memory was 147.2MB in the beginning and 138.6MB in the end (delta: 8.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2276.56ms. Allocated memory was 194.0MB in the beginning and 294.6MB in the end (delta: 100.7MB). Free memory was 138.4MB in the beginning and 228.7MB in the end (delta: -90.3MB). Peak memory consumption was 11.2MB. 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 6 terminating modules (4 trivial, 2 deterministic, 0 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 -1 * x and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1013 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 193 IncrementalHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 62 mSDtfsCounter, 193 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT2 SILN2 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf94 smp100 dnf100 smp100 tf112 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 55ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.2s - 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] [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] [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: 47, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 20, dependent conditional: 0, dependent unconditional: 20, 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:18:12,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...