/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_AUTOMATON -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:12:08,802 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:12:08,840 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:12:08,854 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:12:08,854 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:12:08,854 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:12:08,855 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:12:08,856 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:12:08,856 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:12:08,856 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:12:08,857 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:12:08,858 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:12:08,858 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:12:08,858 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:12:08,858 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:12:08,859 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:12:08,859 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:12:08,859 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:12:08,859 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:12:08,860 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:12:08,860 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:12:08,862 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:12:08,863 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:12:08,863 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:12:08,863 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:12:08,863 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:12:08,863 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:12:08,864 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:12:08,864 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:12:08,864 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:12:08,864 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:12:08,864 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:12:08,865 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:12:08,865 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:12:08,866 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_AUTOMATON [2023-10-12 17:12:09,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:12:09,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:12:09,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:12:09,043 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:12:09,043 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:12:09,044 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:12:09,045 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl' [2023-10-12 17:12:09,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:12:09,065 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:12:09,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:09,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:12:09,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:12:09,078 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:12:09" (1/1) ... [2023-10-12 17:12:09,084 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:12:09" (1/1) ... [2023-10-12 17:12:09,091 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:12:09,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:09,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:12:09,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:12:09,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:12:09,101 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:12:09" (1/1) ... [2023-10-12 17:12:09,101 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:12:09" (1/1) ... [2023-10-12 17:12:09,103 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:12:09" (1/1) ... [2023-10-12 17:12:09,103 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:12:09" (1/1) ... [2023-10-12 17:12:09,105 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:12:09" (1/1) ... [2023-10-12 17:12:09,108 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:12:09" (1/1) ... [2023-10-12 17:12:09,109 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:12:09" (1/1) ... [2023-10-12 17:12:09,110 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:12:09" (1/1) ... [2023-10-12 17:12:09,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:12:09,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:12:09,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:12:09,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:12:09,113 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:12:09" (1/1) ... [2023-10-12 17:12:09,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:09,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:09,342 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:12:09,358 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:12:09,392 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2023-10-12 17:12:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure one [2023-10-12 17:12:09,393 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2023-10-12 17:12:09,393 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:12:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:12:09,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:12:09,393 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2023-10-12 17:12:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure three [2023-10-12 17:12:09,394 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2023-10-12 17:12:09,394 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2023-10-12 17:12:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure two [2023-10-12 17:12:09,394 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2023-10-12 17:12:09,394 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:12:09,427 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:12:09,429 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:12:09,557 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:12:09,562 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:12:09,562 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:12:09,563 INFO L201 PluginConnector]: Adding new model Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:09 BoogieIcfgContainer [2023-10-12 17:12:09,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:12:09,564 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:12:09,564 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:12:09,572 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:12:09,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:09,573 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:12:09" (1/2) ... [2023-10-12 17:12:09,575 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@188c7e11 and model type Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:12:09, skipping insertion in model container [2023-10-12 17:12:09,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:09,576 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:12:09" (2/2) ... [2023-10-12 17:12:09,577 INFO L332 chiAutomizerObserver]: Analyzing ICFG Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl [2023-10-12 17:12:09,655 INFO L144 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2023-10-12 17:12:09,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 34 transitions, 110 flow [2023-10-12 17:12:09,722 INFO L124 PetriNetUnfolderBase]: 8/31 cut-off events. [2023-10-12 17:12:09,722 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:12:09,725 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:12:09,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 34 transitions, 110 flow [2023-10-12 17:12:09,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 28 transitions, 92 flow [2023-10-12 17:12:09,731 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:09,751 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 92 flow [2023-10-12 17:12:09,756 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 92 flow [2023-10-12 17:12:09,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 92 flow [2023-10-12 17:12:09,763 INFO L124 PetriNetUnfolderBase]: 8/31 cut-off events. [2023-10-12 17:12:09,763 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:12:09,763 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:12:09,764 INFO L119 LiptonReduction]: Number of co-enabled transitions 244 [2023-10-12 17:12:09,865 INFO L134 LiptonReduction]: Checked pairs total: 382 [2023-10-12 17:12:09,865 INFO L136 LiptonReduction]: Total number of compositions: 6 [2023-10-12 17:12:09,877 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:09,877 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:09,877 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:09,877 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:09,877 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:09,877 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:09,877 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:09,877 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:09,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:09,910 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 47 [2023-10-12 17:12:09,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:09,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:09,913 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:09,913 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:09,913 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:09,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 59 states, but on-demand construction may add more states [2023-10-12 17:12:09,917 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 47 [2023-10-12 17:12:09,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:09,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:09,917 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:09,917 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:09,921 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]don't care [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]don't care [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 40#[L20, L9-1]don't care [2023-10-12 17:12:09,921 INFO L750 eck$LassoCheckResult]: Loop: 40#[L20, L9-1]don't care [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] 44#[L22, L9-1]don't care [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#[L20, L9-1]don't care [2023-10-12 17:12:09,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:09,924 INFO L85 PathProgramCache]: Analyzing trace with hash 3695, now seen corresponding path program 1 times [2023-10-12 17:12:09,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:09,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603427144] [2023-10-12 17:12:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:09,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:09,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:09,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:09,990 INFO L85 PathProgramCache]: Analyzing trace with hash 3653, now seen corresponding path program 1 times [2023-10-12 17:12:09,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:09,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923217075] [2023-10-12 17:12:09,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:09,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:09,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:09,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash 3553587, now seen corresponding path program 1 times [2023-10-12 17:12:10,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241312154] [2023-10-12 17:12:10,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,076 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:10,083 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:10,083 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:10,083 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:10,083 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:10,083 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,083 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:10,084 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:10,084 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:12:10,084 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:10,084 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:10,101 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:12:10,110 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:12:10,151 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:10,152 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:10,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,224 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:12:10,225 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:12:10,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:10,227 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:10,238 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:12:10,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,239 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:12:10,240 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:12:10,243 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:10,243 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:10,279 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:10,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:10,325 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:10,325 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:10,325 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:10,325 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:10,325 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:10,325 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,325 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:10,325 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:10,325 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:12:10,325 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:10,325 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:10,326 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:12:10,345 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:12:10,398 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:10,407 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:10,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,423 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:12:10,431 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:12:10,451 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:12:10,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:10,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:10,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:10,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:10,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:10,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:10,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:10,489 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:10,493 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:10,493 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:10,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,496 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:12:10,549 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:12:10,549 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:10,550 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:10,552 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:10,553 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2023-10-12 17:12:10,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:10,573 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:10,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:10,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:10,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:10,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:10,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:10,639 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:12:10,680 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:12:10,682 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:12:10,684 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 59 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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:12:10,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 59 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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 220 states and 654 transitions. Complement of second has 5 states. [2023-10-12 17:12:10,747 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:12:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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:12:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2023-10-12 17:12:10,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 34 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:12:10,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:10,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:12:10,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:10,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 34 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:12:10,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:10,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 654 transitions. [2023-10-12 17:12:10,763 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 69 [2023-10-12 17:12:10,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 146 states and 439 transitions. [2023-10-12 17:12:10,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2023-10-12 17:12:10,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2023-10-12 17:12:10,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 439 transitions. [2023-10-12 17:12:10,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:10,773 INFO L219 hiAutomatonCegarLoop]: Abstraction has 146 states and 439 transitions. [2023-10-12 17:12:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 439 transitions. [2023-10-12 17:12:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2023-10-12 17:12:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 3.087378640776699) internal successors, (318), 102 states have internal predecessors, (318), 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:12:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 318 transitions. [2023-10-12 17:12:10,799 INFO L241 hiAutomatonCegarLoop]: Abstraction has 103 states and 318 transitions. [2023-10-12 17:12:10,799 INFO L430 stractBuchiCegarLoop]: Abstraction has 103 states and 318 transitions. [2023-10-12 17:12:10,799 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:10,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 318 transitions. [2023-10-12 17:12:10,801 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 57 [2023-10-12 17:12:10,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:10,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:10,801 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:12:10,801 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:10,802 INFO L748 eck$LassoCheckResult]: Stem: 552#[$Ultimate##0]don't care [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] 536#[L9]don't care [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 538#[L20, L9-1]don't care [84] L20-->oneEXIT: Formula: (or (<= 4 v_n_12) (not (= v_x_10 1))) InVars {n=v_n_12, x=v_x_10} OutVars{n=v_n_12, x=v_x_10} AuxVars[] AssignedVars[] 534#[oneEXIT, L9-1]don't care [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 464#[oneEXIT, L10, L29]don't care [2023-10-12 17:12:10,802 INFO L750 eck$LassoCheckResult]: Loop: 464#[oneEXIT, L10, L29]don't care [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] 464#[oneEXIT, L10, L29]don't care [2023-10-12 17:12:10,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 3553570, now seen corresponding path program 1 times [2023-10-12 17:12:10,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129832615] [2023-10-12 17:12:10,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:10,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:10,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129832615] [2023-10-12 17:12:10,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129832615] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:10,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:10,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:12:10,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110074347] [2023-10-12 17:12:10,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:10,840 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:10,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:10,841 INFO L85 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 1 times [2023-10-12 17:12:10,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:10,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879875587] [2023-10-12 17:12:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:10,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:10,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:10,857 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:10,857 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:10,857 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:10,857 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:10,857 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:10,857 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,857 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:10,857 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:10,857 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:12:10,857 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:10,857 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:10,858 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:12:10,873 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:10,873 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:10,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,875 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:12:10,877 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:12:10,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:10,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:10,903 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:12:10,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,905 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:12:10,920 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:12:10,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:10,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:10,933 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:10,937 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:12:10,938 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:10,938 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:10,938 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:10,938 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:10,938 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:10,938 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,938 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:10,938 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:10,938 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:12:10,939 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:10,939 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:10,939 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:12:10,959 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:10,960 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:10,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:10,962 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:12:10,964 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:12:10,966 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:12:10,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:10,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:10,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:10,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:10,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:10,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:10,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:10,988 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:10,991 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:10,991 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:12:10,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:10,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,005 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:12:11,038 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:11,038 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:11,038 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:11,038 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2023-10-12 17:12:11,049 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:12:11,049 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:12:11,050 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:11,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,085 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,085 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:12:11,086 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:12:11,086 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 103 states and 318 transitions. cyclomatic complexity: 251 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,123 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 103 states and 318 transitions. cyclomatic complexity: 251. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 330 states and 1000 transitions. Complement of second has 5 states. [2023-10-12 17:12:11,123 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:12:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2023-10-12 17:12:11,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:11,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:12:11,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:12:11,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 330 states and 1000 transitions. [2023-10-12 17:12:11,130 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 93 [2023-10-12 17:12:11,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 330 states to 254 states and 780 transitions. [2023-10-12 17:12:11,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2023-10-12 17:12:11,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2023-10-12 17:12:11,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 780 transitions. [2023-10-12 17:12:11,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,135 INFO L219 hiAutomatonCegarLoop]: Abstraction has 254 states and 780 transitions. [2023-10-12 17:12:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 780 transitions. [2023-10-12 17:12:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 153. [2023-10-12 17:12:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 153 states have (on average 3.326797385620915) internal successors, (509), 152 states have internal predecessors, (509), 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:12:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 509 transitions. [2023-10-12 17:12:11,150 INFO L241 hiAutomatonCegarLoop]: Abstraction has 153 states and 509 transitions. [2023-10-12 17:12:11,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:11,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:11,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:11,152 INFO L87 Difference]: Start difference. First operand 153 states and 509 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) 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:12:11,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:11,182 INFO L93 Difference]: Finished difference Result 168 states and 530 transitions. [2023-10-12 17:12:11,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 530 transitions. [2023-10-12 17:12:11,184 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 69 [2023-10-12 17:12:11,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 160 states and 521 transitions. [2023-10-12 17:12:11,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2023-10-12 17:12:11,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2023-10-12 17:12:11,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 521 transitions. [2023-10-12 17:12:11,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,187 INFO L219 hiAutomatonCegarLoop]: Abstraction has 160 states and 521 transitions. [2023-10-12 17:12:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 521 transitions. [2023-10-12 17:12:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2023-10-12 17:12:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 158 states have (on average 3.278481012658228) internal successors, (518), 157 states have internal predecessors, (518), 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:12:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 518 transitions. [2023-10-12 17:12:11,194 INFO L241 hiAutomatonCegarLoop]: Abstraction has 158 states and 518 transitions. [2023-10-12 17:12:11,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:11,195 INFO L430 stractBuchiCegarLoop]: Abstraction has 158 states and 518 transitions. [2023-10-12 17:12:11,195 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:12:11,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 518 transitions. [2023-10-12 17:12:11,197 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 69 [2023-10-12 17:12:11,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:11,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:11,197 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:12:11,197 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:12:11,198 INFO L748 eck$LassoCheckResult]: Stem: 1611#[$Ultimate##0]don't care [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] 1595#[L9]don't care [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 1597#[L20, L9-1]don't care [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] 1663#[L22, L9-1]don't care [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 1669#[L10, L22, L29]don't care [74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 1573#[L11, L22, L29, L37]don't care [2023-10-12 17:12:11,198 INFO L750 eck$LassoCheckResult]: Loop: 1573#[L11, L22, L29, L37]don't care [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 1575#[L38, L11, L22, L29]don't care [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 1573#[L11, L22, L29, L37]don't care [2023-10-12 17:12:11,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash 110161705, now seen corresponding path program 1 times [2023-10-12 17:12:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91173252] [2023-10-12 17:12:11,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:11,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2023-10-12 17:12:11,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576586759] [2023-10-12 17:12:11,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:11,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1508781877, now seen corresponding path program 1 times [2023-10-12 17:12:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519984000] [2023-10-12 17:12:11,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,228 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:12:11,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:11,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519984000] [2023-10-12 17:12:11,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519984000] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:11,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:11,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:12:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287960012] [2023-10-12 17:12:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:11,238 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:11,238 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:11,238 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:11,238 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:11,239 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:11,239 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,239 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:11,239 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:11,239 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:12:11,239 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:11,239 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:11,239 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:11,253 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:11,253 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:11,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,259 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:12:11,260 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:12:11,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:11,263 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:11,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:11,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,279 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:12:11,281 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:12:11,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:11,283 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:11,302 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:11,323 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:12:11,323 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:11,323 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:11,323 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:11,323 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:11,323 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:11,324 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,324 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:11,324 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:11,324 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:12:11,324 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:11,324 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:11,325 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:12:11,341 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:11,341 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:11,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,365 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:12:11,367 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:12:11,368 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:12:11,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:11,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:11,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:11,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:11,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:11,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:11,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:11,401 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:11,404 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:11,404 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:12:11,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,407 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:12:11,408 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:12:11,409 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:11,410 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:11,410 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:11,410 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = 1*n Supporting invariants [] [2023-10-12 17:12:11,415 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:12:11,415 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:11,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,439 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,454 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:12:11,455 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:12:11,455 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 158 states and 518 transitions. cyclomatic complexity: 413 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,540 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 158 states and 518 transitions. cyclomatic complexity: 413. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 567 states and 1860 transitions. Complement of second has 9 states. [2023-10-12 17:12:11,540 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:12:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2023-10-12 17:12:11,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:12:11,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:12:11,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:12:11,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 567 states and 1860 transitions. [2023-10-12 17:12:11,547 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 88 [2023-10-12 17:12:11,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 567 states to 375 states and 1217 transitions. [2023-10-12 17:12:11,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2023-10-12 17:12:11,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2023-10-12 17:12:11,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 375 states and 1217 transitions. [2023-10-12 17:12:11,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,555 INFO L219 hiAutomatonCegarLoop]: Abstraction has 375 states and 1217 transitions. [2023-10-12 17:12:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states and 1217 transitions. [2023-10-12 17:12:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 277. [2023-10-12 17:12:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 277 states have (on average 3.4296028880866425) internal successors, (950), 276 states have internal predecessors, (950), 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:12:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 950 transitions. [2023-10-12 17:12:11,579 INFO L241 hiAutomatonCegarLoop]: Abstraction has 277 states and 950 transitions. [2023-10-12 17:12:11,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:11,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:11,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:11,583 INFO L87 Difference]: Start difference. First operand 277 states and 950 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:11,615 INFO L93 Difference]: Finished difference Result 416 states and 1292 transitions. [2023-10-12 17:12:11,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 416 states and 1292 transitions. [2023-10-12 17:12:11,637 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 70 [2023-10-12 17:12:11,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 416 states to 267 states and 850 transitions. [2023-10-12 17:12:11,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2023-10-12 17:12:11,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2023-10-12 17:12:11,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 850 transitions. [2023-10-12 17:12:11,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,639 INFO L219 hiAutomatonCegarLoop]: Abstraction has 267 states and 850 transitions. [2023-10-12 17:12:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states and 850 transitions. [2023-10-12 17:12:11,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 199. [2023-10-12 17:12:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 199 states have (on average 3.3115577889447234) internal successors, (659), 198 states have internal predecessors, (659), 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:12:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 659 transitions. [2023-10-12 17:12:11,648 INFO L241 hiAutomatonCegarLoop]: Abstraction has 199 states and 659 transitions. [2023-10-12 17:12:11,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:12:11,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:11,659 INFO L430 stractBuchiCegarLoop]: Abstraction has 199 states and 659 transitions. [2023-10-12 17:12:11,659 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:12:11,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 659 transitions. [2023-10-12 17:12:11,660 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 58 [2023-10-12 17:12:11,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:11,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:11,661 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:12:11,661 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:11,661 INFO L748 eck$LassoCheckResult]: Stem: 3539#[$Ultimate##0]don't care [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] 3519#[L9]don't care [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 3521#[L20, L9-1]don't care [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 3443#[L20, L10, L29]don't care [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] 3445#[L10, L22, L29]don't care [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] 3647#[L10, L22, L29]don't care [2023-10-12 17:12:11,661 INFO L750 eck$LassoCheckResult]: Loop: 3647#[L10, L22, L29]don't care [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] 3647#[L10, L22, L29]don't care [2023-10-12 17:12:11,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,662 INFO L85 PathProgramCache]: Analyzing trace with hash 110148700, now seen corresponding path program 1 times [2023-10-12 17:12:11,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560301744] [2023-10-12 17:12:11,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:12:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:11,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 2 times [2023-10-12 17:12:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849074051] [2023-10-12 17:12:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:11,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:11,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,688 INFO L85 PathProgramCache]: Analyzing trace with hash -880357507, now seen corresponding path program 2 times [2023-10-12 17:12:11,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:11,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36941281] [2023-10-12 17:12:11,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:11,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,722 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:12:11,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:11,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36941281] [2023-10-12 17:12:11,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36941281] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:11,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:11,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:12:11,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060518400] [2023-10-12 17:12:11,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:11,737 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:11,737 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:11,737 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:11,737 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:11,737 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:11,737 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,737 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:11,737 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:11,737 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration4_Loop [2023-10-12 17:12:11,737 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:11,737 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:11,738 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:12:11,756 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:11,756 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:11,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,757 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:11,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:12:11,762 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:11,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:11,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:11,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,784 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:11,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:12:11,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:11,788 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:11,810 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:11,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:11,829 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:11,829 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:11,829 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:11,829 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:11,829 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:11,829 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,829 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:11,829 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:11,830 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration4_Loop [2023-10-12 17:12:11,830 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:11,830 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:11,830 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:12:11,846 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:11,846 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:11,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,848 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:11,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:12:11,852 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:12:11,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:11,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:11,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:11,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:11,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:11,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:11,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:11,868 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:11,870 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:11,870 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:12:11,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:11,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:11,876 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:11,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:12:11,879 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:11,879 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:11,879 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:11,879 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2023-10-12 17:12:11,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:11,887 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:11,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:11,918 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:11,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:11,918 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:12:11,919 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:12:11,920 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 199 states and 659 transitions. cyclomatic complexity: 527 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,957 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 199 states and 659 transitions. cyclomatic complexity: 527. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 613 states and 2059 transitions. Complement of second has 5 states. [2023-10-12 17:12:11,958 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:12:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2023-10-12 17:12:11,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:12:11,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:12:11,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:12:11,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:11,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 613 states and 2059 transitions. [2023-10-12 17:12:11,965 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 57 [2023-10-12 17:12:11,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 613 states to 376 states and 1264 transitions. [2023-10-12 17:12:11,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2023-10-12 17:12:11,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2023-10-12 17:12:11,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 376 states and 1264 transitions. [2023-10-12 17:12:11,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:11,969 INFO L219 hiAutomatonCegarLoop]: Abstraction has 376 states and 1264 transitions. [2023-10-12 17:12:11,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states and 1264 transitions. [2023-10-12 17:12:11,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 243. [2023-10-12 17:12:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 243 states have (on average 3.5637860082304527) internal successors, (866), 242 states have internal predecessors, (866), 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:12:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 866 transitions. [2023-10-12 17:12:11,975 INFO L241 hiAutomatonCegarLoop]: Abstraction has 243 states and 866 transitions. [2023-10-12 17:12:11,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:11,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:11,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:11,976 INFO L87 Difference]: Start difference. First operand 243 states and 866 transitions. Second operand has 3 states, 2 states have (on average 3.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:12:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:12,003 INFO L93 Difference]: Finished difference Result 332 states and 999 transitions. [2023-10-12 17:12:12,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 999 transitions. [2023-10-12 17:12:12,006 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 54 [2023-10-12 17:12:12,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 267 states and 789 transitions. [2023-10-12 17:12:12,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2023-10-12 17:12:12,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2023-10-12 17:12:12,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 789 transitions. [2023-10-12 17:12:12,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:12,008 INFO L219 hiAutomatonCegarLoop]: Abstraction has 267 states and 789 transitions. [2023-10-12 17:12:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states and 789 transitions. [2023-10-12 17:12:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 163. [2023-10-12 17:12:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 163 states have (on average 3.0920245398773005) internal successors, (504), 162 states have internal predecessors, (504), 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:12:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 504 transitions. [2023-10-12 17:12:12,013 INFO L241 hiAutomatonCegarLoop]: Abstraction has 163 states and 504 transitions. [2023-10-12 17:12:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:12,013 INFO L430 stractBuchiCegarLoop]: Abstraction has 163 states and 504 transitions. [2023-10-12 17:12:12,014 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:12:12,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 504 transitions. [2023-10-12 17:12:12,015 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 54 [2023-10-12 17:12:12,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:12,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:12,015 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:12:12,015 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-10-12 17:12:12,015 INFO L748 eck$LassoCheckResult]: Stem: 5388#[$Ultimate##0]don't care [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] 5374#[L9]don't care [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 5376#[L20, L9-1]don't care [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] 5338#[L22, L9-1]don't care [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 5342#[L10, L22, L29]don't care [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 5332#[L20, L10, L29]don't care [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] 5252#[L20, L10, L29]don't care [2023-10-12 17:12:12,015 INFO L750 eck$LassoCheckResult]: Loop: 5252#[L20, L10, L29]don't care [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] 5464#[L10, L22, L29]don't care [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] 5434#[L10, L22, L29]don't care [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 5252#[L20, L10, L29]don't care [2023-10-12 17:12:12,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash -879954879, now seen corresponding path program 1 times [2023-10-12 17:12:12,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714110968] [2023-10-12 17:12:12,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,023 INFO L85 PathProgramCache]: Analyzing trace with hash 114292, now seen corresponding path program 1 times [2023-10-12 17:12:12,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612280894] [2023-10-12 17:12:12,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1744658996, now seen corresponding path program 2 times [2023-10-12 17:12:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955590674] [2023-10-12 17:12:12,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,052 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:12,053 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:12,053 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:12,053 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:12,053 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:12,053 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,053 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:12,053 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:12,053 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration5_Loop [2023-10-12 17:12:12,053 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:12,053 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:12,054 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:12:12,058 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:12:12,079 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:12,079 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:12,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,094 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:12,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:12:12,111 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:12,112 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:12,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:12,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,137 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:12,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:12:12,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:12,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:12,162 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:12,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:12,167 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:12,167 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:12,167 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:12,168 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:12,168 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:12,168 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,168 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:12,168 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:12,168 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration5_Loop [2023-10-12 17:12:12,168 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:12,168 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:12,168 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:12:12,186 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:12:12,224 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:12,224 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:12,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,227 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:12,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:12:12,242 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:12:12,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:12,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:12,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:12,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:12,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:12,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:12,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:12,262 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:12,264 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:12,264 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:12,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,266 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:12,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:12:12,269 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:12,269 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:12,269 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:12,269 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = -2*n + 7 Supporting invariants [] [2023-10-12 17:12:12,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:12,275 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:12,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:12,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:12,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:12,343 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:12:12,343 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:12:12,343 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 504 transitions. cyclomatic complexity: 365 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:12:12,387 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 504 transitions. cyclomatic complexity: 365. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 490 states and 1498 transitions. Complement of second has 7 states. [2023-10-12 17:12:12,388 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:12:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:12:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2023-10-12 17:12:12,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 6 letters. Loop has 3 letters. [2023-10-12 17:12:12,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:12,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 9 letters. Loop has 3 letters. [2023-10-12 17:12:12,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:12,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 6 letters. Loop has 6 letters. [2023-10-12 17:12:12,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:12,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 490 states and 1498 transitions. [2023-10-12 17:12:12,394 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 40 [2023-10-12 17:12:12,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 490 states to 347 states and 974 transitions. [2023-10-12 17:12:12,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2023-10-12 17:12:12,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2023-10-12 17:12:12,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 347 states and 974 transitions. [2023-10-12 17:12:12,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:12,397 INFO L219 hiAutomatonCegarLoop]: Abstraction has 347 states and 974 transitions. [2023-10-12 17:12:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states and 974 transitions. [2023-10-12 17:12:12,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 192. [2023-10-12 17:12:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 192 states have (on average 3.0260416666666665) internal successors, (581), 191 states have internal predecessors, (581), 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:12:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 581 transitions. [2023-10-12 17:12:12,402 INFO L241 hiAutomatonCegarLoop]: Abstraction has 192 states and 581 transitions. [2023-10-12 17:12:12,402 INFO L430 stractBuchiCegarLoop]: Abstraction has 192 states and 581 transitions. [2023-10-12 17:12:12,402 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:12:12,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 192 states and 581 transitions. [2023-10-12 17:12:12,403 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 40 [2023-10-12 17:12:12,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:12,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:12,403 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:12,403 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-10-12 17:12:12,404 INFO L748 eck$LassoCheckResult]: Stem: 6246#[$Ultimate##0]don't care [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] 6226#[L9]don't care [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 6228#[L20, L9-1]don't care [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] 6198#[L22, L9-1]don't care [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 6110#[L10, L22, L29]don't care [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 6112#[L20, L10, L29]don't care [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] 6154#[L20, L10, L29]don't care [74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 6200#[L11, L20, L29, L37]don't care [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 6204#[L38, L11, L20, L29]don't care [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 6276#[L11, L20, L29, L37]don't care [2023-10-12 17:12:12,404 INFO L750 eck$LassoCheckResult]: Loop: 6276#[L11, L20, L29, L37]don't care [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] 6264#[L11, L22, L29, L37]don't care [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] 6268#[L11, L22, L29, L37]don't care [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 6272#[L11, L20, L29, L37]don't care [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 6402#[L38, L11, L20, L29]don't care [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 6276#[L11, L20, L29, L37]don't care [2023-10-12 17:12:12,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1744647627, now seen corresponding path program 1 times [2023-10-12 17:12:12,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515922472] [2023-10-12 17:12:12,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,447 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:12:12,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:12,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515922472] [2023-10-12 17:12:12,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515922472] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:12,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:12:12,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047306594] [2023-10-12 17:12:12,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:12,449 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:12:12,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash 109836630, now seen corresponding path program 1 times [2023-10-12 17:12:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289840471] [2023-10-12 17:12:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,499 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:12,499 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:12,499 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:12,499 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:12,499 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:12:12,499 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,499 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:12,499 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:12,499 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration6_Loop [2023-10-12 17:12:12,499 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:12,499 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:12,500 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:12:12,504 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:12:12,531 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:12,531 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:12:12,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,532 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:12,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:12:12,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:12,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:12:12,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:12,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,563 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:12,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:12:12,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:12:12,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:12:12,589 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:12:12,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:12,600 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:12,600 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:12,600 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:12,600 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:12,600 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:12,600 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,600 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:12,600 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:12,600 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration6_Loop [2023-10-12 17:12:12,600 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:12,600 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:12,601 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:12:12,605 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:12:12,629 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:12,630 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:12,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,631 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:12,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:12:12,642 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:12:12,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:12,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:12,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:12,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:12,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:12,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:12,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:12,665 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:12,668 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:12:12,668 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:12:12,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:12,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:12,670 INFO L229 MonitoredProcess]: Starting monitored process 25 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:12:12,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:12:12,672 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:12,673 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:12:12,673 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:12,673 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = 1*n Supporting invariants [] [2023-10-12 17:12:12,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:12,678 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:12,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:12,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:12:12,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:12,723 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:12:12,724 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-10-12 17:12:12,724 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 192 states and 581 transitions. cyclomatic complexity: 410 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:12:12,802 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 192 states and 581 transitions. cyclomatic complexity: 410. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 589 states and 1700 transitions. Complement of second has 11 states. [2023-10-12 17:12:12,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:12,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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:12:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2023-10-12 17:12:12,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 9 letters. Loop has 5 letters. [2023-10-12 17:12:12,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:12,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 14 letters. Loop has 5 letters. [2023-10-12 17:12:12,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:12,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 46 transitions. Stem has 9 letters. Loop has 10 letters. [2023-10-12 17:12:12,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:12,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 589 states and 1700 transitions. [2023-10-12 17:12:12,813 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 48 [2023-10-12 17:12:12,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 589 states to 508 states and 1454 transitions. [2023-10-12 17:12:12,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2023-10-12 17:12:12,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2023-10-12 17:12:12,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 508 states and 1454 transitions. [2023-10-12 17:12:12,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:12,817 INFO L219 hiAutomatonCegarLoop]: Abstraction has 508 states and 1454 transitions. [2023-10-12 17:12:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states and 1454 transitions. [2023-10-12 17:12:12,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 414. [2023-10-12 17:12:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 414 states have (on average 2.9541062801932365) internal successors, (1223), 413 states have internal predecessors, (1223), 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:12:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1223 transitions. [2023-10-12 17:12:12,829 INFO L241 hiAutomatonCegarLoop]: Abstraction has 414 states and 1223 transitions. [2023-10-12 17:12:12,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:12:12,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:12:12,830 INFO L87 Difference]: Start difference. First operand 414 states and 1223 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:12:12,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:12,858 INFO L93 Difference]: Finished difference Result 529 states and 1399 transitions. [2023-10-12 17:12:12,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 529 states and 1399 transitions. [2023-10-12 17:12:12,862 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 48 [2023-10-12 17:12:12,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 529 states to 441 states and 1185 transitions. [2023-10-12 17:12:12,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 228 [2023-10-12 17:12:12,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 228 [2023-10-12 17:12:12,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 441 states and 1185 transitions. [2023-10-12 17:12:12,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:12,865 INFO L219 hiAutomatonCegarLoop]: Abstraction has 441 states and 1185 transitions. [2023-10-12 17:12:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states and 1185 transitions. [2023-10-12 17:12:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 246. [2023-10-12 17:12:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 2.8902439024390243) internal successors, (711), 245 states have internal predecessors, (711), 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:12:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 711 transitions. [2023-10-12 17:12:12,870 INFO L241 hiAutomatonCegarLoop]: Abstraction has 246 states and 711 transitions. [2023-10-12 17:12:12,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:12:12,871 INFO L430 stractBuchiCegarLoop]: Abstraction has 246 states and 711 transitions. [2023-10-12 17:12:12,871 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:12:12,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 711 transitions. [2023-10-12 17:12:12,873 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 48 [2023-10-12 17:12:12,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:12,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:12,873 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:12,873 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2023-10-12 17:12:12,874 INFO L748 eck$LassoCheckResult]: Stem: 8641#[$Ultimate##0]don't care [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] 8625#[L9]don't care [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 8593#[L20, L9-1]don't care [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] 8595#[L22, L9-1]don't care [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 8513#[L10, L22, L29]don't care [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 8515#[L20, L10, L29]don't care [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] 8559#[L20, L10, L29]don't care [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] 8717#[L10, L22, L29]don't care [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 8667#[L20, L10, L29]don't care [74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 8671#[L11, L20, L29, L37]don't care [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 8945#[L38, L11, L20, L29]don't care [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 8829#[L11, L20, L29, L37]don't care [2023-10-12 17:12:12,874 INFO L750 eck$LassoCheckResult]: Loop: 8829#[L11, L20, L29, L37]don't care [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] 8547#[L11, L22, L29, L37]don't care [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 8879#[L11, L20, L29, L37]don't care [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] 8831#[L11, L22, L29, L37]don't care [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 8791#[L11, L20, L29, L37]don't care [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 8795#[L38, L11, L20, L29]don't care [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 8829#[L11, L20, L29, L37]don't care [2023-10-12 17:12:12,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1579114759, now seen corresponding path program 2 times [2023-10-12 17:12:12,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470255445] [2023-10-12 17:12:12,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,896 INFO L85 PathProgramCache]: Analyzing trace with hash -918756053, now seen corresponding path program 1 times [2023-10-12 17:12:12,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254172451] [2023-10-12 17:12:12,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:12,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:12,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254172451] [2023-10-12 17:12:12,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254172451] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:12,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:12,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:12:12,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252567656] [2023-10-12 17:12:12,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:12,915 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:12:12,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:12,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:12:12,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:12:12,916 INFO L87 Difference]: Start difference. First operand 246 states and 711 transitions. cyclomatic complexity: 488 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:12:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:12,933 INFO L93 Difference]: Finished difference Result 211 states and 522 transitions. [2023-10-12 17:12:12,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 522 transitions. [2023-10-12 17:12:12,934 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2023-10-12 17:12:12,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 82 states and 172 transitions. [2023-10-12 17:12:12,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2023-10-12 17:12:12,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2023-10-12 17:12:12,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 172 transitions. [2023-10-12 17:12:12,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:12,935 INFO L219 hiAutomatonCegarLoop]: Abstraction has 82 states and 172 transitions. [2023-10-12 17:12:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 172 transitions. [2023-10-12 17:12:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2023-10-12 17:12:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 2.088607594936709) internal successors, (165), 78 states have internal predecessors, (165), 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:12:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 165 transitions. [2023-10-12 17:12:12,937 INFO L241 hiAutomatonCegarLoop]: Abstraction has 79 states and 165 transitions. [2023-10-12 17:12:12,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:12:12,937 INFO L430 stractBuchiCegarLoop]: Abstraction has 79 states and 165 transitions. [2023-10-12 17:12:12,937 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:12:12,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 165 transitions. [2023-10-12 17:12:12,938 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2023-10-12 17:12:12,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:12,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:12,938 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:12,938 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2023-10-12 17:12:12,938 INFO L748 eck$LassoCheckResult]: Stem: 9266#[$Ultimate##0]don't care [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] 9258#[L9]don't care [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 9260#[L20, L9-1]don't care [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] 9270#[L22, L9-1]don't care [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 9272#[L10, L22, L29]don't care [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 9264#[L20, L10, L29]don't care [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] 9314#[L20, L10, L29]don't care [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] 9222#[L10, L22, L29]don't care [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 9224#[L20, L10, L29]don't care [74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 9310#[L11, L20, L29, L37]don't care [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 9338#[L38, L11, L20, L29]don't care [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 9232#[L11, L20, L29, L37]don't care [2023-10-12 17:12:12,938 INFO L750 eck$LassoCheckResult]: Loop: 9232#[L11, L20, L29, L37]don't care [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] 9280#[L11, L20, L29, L37]don't care [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] 9282#[L11, L22, L29, L37]don't care [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] 9246#[L11, L22, L29, L37]don't care [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 9286#[L11, L20, L29, L37]don't care [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] 9348#[L11, L22, L29, L37]don't care [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 9344#[L11, L20, L29, L37]don't care [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 9230#[L38, L11, L20, L29]don't care [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 9232#[L11, L20, L29, L37]don't care [2023-10-12 17:12:12,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1579114759, now seen corresponding path program 3 times [2023-10-12 17:12:12,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360590269] [2023-10-12 17:12:12,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,945 INFO L85 PathProgramCache]: Analyzing trace with hash -584531581, now seen corresponding path program 2 times [2023-10-12 17:12:12,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59848291] [2023-10-12 17:12:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:12,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:12,950 INFO L85 PathProgramCache]: Analyzing trace with hash 334609545, now seen corresponding path program 4 times [2023-10-12 17:12:12,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:12,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561088676] [2023-10-12 17:12:12,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:12,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:12,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:13,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:13,086 INFO L201 PluginConnector]: Adding new model Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:13 BoogieIcfgContainer [2023-10-12 17:12:13,086 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:13,087 INFO L158 Benchmark]: Toolchain (without parser) took 4021.32ms. Allocated memory was 255.9MB in the beginning and 314.6MB in the end (delta: 58.7MB). Free memory was 204.4MB in the beginning and 229.1MB in the end (delta: -24.7MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. [2023-10-12 17:12:13,087 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 255.9MB. Free memory is still 205.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:13,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.47ms. Allocated memory is still 255.9MB. Free memory was 204.4MB in the beginning and 202.8MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:12:13,087 INFO L158 Benchmark]: Boogie Preprocessor took 17.47ms. Allocated memory is still 255.9MB. Free memory was 202.7MB in the beginning and 201.8MB in the end (delta: 901.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:13,087 INFO L158 Benchmark]: RCFGBuilder took 451.79ms. Allocated memory is still 255.9MB. Free memory was 201.7MB in the beginning and 222.7MB in the end (delta: -21.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-10-12 17:12:13,087 INFO L158 Benchmark]: BuchiAutomizer took 3522.00ms. Allocated memory was 255.9MB in the beginning and 314.6MB in the end (delta: 58.7MB). Free memory was 222.4MB in the beginning and 229.1MB in the end (delta: -6.7MB). Peak memory consumption was 52.6MB. Max. memory is 8.0GB. [2023-10-12 17:12:13,088 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.27ms. Allocated memory is still 255.9MB. Free memory is still 205.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.47ms. Allocated memory is still 255.9MB. Free memory was 204.4MB in the beginning and 202.8MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.47ms. Allocated memory is still 255.9MB. Free memory was 202.7MB in the beginning and 201.8MB in the end (delta: 901.7kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 451.79ms. Allocated memory is still 255.9MB. Free memory was 201.7MB in the beginning and 222.7MB in the end (delta: -21.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3522.00ms. Allocated memory was 255.9MB in the beginning and 314.6MB in the end (delta: 58.7MB). Free memory was 222.4MB in the beginning and 229.1MB in the end (delta: -6.7MB). Peak memory consumption was 52.6MB. 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 11 terminating modules (5 trivial, 6 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 3 + -2 * x and consists of 3 locations. One deterministic module has affine ranking function x and consists of 3 locations. One deterministic module has affine ranking function n and consists of 5 locations. One deterministic module has affine ranking function x and consists of 3 locations. One deterministic module has affine ranking function 7 + -2 * n and consists of 4 locations. One deterministic module has affine ranking function n and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 79 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 996 StatesRemovedByMinimization, 11 NontrivialMinimizations. 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 [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 458 IncrementalHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 40 mSDtfsCounter, 458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp80 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq186 hnf89 smp100 dnf100 smp100 tf113 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 144ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 29]: 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] [L22] 1 n := n + 1; VAL [n=2, x=2] [L29] COND TRUE 2 x == 2 [L30] 2 x := 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=2, x=2] [L22] 1 n := n + 1; VAL [n=3, x=2] [L11] FORK 0 fork 3 three(); VAL [n=3, x=2] [L37] COND TRUE 3 n == 3 VAL [n=3, x=2] [L38] 3 n := 1; VAL [n=1, x=2] Loop: [L29] COND TRUE x == 2 [L30] x := 1; [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; [L22] n := n + 1; [L37] COND TRUE n == 3 [L38] n := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: 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] [L22] 1 n := n + 1; VAL [n=2, x=2] [L29] COND TRUE 2 x == 2 [L30] 2 x := 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=2, x=2] [L22] 1 n := n + 1; VAL [n=3, x=2] [L11] FORK 0 fork 3 three(); VAL [n=3, x=2] [L37] COND TRUE 3 n == 3 VAL [n=3, x=2] [L38] 3 n := 1; VAL [n=1, x=2] Loop: [L29] COND TRUE x == 2 [L30] x := 1; [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; [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.1s, 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: 22, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 15, dependent conditional: 0, dependent unconditional: 15, 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:12:13,131 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...