/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:36:37,295 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:36:37,336 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:36:37,351 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:36:37,352 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:36:37,352 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:36:37,353 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:36:37,353 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:36:37,353 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:36:37,353 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:36:37,354 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:36:37,354 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:36:37,354 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:36:37,354 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:36:37,354 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:36:37,355 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:36:37,355 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:36:37,355 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:36:37,355 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:36:37,356 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:36:37,356 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:36:37,359 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:36:37,359 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:36:37,360 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:36:37,360 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:36:37,360 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:36:37,360 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:36:37,361 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:36:37,361 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:36:37,361 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:36:37,361 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:36:37,361 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:36:37,362 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:36:37,362 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:36:37,363 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:36:37,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:36:37,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:36:37,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:36:37,601 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:36:37,602 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:36:37,603 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:36:37,604 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl' [2023-10-12 17:36:37,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:36:37,649 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:36:37,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:37,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:36:37,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:36:37,681 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:36:37" (1/1) ... [2023-10-12 17:36:37,697 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:36:37" (1/1) ... [2023-10-12 17:36:37,717 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:36:37,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:37,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:36:37,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:36:37,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:36:37,725 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:36:37" (1/1) ... [2023-10-12 17:36:37,725 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:36:37" (1/1) ... [2023-10-12 17:36:37,726 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:36:37" (1/1) ... [2023-10-12 17:36:37,726 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:36:37" (1/1) ... [2023-10-12 17:36:37,727 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:36:37" (1/1) ... [2023-10-12 17:36:37,730 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:36:37" (1/1) ... [2023-10-12 17:36:37,730 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:36:37" (1/1) ... [2023-10-12 17:36:37,730 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:36:37" (1/1) ... [2023-10-12 17:36:37,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:36:37,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:36:37,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:36:37,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:36:37,734 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:36:37" (1/1) ... [2023-10-12 17:36:37,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:37,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:37,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:37,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:36:37,800 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2023-10-12 17:36:37,800 INFO L130 BoogieDeclarations]: Found specification of procedure one [2023-10-12 17:36:37,800 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2023-10-12 17:36:37,801 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:36:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:36:37,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:36:37,801 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2023-10-12 17:36:37,801 INFO L130 BoogieDeclarations]: Found specification of procedure three [2023-10-12 17:36:37,801 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2023-10-12 17:36:37,801 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2023-10-12 17:36:37,802 INFO L130 BoogieDeclarations]: Found specification of procedure two [2023-10-12 17:36:37,802 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2023-10-12 17:36:37,803 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:36:37,839 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:36:37,841 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:36:37,918 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:36:37,923 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:36:37,923 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:36:37,924 INFO L201 PluginConnector]: Adding new model Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:37 BoogieIcfgContainer [2023-10-12 17:36:37,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:36:37,925 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:36:37,925 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:36:37,928 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:36:37,929 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:37,929 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:36:37" (1/2) ... [2023-10-12 17:36:37,931 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d9a3b14 and model type Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:36:37, skipping insertion in model container [2023-10-12 17:36:37,931 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:37,931 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:36:37" (2/2) ... [2023-10-12 17:36:37,932 INFO L332 chiAutomizerObserver]: Analyzing ICFG Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl [2023-10-12 17:36:38,002 INFO L144 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2023-10-12 17:36:38,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 34 transitions, 110 flow [2023-10-12 17:36:38,052 INFO L124 PetriNetUnfolderBase]: 8/31 cut-off events. [2023-10-12 17:36:38,052 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:36:38,056 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:36:38,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 34 transitions, 110 flow [2023-10-12 17:36:38,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 28 transitions, 92 flow [2023-10-12 17:36:38,063 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:36:38,073 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 28 transitions, 92 flow [2023-10-12 17:36:38,076 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 28 transitions, 92 flow [2023-10-12 17:36:38,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 28 transitions, 92 flow [2023-10-12 17:36:38,082 INFO L124 PetriNetUnfolderBase]: 8/31 cut-off events. [2023-10-12 17:36:38,082 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:36:38,082 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:36:38,083 INFO L119 LiptonReduction]: Number of co-enabled transitions 244 [2023-10-12 17:36:38,240 INFO L134 LiptonReduction]: Checked pairs total: 382 [2023-10-12 17:36:38,240 INFO L136 LiptonReduction]: Total number of compositions: 6 [2023-10-12 17:36:38,253 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:36:38,253 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:36:38,253 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:36:38,253 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:36:38,253 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:36:38,253 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:36:38,253 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:36:38,253 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:36:38,254 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 22 transitions, 80 flow [2023-10-12 17:36:38,256 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][20], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][10], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][11]][4:4A:[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][19]] [2023-10-12 17:36:38,257 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:38,257 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:36:38,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:38,257 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:38,259 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:36:38,259 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 22 transitions, 80 flow [2023-10-12 17:36:38,260 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][20], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][10], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][11]][4:4A:[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][19]] [2023-10-12 17:36:38,261 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:38,261 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:36:38,261 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:38,261 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:38,264 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [86] $Ultimate##0-->L9: Formula: (and (= v_x_21 1) (= v_n_21 1)) InVars {} OutVars{n=v_n_21, x=v_x_21} AuxVars[] AssignedVars[n, x] 38#[L9]true [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 40#[L20, L9-1]true [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 42#[L20, L10, L29]true [2023-10-12 17:36:38,264 INFO L750 eck$LassoCheckResult]: Loop: 42#[L20, L10, L29]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 42#[L20, L10, L29]true [2023-10-12 17:36:38,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:38,267 INFO L85 PathProgramCache]: Analyzing trace with hash 114616, now seen corresponding path program 1 times [2023-10-12 17:36:38,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:38,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315673898] [2023-10-12 17:36:38,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:38,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:38,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:38,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:38,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:38,335 INFO L85 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 1 times [2023-10-12 17:36:38,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:38,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408952115] [2023-10-12 17:36:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:38,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:38,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:38,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:38,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:38,344 INFO L85 PathProgramCache]: Analyzing trace with hash 3553185, now seen corresponding path program 1 times [2023-10-12 17:36:38,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:38,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323645734] [2023-10-12 17:36:38,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:38,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:38,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:38,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323645734] [2023-10-12 17:36:38,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323645734] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:38,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:38,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:36:38,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243311453] [2023-10-12 17:36:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:38,410 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:38,410 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:38,410 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:38,410 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:38,411 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:38,411 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:38,411 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:38,411 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:38,411 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:36:38,411 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:38,411 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:38,420 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:38,449 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:38,450 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:38,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:38,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:38,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:38,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:38,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:38,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:36:38,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:38,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:38,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:38,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:38,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:36:38,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:38,515 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:38,553 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:38,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:38,563 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:38,563 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:38,563 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:38,563 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:38,564 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:38,564 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:38,564 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:38,564 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:38,564 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:36:38,564 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:38,564 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:38,565 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:38,590 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:38,593 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:38,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:38,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:38,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:38,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:36:38,601 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:38,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:38,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:38,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:38,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:38,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:38,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:38,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:38,632 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:38,636 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:36:38,636 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:38,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:38,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:38,638 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:38,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:36:38,673 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:38,673 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:38,674 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:38,674 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2023-10-12 17:36:38,677 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:36:38,679 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:38,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:38,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:38,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:38,719 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:38,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:38,736 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:36:38,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-10-12 17:36:38,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 110 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:36:38,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:38,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 110 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:36:38,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:38,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 110 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:36:38,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:38,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:36:38,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:36:38,830 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 27 places, 88 transitions, 496 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:38,830 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:38,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:38,987 INFO L124 PetriNetUnfolderBase]: 442/688 cut-off events. [2023-10-12 17:36:38,987 INFO L125 PetriNetUnfolderBase]: For 317/317 co-relation queries the response was YES. [2023-10-12 17:36:38,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 688 events. 442/688 cut-off events. For 317/317 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2638 event pairs, 52 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 1755. Up to 354 conditions per place. [2023-10-12 17:36:38,999 INFO L140 encePairwiseOnDemand]: 37/40 looper letters, 93 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2023-10-12 17:36:38,999 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 29 places, 101 transitions, 753 flow [2023-10-12 17:36:39,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:36:39,001 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 101 transitions, 753 flow [2023-10-12 17:36:39,001 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:36:39,001 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 101 transitions, 753 flow [2023-10-12 17:36:39,004 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[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][3]][19:4A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][10], 20:5A:[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][25]] [2023-10-12 17:36:39,004 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:39,004 INFO L124 PetriNetUnfolderBase]: 7/19 cut-off events. [2023-10-12 17:36:39,004 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:36:39,005 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:39,005 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [86] $Ultimate##0-->L9: Formula: (and (= v_x_21 1) (= v_n_21 1)) InVars {} OutVars{n=v_n_21, x=v_x_21} AuxVars[] AssignedVars[n, x] 38#[L9]true [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 40#[L20, L9-1]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 83#[L9-1, L22]true [2023-10-12 17:36:39,005 INFO L750 eck$LassoCheckResult]: Loop: 83#[L9-1, L22]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 40#[L20, L9-1]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 83#[L9-1, L22]true [2023-10-12 17:36:39,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:39,007 INFO L85 PathProgramCache]: Analyzing trace with hash 114630, now seen corresponding path program 1 times [2023-10-12 17:36:39,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:39,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583524167] [2023-10-12 17:36:39,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:39,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:39,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:39,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2813, now seen corresponding path program 1 times [2023-10-12 17:36:39,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:39,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626001081] [2023-10-12 17:36:39,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:39,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,034 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:39,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:39,037 INFO L85 PathProgramCache]: Analyzing trace with hash 110161282, now seen corresponding path program 1 times [2023-10-12 17:36:39,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:39,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441198783] [2023-10-12 17:36:39,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:39,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:39,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:39,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441198783] [2023-10-12 17:36:39,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441198783] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:39,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:39,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:36:39,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813520726] [2023-10-12 17:36:39,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:39,096 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:39,096 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:39,096 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:39,097 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:39,097 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:39,098 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,098 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:39,098 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:39,098 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:36:39,098 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:39,098 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:39,099 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:39,104 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:39,134 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:39,134 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:39,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:39,137 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:39,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:36:39,174 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:39,174 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:39,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:39,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:39,204 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:39,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:36:39,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:39,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:39,267 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:39,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:39,273 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:39,273 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:39,273 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:39,274 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:39,274 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:39,274 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,274 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:39,274 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:39,274 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:36:39,274 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:39,274 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:39,275 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:39,280 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:39,305 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:39,305 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:39,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:39,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:39,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:36:39,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:39,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:39,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:39,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:39,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:39,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:39,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:39,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:39,327 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:39,329 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:39,329 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:39,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:39,332 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:39,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:36:39,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:39,334 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:39,334 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:39,334 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = -2*n + 5 Supporting invariants [] [2023-10-12 17:36:39,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:39,342 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:39,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:39,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:39,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:39,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:39,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:39,396 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:36:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2023-10-12 17:36:39,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 151 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:36:39,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:39,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 151 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:36:39,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:39,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 151 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:36:39,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:39,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:36:39,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:36:39,515 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 34 places, 505 transitions, 4775 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:39,515 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:39,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:39,649 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:36:39,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:36:39,740 INFO L124 PetriNetUnfolderBase]: 981/1566 cut-off events. [2023-10-12 17:36:39,740 INFO L125 PetriNetUnfolderBase]: For 848/848 co-relation queries the response was YES. [2023-10-12 17:36:39,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8343 conditions, 1566 events. 981/1566 cut-off events. For 848/848 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7533 event pairs, 50 based on Foata normal form. 0/1276 useless extension candidates. Maximal degree in co-relation 6069. Up to 863 conditions per place. [2023-10-12 17:36:39,754 INFO L140 encePairwiseOnDemand]: 38/40 looper letters, 276 selfloop transitions, 24 changer transitions 0/300 dead transitions. [2023-10-12 17:36:39,755 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 36 places, 300 transitions, 3456 flow [2023-10-12 17:36:39,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:36:39,756 INFO L430 stractBuchiCegarLoop]: Abstraction has has 36 places, 300 transitions, 3456 flow [2023-10-12 17:36:39,757 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:36:39,757 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 36 places, 300 transitions, 3456 flow [2023-10-12 17:36:39,763 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 13:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][8]][44:5A:[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[][20], 46:6A:[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n][45]] [2023-10-12 17:36:39,763 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:39,763 INFO L124 PetriNetUnfolderBase]: 22/45 cut-off events. [2023-10-12 17:36:39,764 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-10-12 17:36:39,764 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:39,764 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [86] $Ultimate##0-->L9: Formula: (and (= v_x_21 1) (= v_n_21 1)) InVars {} OutVars{n=v_n_21, x=v_x_21} AuxVars[] AssignedVars[n, x] 38#[L9]true [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 40#[L20, L9-1]true [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 42#[L20, L10, L29]true [74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 125#[L20, L37, L29, L11]true [2023-10-12 17:36:39,764 INFO L750 eck$LassoCheckResult]: Loop: 125#[L20, L37, L29, L11]true [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 128#[L20, L29, L11, L38]true [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [2023-10-12 17:36:39,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:39,764 INFO L85 PathProgramCache]: Analyzing trace with hash 3553170, now seen corresponding path program 1 times [2023-10-12 17:36:39,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:39,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814447220] [2023-10-12 17:36:39,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:39,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:39,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:39,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2023-10-12 17:36:39,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:39,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680147018] [2023-10-12 17:36:39,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:39,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:39,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash -880368908, now seen corresponding path program 1 times [2023-10-12 17:36:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:39,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461010951] [2023-10-12 17:36:39,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:39,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:39,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461010951] [2023-10-12 17:36:39,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461010951] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:39,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:39,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:36:39,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106874041] [2023-10-12 17:36:39,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:39,811 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:39,811 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:39,811 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:39,811 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:39,811 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:39,811 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,811 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:39,811 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:39,811 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:36:39,811 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:39,811 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:39,812 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:39,826 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:39,826 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:39,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:39,827 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:39,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:36:39,831 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:39,831 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:39,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:39,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:39,856 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:39,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:36:39,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:39,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:39,885 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:39,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:39,890 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:39,890 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:39,890 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:39,890 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:39,890 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:39,890 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,890 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:39,890 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:39,891 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:36:39,891 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:39,891 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:39,891 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:39,906 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:39,906 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:39,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:39,918 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:39,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:36:39,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:39,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:39,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:39,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:39,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:39,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:39,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:39,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:39,952 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:39,954 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-10-12 17:36:39,954 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:39,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:39,961 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:39,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:36:39,965 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:39,965 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:39,965 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:39,965 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = 1*n Supporting invariants [] [2023-10-12 17:36:39,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:39,969 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:39,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:39,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:39,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:39,989 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:39,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:39,996 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:36:40,118 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:36:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 192 transitions. [2023-10-12 17:36:40,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 192 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:36:40,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:40,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 192 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:36:40,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:40,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 192 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:36:40,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:40,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:40,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:36:40,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:36:40,123 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 42 places, 1800 transitions, 24336 flow. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:40,123 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:40,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:40,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:40,712 INFO L124 PetriNetUnfolderBase]: 1668/2721 cut-off events. [2023-10-12 17:36:40,712 INFO L125 PetriNetUnfolderBase]: For 1554/1554 co-relation queries the response was YES. [2023-10-12 17:36:40,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19981 conditions, 2721 events. 1668/2721 cut-off events. For 1554/1554 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14706 event pairs, 28 based on Foata normal form. 0/2274 useless extension candidates. Maximal degree in co-relation 14316. Up to 1689 conditions per place. [2023-10-12 17:36:40,737 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 678 selfloop transitions, 49 changer transitions 0/727 dead transitions. [2023-10-12 17:36:40,737 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 44 places, 727 transitions, 11240 flow [2023-10-12 17:36:40,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:36:40,738 INFO L430 stractBuchiCegarLoop]: Abstraction has has 44 places, 727 transitions, 11240 flow [2023-10-12 17:36:40,738 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:36:40,738 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 44 places, 727 transitions, 11240 flow [2023-10-12 17:36:40,780 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 7:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][5], 20:5A:[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][12], 75:6A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][35]][178:7A:[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][78], 345:8A:[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][143], 346:9A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][239]] [2023-10-12 17:36:40,788 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 10:4A:[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][7], 34:5A:[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][18], 99:6A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][43]][202:7A:[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][91], 415:8A:[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][158], 416:9A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][274]] [2023-10-12 17:36:40,813 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 7:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][5], 20:5A:[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][12], 75:6A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][35], 178:7A:[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][78]][345:8A:[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][143], 674:9A:[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][146], 675:10A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][378]] [2023-10-12 17:36:40,850 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 7:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][5], 20:5A:[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][12], 73:6A:[87] L37-->threeEXIT: Formula: (not (= v_n_27 3)) InVars {n=v_n_27} OutVars{n=v_n_27} AuxVars[] AssignedVars[][34], 172:7A:[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][75], 333:8A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][82]][638:9A:[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][143], 1086:10A:[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][146], 1087:11A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][378]] [2023-10-12 17:36:40,909 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 7:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][5], 20:5A:[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][12], 73:6A:[87] L37-->threeEXIT: Formula: (not (= v_n_27 3)) InVars {n=v_n_27} OutVars{n=v_n_27} AuxVars[] AssignedVars[][34], 170:7A:[77] threeEXIT-->L12: Formula: (= v_threeThread1of1ForFork2_thidvar0_4 1) InVars {threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][73], 329:8A:[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][75], 627:9A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][82]][1068:10A:[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][143], 1555:11A:[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][146], 1556:12A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][378]] [2023-10-12 17:36:40,958 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 7:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][5], 20:5A:[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][12], 75:6A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][35], 178:7A:[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][78], 344:8A:[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[][141], 667:9A:[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][238], 1135:10A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][375]][1576:11A:[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][78], 1971:12A:[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][143], 1975:13A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][239]] [2023-10-12 17:36:40,969 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:40,969 INFO L124 PetriNetUnfolderBase]: 1274/2024 cut-off events. [2023-10-12 17:36:40,969 INFO L125 PetriNetUnfolderBase]: For 1187/1187 co-relation queries the response was YES. [2023-10-12 17:36:40,969 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:40,970 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [86] $Ultimate##0-->L9: Formula: (and (= v_x_21 1) (= v_n_21 1)) InVars {} OutVars{n=v_n_21, x=v_x_21} AuxVars[] AssignedVars[n, x] 38#[L9]true [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 40#[L20, L9-1]true [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 42#[L20, L10, L29]true [74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 125#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 125#[L20, L37, L29, L11]true [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 128#[L20, L29, L11, L38]true [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 128#[L20, L29, L11, L38]true [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [2023-10-12 17:36:40,970 INFO L750 eck$LassoCheckResult]: Loop: 125#[L20, L37, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 125#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 128#[L20, L29, L11, L38]true [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [2023-10-12 17:36:40,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash 618489739, now seen corresponding path program 1 times [2023-10-12 17:36:40,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:40,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832151732] [2023-10-12 17:36:40,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:40,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:36:41,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:41,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832151732] [2023-10-12 17:36:41,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832151732] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:41,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:41,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:36:41,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436933554] [2023-10-12 17:36:41,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:41,018 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:36:41,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,019 INFO L85 PathProgramCache]: Analyzing trace with hash 113411550, now seen corresponding path program 1 times [2023-10-12 17:36:41,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492785800] [2023-10-12 17:36:41,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:41,051 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,051 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,051 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,051 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,051 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:41,051 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,051 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,051 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,051 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration4_Loop [2023-10-12 17:36:41,051 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,051 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,052 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:41,055 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:41,090 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,091 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:41,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,092 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:41,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:36:41,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:41,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,104 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-10-12 17:36:41,104 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x=2} Honda state: {x=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-10-12 17:36:41,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:41,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,108 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:41,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:36:41,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:41,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:41,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,141 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:41,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:36:41,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:41,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,160 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:41,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-10-12 17:36:41,164 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,164 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,164 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,164 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,164 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:41,164 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,164 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,164 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,164 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration4_Loop [2023-10-12 17:36:41,164 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,164 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,165 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:41,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:36:41,197 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,197 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:41,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,198 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:41,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:36:41,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:41,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:41,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:41,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:41,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:41,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:41,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:41,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:41,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:36:41,228 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:36:41,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,229 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:36:41,232 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:36:41,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:41,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:41,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:41,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:41,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:41,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:41,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:41,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:41,256 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:41,259 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:41,259 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:36:41,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,260 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:36:41,261 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:36:41,263 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:41,263 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:41,263 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:41,263 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = 1*n Supporting invariants [] [2023-10-12 17:36:41,266 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:36:41,267 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:41,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:41,327 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:36:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 270 transitions. [2023-10-12 17:36:41,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 270 transitions. Stem has 13 letters. Loop has 5 letters. [2023-10-12 17:36:41,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 270 transitions. Stem has 18 letters. Loop has 5 letters. [2023-10-12 17:36:41,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 270 transitions. Stem has 13 letters. Loop has 10 letters. [2023-10-12 17:36:41,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:41,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:36:41,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:36:41,526 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 52 places, 5816 transitions, 101552 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:41,526 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:41,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:42,485 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:36:43,887 INFO L124 PetriNetUnfolderBase]: 1905/3171 cut-off events. [2023-10-12 17:36:43,887 INFO L125 PetriNetUnfolderBase]: For 1841/1841 co-relation queries the response was YES. [2023-10-12 17:36:43,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29685 conditions, 3171 events. 1905/3171 cut-off events. For 1841/1841 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 15833 event pairs, 38 based on Foata normal form. 0/2716 useless extension candidates. Maximal degree in co-relation 22101. Up to 2687 conditions per place. [2023-10-12 17:36:43,919 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 747 selfloop transitions, 58 changer transitions 0/805 dead transitions. [2023-10-12 17:36:43,920 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 52 places, 805 transitions, 15693 flow [2023-10-12 17:36:43,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:36:43,920 INFO L430 stractBuchiCegarLoop]: Abstraction has has 52 places, 805 transitions, 15693 flow [2023-10-12 17:36:43,920 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:36:43,921 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 52 places, 805 transitions, 15693 flow [2023-10-12 17:36:44,016 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 13:4A:[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][8], 39:5A:[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][20], 98:6A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][46], 197:7A:[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][90], 376:8A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][148]][601:9A:[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][223], 840:10A:[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][291], 841:11A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][339]] [2023-10-12 17:36:44,039 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 9:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][6], 26:5A:[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][15], 80:6A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][36], 180:7A:[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][79], 344:8A:[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][140], 551:9A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][207]][786:10A:[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][269], 1028:11A:[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][324], 1029:12A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][406]] [2023-10-12 17:36:44,048 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 13:4A:[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][8], 39:5A:[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][20], 98:6A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][46], 197:7A:[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][90], 376:8A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][148], 601:9A:[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][223]][840:10A:[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][291], 1111:11A:[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][340], 1112:12A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][431]] [2023-10-12 17:36:44,061 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 9:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][6], 26:5A:[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][15], 78:6A:[87] L37-->threeEXIT: Formula: (not (= v_n_27 3)) InVars {n=v_n_27} OutVars{n=v_n_27} AuxVars[] AssignedVars[][35], 174:7A:[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][76], 330:8A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][82], 528:9A:[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][140], 758:10A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][207]][987:11A:[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][269], 1213:12A:[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][324], 1214:13A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][406]] [2023-10-12 17:36:44,069 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 9:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][6], 26:5A:[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][15], 80:6A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][36], 180:7A:[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][79], 344:8A:[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][140], 551:9A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][207], 786:10A:[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][269]][1028:11A:[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][324], 1281:12A:[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][316], 1284:13A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][489]] [2023-10-12 17:36:44,088 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 9:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][6], 26:5A:[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][15], 78:6A:[87] L37-->threeEXIT: Formula: (not (= v_n_27 3)) InVars {n=v_n_27} OutVars{n=v_n_27} AuxVars[] AssignedVars[][35], 172:7A:[77] threeEXIT-->L12: Formula: (= v_threeThread1of1ForFork2_thidvar0_4 1) InVars {threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][74], 326:8A:[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][76], 517:9A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][82], 742:10A:[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][140], 967:11A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][207]][1195:12A:[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][269], 1465:13A:[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][324], 1466:14A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][406]] [2023-10-12 17:36:44,091 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 9:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][6], 26:5A:[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][15], 78:6A:[87] L37-->threeEXIT: Formula: (not (= v_n_27 3)) InVars {n=v_n_27} OutVars{n=v_n_27} AuxVars[] AssignedVars[][35], 174:7A:[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][76], 330:8A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][82], 528:9A:[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][140], 758:10A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][207], 987:11A:[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][269]][1213:12A:[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][324], 1482:13A:[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][316], 1484:14A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][489]] [2023-10-12 17:36:44,120 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 9:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][6], 26:5A:[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][15], 78:6A:[87] L37-->threeEXIT: Formula: (not (= v_n_27 3)) InVars {n=v_n_27} OutVars{n=v_n_27} AuxVars[] AssignedVars[][35], 172:7A:[77] threeEXIT-->L12: Formula: (= v_threeThread1of1ForFork2_thidvar0_4 1) InVars {threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][74], 326:8A:[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][76], 517:9A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][82], 742:10A:[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][140], 967:11A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][207], 1195:12A:[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][269]][1465:13A:[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][324], 1761:14A:[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][316], 1762:15A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][489]] [2023-10-12 17:36:44,154 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 9:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][6], 26:5A:[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][15], 80:6A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][36], 180:7A:[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][79], 344:8A:[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][140], 551:9A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][207], 785:10A:[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[][268], 1006:11A:[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][316], 1248:12A:[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][384], 1545:13A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][471]][1806:14A:[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][269], 2049:15A:[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][324], 2053:16A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][406]] [2023-10-12 17:36:44,172 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 13:4A:[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][8], 39:5A:[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][20], 98:6A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][46], 197:7A:[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][90], 376:8A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][148], 601:9A:[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][223], 839:10A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][289], 1085:11A:[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[][333], 1365:12A:[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][414], 1690:13A:[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][443]][1988:14A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][580], 2207:15A:[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][637], 2210:16A:[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][354]] [2023-10-12 17:36:44,228 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:44,228 INFO L124 PetriNetUnfolderBase]: 1556/2579 cut-off events. [2023-10-12 17:36:44,228 INFO L125 PetriNetUnfolderBase]: For 1454/1454 co-relation queries the response was YES. [2023-10-12 17:36:44,228 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:44,229 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [86] $Ultimate##0-->L9: Formula: (and (= v_x_21 1) (= v_n_21 1)) InVars {} OutVars{n=v_n_21, x=v_x_21} AuxVars[] AssignedVars[n, x] 38#[L9]true [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 40#[L20, L9-1]true [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 42#[L20, L10, L29]true [74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 125#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 125#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 128#[L20, L29, L11, L38]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 128#[L20, L29, L11, L38]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 279#[L22, L29, L11, L38]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 279#[L22, L29, L11, L38]true [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [2023-10-12 17:36:44,229 INFO L750 eck$LassoCheckResult]: Loop: 125#[L20, L37, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 125#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [2023-10-12 17:36:44,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:44,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1738435260, now seen corresponding path program 2 times [2023-10-12 17:36:44,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:44,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320234954] [2023-10-12 17:36:44,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:44,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:44,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:44,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:44,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 118012, now seen corresponding path program 1 times [2023-10-12 17:36:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269018288] [2023-10-12 17:36:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:44,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:44,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:44,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:44,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1009263713, now seen corresponding path program 3 times [2023-10-12 17:36:44,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:44,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376241521] [2023-10-12 17:36:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-10-12 17:36:44,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376241521] [2023-10-12 17:36:44,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376241521] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:44,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:44,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-10-12 17:36:44,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943931358] [2023-10-12 17:36:44,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:44,332 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:44,332 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:44,332 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:44,332 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:44,332 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:44,332 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:44,332 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:44,332 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:44,332 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration5_Loop [2023-10-12 17:36:44,332 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:44,332 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:44,333 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:44,336 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:44,366 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:44,366 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:44,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:44,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:44,367 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:36:44,376 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:44,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:44,383 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:36:44,391 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:36:44,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:44,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:44,392 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:36:44,392 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:36:44,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:44,395 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:44,428 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:44,432 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:36:44,433 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:44,433 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:44,433 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:44,433 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:44,433 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:44,433 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:44,433 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:44,433 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:44,433 INFO L133 ssoRankerPreferences]: Filename of dumped script: Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl_BEv2_Iteration5_Loop [2023-10-12 17:36:44,433 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:44,433 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:44,433 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:44,438 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:44,473 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:44,474 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:44,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:44,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:44,475 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:36:44,478 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:36:44,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:44,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:44,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:44,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:44,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:44,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:44,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:44,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:44,500 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:44,502 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:44,502 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:44,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:44,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:44,503 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:36:44,504 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:36:44,506 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:44,506 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:44,506 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:44,506 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(n) = -2*n + 7 Supporting invariants [] [2023-10-12 17:36:44,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-10-12 17:36:44,511 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:44,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:44,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:44,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:44,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:44,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:44,582 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:36:44,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2023-10-12 17:36:44,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 151 transitions. Stem has 20 letters. Loop has 3 letters. [2023-10-12 17:36:44,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:44,675 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:36:44,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:44,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:44,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:44,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:44,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:44,735 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:36:44,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2023-10-12 17:36:44,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 151 transitions. Stem has 20 letters. Loop has 3 letters. [2023-10-12 17:36:44,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:44,811 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:36:44,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:44,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:44,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:44,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:44,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:44,876 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:36:44,877 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:44,962 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 387 transitions. [2023-10-12 17:36:44,963 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:36:45,061 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:36:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:36:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2023-10-12 17:36:45,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 152 transitions. Stem has 20 letters. Loop has 3 letters. [2023-10-12 17:36:45,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:45,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 152 transitions. Stem has 23 letters. Loop has 3 letters. [2023-10-12 17:36:45,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:45,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 152 transitions. Stem has 20 letters. Loop has 6 letters. [2023-10-12 17:36:45,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:45,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:45,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-10-12 17:36:45,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-10-12 17:36:45,063 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 70 places, 15862 transitions, 341300 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:45,063 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:45,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:46,929 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:37:12,161 INFO L124 PetriNetUnfolderBase]: 5587/9456 cut-off events. [2023-10-12 17:37:12,161 INFO L125 PetriNetUnfolderBase]: For 5481/5481 co-relation queries the response was YES. [2023-10-12 17:37:12,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107685 conditions, 9456 events. 5587/9456 cut-off events. For 5481/5481 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 61040 event pairs, 43 based on Foata normal form. 0/7605 useless extension candidates. Maximal degree in co-relation 80174. Up to 8270 conditions per place. [2023-10-12 17:37:12,231 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 2259 selfloop transitions, 169 changer transitions 558/2986 dead transitions. [2023-10-12 17:37:12,232 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 67 places, 2986 transitions, 70324 flow [2023-10-12 17:37:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-10-12 17:37:12,232 INFO L430 stractBuchiCegarLoop]: Abstraction has has 67 places, 2986 transitions, 70324 flow [2023-10-12 17:37:12,232 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:37:12,233 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 67 places, 2986 transitions, 70324 flow [2023-10-12 17:37:15,729 ERROR L47 etriNetUnfolderRabin]: [1:1A:[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][0], 2:2A:[68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 7:4A:[74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][6], 19:5A:[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][15], 78:6A:[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][43], 205:7A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][123], 551:8A:[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][281], 1130:9A:[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][529], 1827:10A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][756], 2462:11A:[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[][912], 3135:12A:[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][1134], 3943:13A:[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n][1156], 4794:14A:[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][1494], 5525:15A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][1942], 6133:16A:[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][2107], 6609:17A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][2221]][6887:18A:[63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[][2300], 7104:19A:[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][2357], 7379:20A:[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][2445], 7685:21A:[65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n][2356], 8018:22A:[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][2439], 8337:23A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][2700], 8640:24A:[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][2767], 8641:25A:[57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n][2856]] [2023-10-12 17:37:15,730 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:15,730 INFO L124 PetriNetUnfolderBase]: 5098/8640 cut-off events. [2023-10-12 17:37:15,730 INFO L125 PetriNetUnfolderBase]: For 5050/5050 co-relation queries the response was YES. [2023-10-12 17:37:15,730 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:15,730 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [86] $Ultimate##0-->L9: Formula: (and (= v_x_21 1) (= v_n_21 1)) InVars {} OutVars{n=v_n_21, x=v_x_21} AuxVars[] AssignedVars[n, x] 38#[L9]true [68] L9-->L20: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 40#[L20, L9-1]true [71] L9-1-->L29: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 42#[L20, L10, L29]true [74] L10-->L37: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 125#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 128#[L20, L29, L11, L38]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 279#[L22, L29, L11, L38]true [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 174#[L22, L37, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [2023-10-12 17:37:15,730 INFO L750 eck$LassoCheckResult]: Loop: 125#[L20, L37, L29, L11]true [63] L37-->L38: Formula: (= 3 v_n_6) InVars {n=v_n_6} OutVars{n=v_n_6} AuxVars[] AssignedVars[] 128#[L20, L29, L11, L38]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 128#[L20, L29, L11, L38]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 279#[L22, L29, L11, L38]true [65] L38-->L37: Formula: (= v_n_7 1) InVars {} OutVars{n=v_n_7} AuxVars[] AssignedVars[n] 174#[L22, L37, L29, L11]true [89] L29-->L29: Formula: (and (= v_x_31 1) (= v_x_32 2)) InVars {x=v_x_32} OutVars{x=v_x_31} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [85] L20-->L22: Formula: (and (= v_x_18 1) (= v_x_17 2) (< v_n_19 4)) InVars {n=v_n_19, x=v_x_18} OutVars{n=v_n_19, x=v_x_17} AuxVars[] AssignedVars[x] 174#[L22, L37, L29, L11]true [57] L22-->L20: Formula: (= v_n_2 (+ v_n_3 1)) InVars {n=v_n_3} OutVars{n=v_n_2} AuxVars[] AssignedVars[n] 125#[L20, L37, L29, L11]true [2023-10-12 17:37:15,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:15,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1716096221, now seen corresponding path program 4 times [2023-10-12 17:37:15,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:15,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179214575] [2023-10-12 17:37:15,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:15,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:15,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash 495078795, now seen corresponding path program 2 times [2023-10-12 17:37:15,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:15,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340829587] [2023-10-12 17:37:15,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:15,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:15,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:15,747 INFO L85 PathProgramCache]: Analyzing trace with hash 38747751, now seen corresponding path program 5 times [2023-10-12 17:37:15,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:15,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243999737] [2023-10-12 17:37:15,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:15,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:15,921 INFO L201 PluginConnector]: Adding new model Nconcurrent_ThreeThreadsComplexAlternation_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:15 BoogieIcfgContainer [2023-10-12 17:37:15,922 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:15,922 INFO L158 Benchmark]: Toolchain (without parser) took 38272.66ms. Allocated memory was 246.4MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 198.3MB in the beginning and 958.7MB in the end (delta: -760.4MB). Peak memory consumption was 284.2MB. Max. memory is 8.0GB. [2023-10-12 17:37:15,922 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 246.4MB. Free memory is still 199.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:15,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.69ms. Allocated memory is still 246.4MB. Free memory was 198.2MB in the beginning and 196.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:37:15,923 INFO L158 Benchmark]: Boogie Preprocessor took 11.57ms. Allocated memory is still 246.4MB. Free memory was 196.6MB in the beginning and 195.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:15,923 INFO L158 Benchmark]: RCFGBuilder took 192.88ms. Allocated memory is still 246.4MB. Free memory was 195.5MB in the beginning and 186.7MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:15,923 INFO L158 Benchmark]: BuchiAutomizer took 37996.19ms. Allocated memory was 246.4MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 186.6MB in the beginning and 958.7MB in the end (delta: -772.1MB). Peak memory consumption was 272.7MB. Max. memory is 8.0GB. [2023-10-12 17:37:15,925 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.24ms. Allocated memory is still 246.4MB. Free memory is still 199.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.69ms. Allocated memory is still 246.4MB. Free memory was 198.2MB in the beginning and 196.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.57ms. Allocated memory is still 246.4MB. Free memory was 196.6MB in the beginning and 195.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 192.88ms. Allocated memory is still 246.4MB. Free memory was 195.5MB in the beginning and 186.7MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 37996.19ms. Allocated memory was 246.4MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 186.6MB in the beginning and 958.7MB in the end (delta: -772.1MB). Peak memory consumption was 272.7MB. 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 10 terminating modules (5 trivial, 4 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function x and consists of 3 locations. One deterministic module has affine ranking function 5 + -2 * n and consists of 4 locations. One deterministic module has affine ranking function n and consists of 5 locations. One deterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function 7 + -2 * n and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 70324 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.8s and 6 iterations. TraceHistogramMax:0. Analysis of lassos took 1.7s. Construction of modules took 0.6s. Büchi inclusion checks took 31.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1039 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1032 mSDsluCounter, 736 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 336 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1288 IncrementalHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 400 mSDtfsCounter, 1288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT4 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp76 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq183 hnf89 smp100 dnf100 smp100 tf113 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 80ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 37]: 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] [L10] FORK 0 fork 2 two(); VAL [n=1, x=1] [L11] FORK 0 fork 3 three(); VAL [n=1, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=1, x=2] [L29] COND TRUE 2 x == 2 [L30] 2 x := 1; VAL [n=1, x=1] [L22] 1 n := n + 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=2, x=2] [L29] COND TRUE 2 x == 2 [L30] 2 x := 1; VAL [n=2, x=1] [L22] 1 n := n + 1; VAL [n=3, x=1] [L37] COND TRUE 3 n == 3 VAL [n=3, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=3, x=2] [L38] 3 n := 1; VAL [n=1, x=2] [L29] COND TRUE 2 x == 2 [L30] 2 x := 1; VAL [n=1, x=1] [L22] 1 n := n + 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=2, x=2] [L22] 1 n := n + 1; VAL [n=3, x=2] Loop: [L37] COND TRUE n == 3 [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L38] n := 1; [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; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 37]: 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] [L10] FORK 0 fork 2 two(); VAL [n=1, x=1] [L11] FORK 0 fork 3 three(); VAL [n=1, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=1, x=2] [L29] COND TRUE 2 x == 2 [L30] 2 x := 1; VAL [n=1, x=1] [L22] 1 n := n + 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=2, x=2] [L29] COND TRUE 2 x == 2 [L30] 2 x := 1; VAL [n=2, x=1] [L22] 1 n := n + 1; VAL [n=3, x=1] [L37] COND TRUE 3 n == 3 VAL [n=3, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=3, x=2] [L38] 3 n := 1; VAL [n=1, x=2] [L29] COND TRUE 2 x == 2 [L30] 2 x := 1; VAL [n=1, x=1] [L22] 1 n := n + 1; VAL [n=2, x=1] [L20] COND TRUE 1 x == 1 && n < 4 [L21] 1 x := 2; VAL [n=2, x=2] [L22] 1 n := n + 1; VAL [n=3, x=2] Loop: [L37] COND TRUE n == 3 [L29] COND TRUE x == 2 [L30] x := 1; [L20] COND TRUE x == 1 && n < 4 [L21] x := 2; [L38] n := 1; [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; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 29 PlacesBefore, 23 PlacesAfterwards, 28 TransitionsBefore, 22 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 382 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 293, independent: 275, independent conditional: 0, independent unconditional: 275, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 150, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 150, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 293, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 150, unknown conditional: 0, unknown unconditional: 150] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:37:15,955 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...