/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/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:18:07,385 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:18:07,445 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:07,470 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:18:07,471 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:18:07,471 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:18:07,472 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:18:07,472 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:18:07,472 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:18:07,473 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:18:07,473 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:18:07,473 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:18:07,473 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:18:07,474 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:18:07,474 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:18:07,474 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:18:07,474 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:18:07,475 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:18:07,475 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:18:07,475 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:18:07,475 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:18:07,477 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:18:07,477 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:18:07,477 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:18:07,477 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:18:07,477 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:18:07,478 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:18:07,478 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:18:07,478 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:18:07,478 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:18:07,479 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:18:07,479 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:18:07,479 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:18:07,480 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:18:07,480 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:07,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:18:07,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:18:07,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:18:07,721 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:18:07,722 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:18:07,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl [2023-10-12 17:18:07,724 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl' [2023-10-12 17:18:07,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:18:07,744 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:18:07,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:07,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:18:07,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:18:07,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:07" (1/1) ... [2023-10-12 17:18:07,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:07" (1/1) ... [2023-10-12 17:18:07,766 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:18:07,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:07,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:18:07,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:18:07,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:18:07,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:07" (1/1) ... [2023-10-12 17:18:07,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:07" (1/1) ... [2023-10-12 17:18:07,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:07" (1/1) ... [2023-10-12 17:18:07,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:07" (1/1) ... [2023-10-12 17:18:07,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:07" (1/1) ... [2023-10-12 17:18:07,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:07" (1/1) ... [2023-10-12 17:18:07,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:07" (1/1) ... [2023-10-12 17:18:07,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:07" (1/1) ... [2023-10-12 17:18:07,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:18:07,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:18:07,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:18:07,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:18:07,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:07" (1/1) ... [2023-10-12 17:18:07,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:07,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:07,888 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:07,912 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:07,928 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2023-10-12 17:18:07,928 INFO L130 BoogieDeclarations]: Found specification of procedure one [2023-10-12 17:18:07,928 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2023-10-12 17:18:07,929 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:18:07,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:18:07,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:18:07,929 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2023-10-12 17:18:07,929 INFO L130 BoogieDeclarations]: Found specification of procedure three [2023-10-12 17:18:07,929 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2023-10-12 17:18:07,929 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2023-10-12 17:18:07,929 INFO L130 BoogieDeclarations]: Found specification of procedure two [2023-10-12 17:18:07,929 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2023-10-12 17:18:07,930 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:07,967 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:18:07,968 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:18:08,035 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:18:08,040 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:18:08,040 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:18:08,042 INFO L201 PluginConnector]: Adding new model Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:08 BoogieIcfgContainer [2023-10-12 17:18:08,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:18:08,043 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:18:08,043 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:18:08,059 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:18:08,069 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:08,069 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:07" (1/2) ... [2023-10-12 17:18:08,071 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d6b76a0 and model type Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:18:08, skipping insertion in model container [2023-10-12 17:18:08,071 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:08,071 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:08" (2/2) ... [2023-10-12 17:18:08,073 INFO L332 chiAutomizerObserver]: Analyzing ICFG Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl [2023-10-12 17:18:08,129 INFO L144 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2023-10-12 17:18:08,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 34 transitions, 110 flow [2023-10-12 17:18:08,166 INFO L124 PetriNetUnfolderBase]: 8/31 cut-off events. [2023-10-12 17:18:08,167 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:18:08,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 31 events. 8/31 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 27. Up to 6 conditions per place. [2023-10-12 17:18:08,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 34 transitions, 110 flow [2023-10-12 17:18:08,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 28 transitions, 92 flow [2023-10-12 17:18:08,175 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:18:08,192 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 92 flow [2023-10-12 17:18:08,194 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 92 flow [2023-10-12 17:18:08,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 92 flow [2023-10-12 17:18:08,215 INFO L124 PetriNetUnfolderBase]: 8/31 cut-off events. [2023-10-12 17:18:08,216 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:18:08,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 31 events. 8/31 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 27. Up to 6 conditions per place. [2023-10-12 17:18:08,217 INFO L119 LiptonReduction]: Number of co-enabled transitions 244 [2023-10-12 17:18:08,400 INFO L134 LiptonReduction]: Checked pairs total: 382 [2023-10-12 17:18:08,400 INFO L136 LiptonReduction]: Total number of compositions: 6 [2023-10-12 17:18:08,409 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:18:08,409 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:18:08,409 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:18:08,409 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:18:08,409 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:18:08,409 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:18:08,409 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:18:08,409 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:18:08,410 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 places, 22 transitions, 80 flow [2023-10-12 17:18:08,414 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:08,414 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:18:08,415 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:08,415 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:08,419 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:18:08,419 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 23 places, 22 transitions, 80 flow [2023-10-12 17:18:08,422 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:08,422 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:18:08,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:08,422 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:08,426 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [86] $Ultimate##0-->L9: Formula: (and (= v_x_21 1) (= v_n_21 1)) InVars {} OutVars{n=v_n_21, x=v_x_21} AuxVars[] AssignedVars[n, x] 38#[L9]true [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 40#[L9-1, L20]true [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 42#[L20, L10, L29]true [2023-10-12 17:18:08,426 INFO L750 eck$LassoCheckResult]: Loop: 42#[L20, L10, L29]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 42#[L20, L10, L29]true [2023-10-12 17:18:08,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:08,430 INFO L85 PathProgramCache]: Analyzing trace with hash 114616, now seen corresponding path program 1 times [2023-10-12 17:18:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:08,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858172960] [2023-10-12 17:18:08,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:08,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:08,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:08,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:08,516 INFO L85 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 1 times [2023-10-12 17:18:08,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:08,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272838561] [2023-10-12 17:18:08,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:08,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:08,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:08,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:08,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash 3553185, now seen corresponding path program 1 times [2023-10-12 17:18:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:08,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873035087] [2023-10-12 17:18:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:08,612 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:08,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:08,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873035087] [2023-10-12 17:18:08,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873035087] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:08,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:08,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:18:08,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047048864] [2023-10-12 17:18:08,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:08,641 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:08,641 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:08,641 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:08,641 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:08,642 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:18:08,642 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:08,642 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:08,642 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:08,642 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:18:08,642 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:08,642 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:08,652 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:08,676 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:08,676 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:18:08,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:08,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:08,680 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:08,684 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:18:08,684 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:08,694 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:08,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:18:08,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:08,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:08,722 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:08,724 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:08,726 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:18:08,726 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:08,737 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:18:08,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:18:08,741 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:08,741 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:08,741 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:08,741 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:08,741 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:08,741 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:08,742 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:08,742 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:08,742 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:18:08,742 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:08,742 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:08,746 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:08,781 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:08,784 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:08,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:08,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:08,788 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:08,792 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:08,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:08,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:08,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:08,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:08,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:08,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:08,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:08,805 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:08,814 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:08,817 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:18:08,817 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:18:08,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:08,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:08,931 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:08,932 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:09,022 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:09,023 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:18:09,023 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:09,024 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2023-10-12 17:18:09,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:18:09,032 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:09,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:09,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,068 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:09,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:09,069 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:09,088 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:09,089 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:09,160 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 228 transitions. [2023-10-12 17:18:09,160 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:09,163 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:09,166 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:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-10-12 17:18:09,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 110 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:18:09,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:09,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 110 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:18:09,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:09,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 110 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:18:09,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:09,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 252 transitions, 1440 flow [2023-10-12 17:18:09,269 INFO L124 PetriNetUnfolderBase]: 600/895 cut-off events. [2023-10-12 17:18:09,269 INFO L125 PetriNetUnfolderBase]: For 399/399 co-relation queries the response was YES. [2023-10-12 17:18:09,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 895 events. 600/895 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3732 event pairs, 30 based on Foata normal form. 0/636 useless extension candidates. Maximal degree in co-relation 1563. Up to 184 conditions per place. [2023-10-12 17:18:09,277 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 33 places, 252 transitions, 1440 flow [2023-10-12 17:18:09,284 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 33 places, 252 transitions, 1440 flow [2023-10-12 17:18:09,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:18:09,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:18:09,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:18:09,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 252 transitions, 1440 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:09,287 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:18:09,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:18:09,403 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:09,450 INFO L124 PetriNetUnfolderBase]: 994/1551 cut-off events. [2023-10-12 17:18:09,451 INFO L125 PetriNetUnfolderBase]: For 707/707 co-relation queries the response was YES. [2023-10-12 17:18:09,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5208 conditions, 1551 events. 994/1551 cut-off events. For 707/707 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7189 event pairs, 89 based on Foata normal form. 0/1191 useless extension candidates. Maximal degree in co-relation 3896. Up to 808 conditions per place. [2023-10-12 17:18:09,461 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 179 selfloop transitions, 12 changer transitions 43/234 dead transitions. [2023-10-12 17:18:09,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 234 transitions, 1767 flow [2023-10-12 17:18:09,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 234 transitions, 1767 flow [2023-10-12 17:18:09,527 INFO L124 PetriNetUnfolderBase]: 994/1551 cut-off events. [2023-10-12 17:18:09,528 INFO L125 PetriNetUnfolderBase]: For 707/707 co-relation queries the response was YES. [2023-10-12 17:18:09,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5208 conditions, 1551 events. 994/1551 cut-off events. For 707/707 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7201 event pairs, 89 based on Foata normal form. 0/1191 useless extension candidates. Maximal degree in co-relation 3896. Up to 808 conditions per place. [2023-10-12 17:18:09,530 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 34 places, 234 transitions, 1767 flow [2023-10-12 17:18:09,532 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 34 places, 234 transitions, 1767 flow [2023-10-12 17:18:09,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:18:09,533 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 234 transitions, 1767 flow [2023-10-12 17:18:09,533 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:18:09,533 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 places, 234 transitions, 1767 flow [2023-10-12 17:18:09,535 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:09,535 INFO L124 PetriNetUnfolderBase]: 8/21 cut-off events. [2023-10-12 17:18:09,535 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-10-12 17:18:09,535 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:09,536 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [86] $Ultimate##0-->L9: Formula: (and (= v_x_21 1) (= v_n_21 1)) InVars {} OutVars{n=v_n_21, x=v_x_21} AuxVars[] AssignedVars[n, x] 38#[L9]true [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 40#[L9-1, L20]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 92#[L9-1, L22]true [2023-10-12 17:18:09,537 INFO L750 eck$LassoCheckResult]: Loop: 92#[L9-1, L22]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 40#[L9-1, L20]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 92#[L9-1, L22]true [2023-10-12 17:18:09,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,537 INFO L85 PathProgramCache]: Analyzing trace with hash 114630, now seen corresponding path program 1 times [2023-10-12 17:18:09,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:09,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889616619] [2023-10-12 17:18:09,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:09,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:09,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2813, now seen corresponding path program 1 times [2023-10-12 17:18:09,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:09,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200897527] [2023-10-12 17:18:09,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:09,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:09,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,573 INFO L85 PathProgramCache]: Analyzing trace with hash 110161282, now seen corresponding path program 1 times [2023-10-12 17:18:09,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:09,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874953450] [2023-10-12 17:18:09,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:09,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,610 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:09,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:09,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874953450] [2023-10-12 17:18:09,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874953450] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:09,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:09,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:18:09,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889995887] [2023-10-12 17:18:09,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:09,639 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:09,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:09,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:09,639 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:09,639 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:18:09,639 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,639 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:09,639 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:09,639 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:18:09,640 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:09,640 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:09,641 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:09,646 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:09,673 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:09,673 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:18:09,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,674 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:09,676 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:09,678 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:18:09,678 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:09,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:18:09,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,718 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:09,720 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:09,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:18:09,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:09,787 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:18:09,807 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:09,807 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:09,807 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:09,808 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:09,808 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:09,808 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:09,808 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,808 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:09,808 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:09,808 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:18:09,808 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:09,808 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:09,809 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:09,814 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:09,845 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:09,845 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:09,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,873 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:09,876 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:09,878 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:09,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:09,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:09,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:09,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:09,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:09,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:09,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:09,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:09,903 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:18:09,903 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:18:09,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,904 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:09,906 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:09,907 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:09,907 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:18:09,907 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:09,907 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = -2*n + 5 Supporting invariants [] [2023-10-12 17:18:09,923 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:09,925 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:09,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:09,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:09,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:09,981 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:09,982 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:09,983 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 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:10,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:10,127 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 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) Result 7 states and 308 transitions. [2023-10-12 17:18:10,127 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:10,147 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:10,147 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:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 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:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2023-10-12 17:18:10,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 151 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:18:10,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 151 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:18:10,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 151 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:18:10,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 3618 transitions, 34752 flow [2023-10-12 17:18:11,360 INFO L124 PetriNetUnfolderBase]: 3936/6238 cut-off events. [2023-10-12 17:18:11,361 INFO L125 PetriNetUnfolderBase]: For 3206/3206 co-relation queries the response was YES. [2023-10-12 17:18:11,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27106 conditions, 6238 events. 3936/6238 cut-off events. For 3206/3206 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 38850 event pairs, 111 based on Foata normal form. 0/4819 useless extension candidates. Maximal degree in co-relation 19440. Up to 3251 conditions per place. [2023-10-12 17:18:11,368 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 48 places, 3618 transitions, 34752 flow [2023-10-12 17:18:11,404 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 48 places, 3618 transitions, 34752 flow [2023-10-12 17:18:11,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:18:11,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:18:11,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:18:11,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 3618 transitions, 34752 flow. Second operand has 3 states, 2 states have (on average 2.5) 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,407 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:18:11,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:18:12,875 INFO L124 PetriNetUnfolderBase]: 3767/6069 cut-off events. [2023-10-12 17:18:12,875 INFO L125 PetriNetUnfolderBase]: For 3238/3238 co-relation queries the response was YES. [2023-10-12 17:18:12,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32500 conditions, 6069 events. 3767/6069 cut-off events. For 3238/3238 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 38201 event pairs, 109 based on Foata normal form. 0/4819 useless extension candidates. Maximal degree in co-relation 23155. Up to 3252 conditions per place. [2023-10-12 17:18:12,906 INFO L140 encePairwiseOnDemand]: 38/40 looper letters, 965 selfloop transitions, 75 changer transitions 333/1373 dead transitions. [2023-10-12 17:18:12,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 1373 transitions, 15935 flow [2023-10-12 17:18:12,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 1373 transitions, 15935 flow [2023-10-12 17:18:13,477 INFO L124 PetriNetUnfolderBase]: 3767/6069 cut-off events. [2023-10-12 17:18:13,477 INFO L125 PetriNetUnfolderBase]: For 3238/3238 co-relation queries the response was YES. [2023-10-12 17:18:13,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32500 conditions, 6069 events. 3767/6069 cut-off events. For 3238/3238 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 38115 event pairs, 109 based on Foata normal form. 0/4819 useless extension candidates. Maximal degree in co-relation 23155. Up to 3252 conditions per place. [2023-10-12 17:18:13,483 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 48 places, 1373 transitions, 15935 flow [2023-10-12 17:18:13,496 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 48 places, 1373 transitions, 15935 flow [2023-10-12 17:18:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:18:13,499 INFO L430 stractBuchiCegarLoop]: Abstraction has has 48 places, 1373 transitions, 15935 flow [2023-10-12 17:18:13,499 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:18:13,499 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 48 places, 1373 transitions, 15935 flow [2023-10-12 17:18:13,506 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:13,506 INFO L124 PetriNetUnfolderBase]: 14/36 cut-off events. [2023-10-12 17:18:13,506 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:18:13,506 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:13,507 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [86] $Ultimate##0-->L9: Formula: (and (= v_x_21 1) (= v_n_21 1)) InVars {} OutVars{n=v_n_21, x=v_x_21} AuxVars[] AssignedVars[n, x] 38#[L9]true [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 40#[L9-1, L20]true [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 42#[L20, L10, L29]true [74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 147#[L20, L37, L29, L11]true [2023-10-12 17:18:13,507 INFO L750 eck$LassoCheckResult]: Loop: 147#[L20, L37, L29, L11]true [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 150#[L20, L29, L11, L38]true [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 147#[L20, L37, L29, L11]true [2023-10-12 17:18:13,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:13,507 INFO L85 PathProgramCache]: Analyzing trace with hash 3553170, now seen corresponding path program 1 times [2023-10-12 17:18:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799676014] [2023-10-12 17:18:13,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:13,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:13,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:13,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:13,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:13,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2023-10-12 17:18:13,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:13,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846797631] [2023-10-12 17:18:13,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:13,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:13,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:13,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:13,532 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:13,532 INFO L85 PathProgramCache]: Analyzing trace with hash -880368908, now seen corresponding path program 1 times [2023-10-12 17:18:13,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:13,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202624337] [2023-10-12 17:18:13,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:13,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:13,562 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:13,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:13,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202624337] [2023-10-12 17:18:13,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202624337] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:13,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:13,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:18:13,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388269266] [2023-10-12 17:18:13,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:13,572 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:13,572 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:13,572 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:13,572 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:13,572 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:18:13,572 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:13,572 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:13,572 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:13,572 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:18:13,572 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:13,572 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:13,573 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:13,586 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:13,586 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:18:13,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:13,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:13,587 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:13,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:18:13,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:18:13,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:13,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:18:13,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:13,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:13,618 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:13,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:18:13,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:18:13,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:13,653 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:18:13,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:13,656 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:13,656 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:13,656 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:13,656 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:13,656 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:13,656 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:13,656 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:13,656 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:13,656 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:18:13,656 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:13,656 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:13,657 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:13,671 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:13,671 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:13,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:13,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:13,672 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:13,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:18:13,690 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:13,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:13,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:13,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:13,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:13,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:13,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:13,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:13,709 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:13,710 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:18:13,711 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:18:13,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:13,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:13,733 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:13,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:18:13,748 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:13,749 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:18:13,749 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:13,749 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = 1*n Supporting invariants [] [2023-10-12 17:18:13,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:13,752 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:13,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:13,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:13,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:13,772 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:13,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:13,779 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:13,779 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:13,779 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:13,896 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 9 states and 386 transitions. [2023-10-12 17:18:13,896 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:14,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:14,099 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:14,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:14,100 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:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 192 transitions. [2023-10-12 17:18:14,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 192 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:18:14,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:14,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 192 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:18:14,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:14,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 192 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:18:14,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:14,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 26676 transitions, 364212 flow [2023-10-12 17:19:08,478 INFO L124 PetriNetUnfolderBase]: 12088/19230 cut-off events. [2023-10-12 17:19:08,478 INFO L125 PetriNetUnfolderBase]: For 10056/10056 co-relation queries the response was YES. [2023-10-12 17:19:08,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122032 conditions, 19230 events. 12088/19230 cut-off events. For 10056/10056 co-relation queries the response was YES. Maximal size of possible extension queue 1375. Compared 142687 event pairs, 86 based on Foata normal form. 0/14037 useless extension candidates. Maximal degree in co-relation 84427. Up to 10458 conditions per place. [2023-10-12 17:19:08,496 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 66 places, 26676 transitions, 364212 flow [2023-10-12 17:19:08,833 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 66 places, 26676 transitions, 364212 flow [2023-10-12 17:19:08,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:19:08,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:19:08,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:19:08,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 26676 transitions, 364212 flow. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:19:08,834 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:19:08,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:20:11,474 INFO L124 PetriNetUnfolderBase]: 9544/15601 cut-off events. [2023-10-12 17:20:11,474 INFO L125 PetriNetUnfolderBase]: For 8672/8672 co-relation queries the response was YES. [2023-10-12 17:20:11,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115191 conditions, 15601 events. 9544/15601 cut-off events. For 8672/8672 co-relation queries the response was YES. Maximal size of possible extension queue 1132. Compared 116123 event pairs, 58 based on Foata normal form. 0/12060 useless extension candidates. Maximal degree in co-relation 80027. Up to 9753 conditions per place. [2023-10-12 17:20:11,555 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 3078 selfloop transitions, 195 changer transitions 1988/5261 dead transitions. [2023-10-12 17:20:11,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 5261 transitions, 81760 flow [2023-10-12 17:20:11,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 5261 transitions, 81760 flow [2023-10-12 17:20:17,983 INFO L124 PetriNetUnfolderBase]: 9544/15601 cut-off events. [2023-10-12 17:20:17,984 INFO L125 PetriNetUnfolderBase]: For 8672/8672 co-relation queries the response was YES. [2023-10-12 17:20:17,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115191 conditions, 15601 events. 9544/15601 cut-off events. For 8672/8672 co-relation queries the response was YES. Maximal size of possible extension queue 1132. Compared 116083 event pairs, 58 based on Foata normal form. 0/12060 useless extension candidates. Maximal degree in co-relation 80027. Up to 9753 conditions per place. [2023-10-12 17:20:17,995 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 68 places, 5261 transitions, 81760 flow [2023-10-12 17:20:18,071 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 68 places, 5261 transitions, 81760 flow [2023-10-12 17:20:18,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:20:18,073 INFO L430 stractBuchiCegarLoop]: Abstraction has has 68 places, 5261 transitions, 81760 flow [2023-10-12 17:20:18,073 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:20:18,073 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 68 places, 5261 transitions, 81760 flow [2023-10-12 17:20:23,370 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:20:23,370 INFO L124 PetriNetUnfolderBase]: 7994/12833 cut-off events. [2023-10-12 17:20:23,370 INFO L125 PetriNetUnfolderBase]: For 7133/7133 co-relation queries the response was YES. [2023-10-12 17:20:23,370 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:20:23,371 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [86] $Ultimate##0-->L9: Formula: (and (= v_x_21 1) (= v_n_21 1)) InVars {} OutVars{n=v_n_21, x=v_x_21} AuxVars[] AssignedVars[n, x] 38#[L9]true [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 40#[L9-1, L20]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 92#[L9-1, L22]true [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 212#[L10, L22, L29]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 42#[L20, L10, L29]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 42#[L20, L10, L29]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 212#[L10, L22, L29]true [74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 217#[L37, L22, L29, L11]true [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 219#[L22, L29, L11, L38]true [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 217#[L37, L22, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 217#[L37, L22, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 147#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 217#[L37, L22, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 147#[L20, L37, L29, L11]true [2023-10-12 17:20:23,371 INFO L750 eck$LassoCheckResult]: Loop: 147#[L20, L37, L29, L11]true [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 150#[L20, L29, L11, L38]true [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 147#[L20, L37, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 147#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 217#[L37, L22, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 217#[L37, L22, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 147#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 217#[L37, L22, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 147#[L20, L37, L29, L11]true [2023-10-12 17:20:23,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:20:23,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1773615492, now seen corresponding path program 1 times [2023-10-12 17:20:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:20:23,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014672254] [2023-10-12 17:20:23,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:20:23,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:20:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:20:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:20:23,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:20:23,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014672254] [2023-10-12 17:20:23,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014672254] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:20:23,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505161659] [2023-10-12 17:20:23,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:20:23,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:20:23,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:20:23,402 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:20:23,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-10-12 17:20:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:20:23,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:20:23,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:20:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:20:23,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:20:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:20:23,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505161659] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:20:23,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:20:23,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-10-12 17:20:23,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91487480] [2023-10-12 17:20:23,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:20:23,479 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:20:23,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:20:23,479 INFO L85 PathProgramCache]: Analyzing trace with hash 802813955, now seen corresponding path program 1 times [2023-10-12 17:20:23,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:20:23,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647692071] [2023-10-12 17:20:23,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:20:23,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:20:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:20:23,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:20:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:20:23,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:20:23,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:20:23,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:20:23,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:20:23,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 5261 transitions, 81760 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:20:23,537 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:20:23,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:20:30,807 INFO L124 PetriNetUnfolderBase]: 8589/14187 cut-off events. [2023-10-12 17:20:30,808 INFO L125 PetriNetUnfolderBase]: For 7961/7961 co-relation queries the response was YES. [2023-10-12 17:20:30,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118991 conditions, 14187 events. 8589/14187 cut-off events. For 7961/7961 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 100531 event pairs, 34 based on Foata normal form. 0/11276 useless extension candidates. Maximal degree in co-relation 88320. Up to 10765 conditions per place. [2023-10-12 17:20:30,870 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 2734 selfloop transitions, 206 changer transitions 2012/4952 dead transitions. [2023-10-12 17:20:30,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 4952 transitions, 86669 flow [2023-10-12 17:20:30,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 4952 transitions, 86669 flow [2023-10-12 17:20:37,281 INFO L124 PetriNetUnfolderBase]: 8589/14187 cut-off events. [2023-10-12 17:20:37,281 INFO L125 PetriNetUnfolderBase]: For 7961/7961 co-relation queries the response was YES. [2023-10-12 17:20:37,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118991 conditions, 14187 events. 8589/14187 cut-off events. For 7961/7961 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 100531 event pairs, 34 based on Foata normal form. 0/11276 useless extension candidates. Maximal degree in co-relation 88320. Up to 10765 conditions per place. [2023-10-12 17:20:37,294 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 71 places, 4952 transitions, 86669 flow [2023-10-12 17:20:37,352 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 71 places, 4952 transitions, 86669 flow [2023-10-12 17:20:37,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:20:37,353 INFO L430 stractBuchiCegarLoop]: Abstraction has has 71 places, 4952 transitions, 86669 flow [2023-10-12 17:20:37,353 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:20:37,353 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 71 places, 4952 transitions, 86669 flow [2023-10-12 17:20:43,224 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:20:43,224 INFO L124 PetriNetUnfolderBase]: 8252/13628 cut-off events. [2023-10-12 17:20:43,224 INFO L125 PetriNetUnfolderBase]: For 7636/7636 co-relation queries the response was YES. [2023-10-12 17:20:43,224 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:20:43,224 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [86] $Ultimate##0-->L9: Formula: (and (= v_x_21 1) (= v_n_21 1)) InVars {} OutVars{n=v_n_21, x=v_x_21} AuxVars[] AssignedVars[n, x] 38#[L9]true [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 40#[L9-1, L20]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 92#[L9-1, L22]true [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 212#[L10, L22, L29]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 212#[L10, L22, L29]true [74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 217#[L37, L22, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 147#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 217#[L37, L22, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 217#[L37, L22, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 147#[L20, L37, L29, L11]true [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 150#[L20, L29, L11, L38]true [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 147#[L20, L37, L29, L11]true [2023-10-12 17:20:43,225 INFO L750 eck$LassoCheckResult]: Loop: 147#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 217#[L37, L22, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 217#[L37, L22, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 147#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 217#[L37, L22, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 217#[L37, L22, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 147#[L20, L37, L29, L11]true [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 150#[L20, L29, L11, L38]true [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 147#[L20, L37, L29, L11]true [2023-10-12 17:20:43,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:20:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash 440303280, now seen corresponding path program 2 times [2023-10-12 17:20:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:20:43,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72307318] [2023-10-12 17:20:43,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:20:43,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:20:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:20:43,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:20:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:20:43,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:20:43,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:20:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash -600945981, now seen corresponding path program 2 times [2023-10-12 17:20:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:20:43,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569644177] [2023-10-12 17:20:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:20:43,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:20:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:20:43,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:20:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:20:43,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:20:43,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:20:43,238 INFO L85 PathProgramCache]: Analyzing trace with hash -506025358, now seen corresponding path program 3 times [2023-10-12 17:20:43,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:20:43,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023982244] [2023-10-12 17:20:43,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:20:43,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:20:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:20:43,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:20:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:20:43,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:20:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:20:43,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:20:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:20:43,359 INFO L201 PluginConnector]: Adding new model Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:20:43 BoogieIcfgContainer [2023-10-12 17:20:43,359 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:20:43,360 INFO L158 Benchmark]: Toolchain (without parser) took 155616.14ms. Allocated memory was 218.1MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 172.2MB in the beginning and 387.2MB in the end (delta: -215.0MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2023-10-12 17:20:43,360 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.64ms. Allocated memory is still 218.1MB. Free memory was 173.2MB in the beginning and 173.0MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:20:43,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.92ms. Allocated memory is still 218.1MB. Free memory was 172.1MB in the beginning and 170.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:20:43,361 INFO L158 Benchmark]: Boogie Preprocessor took 15.83ms. Allocated memory is still 218.1MB. Free memory was 170.5MB in the beginning and 169.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:20:43,361 INFO L158 Benchmark]: RCFGBuilder took 257.34ms. Allocated memory is still 218.1MB. Free memory was 169.5MB in the beginning and 160.4MB in the end (delta: 9.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:20:43,361 INFO L158 Benchmark]: BuchiAutomizer took 155316.81ms. Allocated memory was 218.1MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 160.3MB in the beginning and 387.2MB in the end (delta: -227.0MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2023-10-12 17:20:43,362 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.64ms. Allocated memory is still 218.1MB. Free memory was 173.2MB in the beginning and 173.0MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.92ms. Allocated memory is still 218.1MB. Free memory was 172.1MB in the beginning and 170.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.83ms. Allocated memory is still 218.1MB. Free memory was 170.5MB in the beginning and 169.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 257.34ms. Allocated memory is still 218.1MB. Free memory was 169.5MB in the beginning and 160.4MB in the end (delta: 9.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 155316.81ms. Allocated memory was 218.1MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 160.3MB in the beginning and 387.2MB in the end (delta: -227.0MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function x and consists of 3 locations. One deterministic module has affine ranking function 5 + -2 * n and consists of 4 locations. One deterministic module has affine ranking function n and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 86669 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 155.2s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 1.5s. Construction of modules took 0.3s. Büchi inclusion checks took 85.7s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 425 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 422 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 541 IncrementalHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 170 mSDtfsCounter, 541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT3 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp87 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq186 hnf89 smp100 dnf100 smp100 tf113 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 238ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 20]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; [L7] 0 n := 1; VAL [n=1, x=1] [L9] FORK 0 fork 1 one(); VAL [n=1, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=1, x=2] [L10] FORK 0 fork 2 two(); VAL [n=1, x=2] [L29] COND TRUE 2 x == 2 [L30] 2 x := 1; VAL [n=1, x=1] [L11] FORK 0 fork 3 three(); VAL [n=1, x=1] [L22] 1 n := n + 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=2, x=2] [L29] COND TRUE 2 x == 2 [L30] 2 x := 1; VAL [n=2, x=1] [L22] 1 n := n + 1; VAL [n=3, x=1] [L37] COND TRUE 3 n == 3 VAL [n=3, x=1] [L38] 3 n := 1; VAL [n=1, x=1] Loop: [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L29] COND TRUE x == 2 [L30] x := 1; [L22] n := n + 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L29] COND TRUE x == 2 [L30] x := 1; [L22] n := n + 1; [L37] COND TRUE n == 3 [L38] n := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 20]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; [L7] 0 n := 1; VAL [n=1, x=1] [L9] FORK 0 fork 1 one(); VAL [n=1, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=1, x=2] [L10] FORK 0 fork 2 two(); VAL [n=1, x=2] [L29] COND TRUE 2 x == 2 [L30] 2 x := 1; VAL [n=1, x=1] [L11] FORK 0 fork 3 three(); VAL [n=1, x=1] [L22] 1 n := n + 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=2, x=2] [L29] COND TRUE 2 x == 2 [L30] 2 x := 1; VAL [n=2, x=1] [L22] 1 n := n + 1; VAL [n=3, x=1] [L37] COND TRUE 3 n == 3 VAL [n=3, x=1] [L38] 3 n := 1; VAL [n=1, x=1] Loop: [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L29] COND TRUE x == 2 [L30] x := 1; [L22] n := n + 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L29] COND TRUE x == 2 [L30] x := 1; [L22] n := n + 1; [L37] COND TRUE n == 3 [L38] n := 1; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 23 PlacesAfterwards, 28 TransitionsBefore, 22 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 382 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 293, independent: 275, independent conditional: 0, independent unconditional: 275, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 150, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 150, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 293, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 150, unknown conditional: 0, unknown unconditional: 150] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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:20:43,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:20:43,584 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...