/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_ThreeThreadsAlternating_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:36:38,962 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:36:38,997 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:36:39,011 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:36:39,011 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:36:39,011 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:36:39,012 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:36:39,012 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:36:39,013 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:36:39,013 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:36:39,013 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:36:39,013 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:36:39,014 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:36:39,014 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:36:39,014 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:36:39,014 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:36:39,014 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:36:39,015 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:36:39,015 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:36:39,015 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:36:39,015 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:36:39,016 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:36:39,016 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:36:39,016 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:36:39,016 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:36:39,017 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:36:39,017 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:36:39,017 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:36:39,017 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:36:39,017 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:36:39,018 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:36:39,018 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:36:39,018 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:36:39,019 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:36:39,019 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:36:39,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:36:39,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:36:39,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:36:39,213 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:36:39,214 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:36:39,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_ThreeThreadsAlternating_nonterminating.bpl [2023-10-12 17:36:39,216 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_ThreeThreadsAlternating_nonterminating.bpl' [2023-10-12 17:36:39,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:36:39,233 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:36:39,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:39,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:36:39,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:36:39,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:39,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:39,254 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:36:39,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:36:39,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:36:39,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:36:39,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:36:39,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:39,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:39,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:39,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:39,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:39,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:39,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:39,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:39,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:36:39,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:36:39,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:36:39,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:36:39,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/1) ... [2023-10-12 17:36:39,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:39,294 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:39,300 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:39,322 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2023-10-12 17:36:39,323 INFO L130 BoogieDeclarations]: Found specification of procedure one [2023-10-12 17:36:39,325 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2023-10-12 17:36:39,326 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:36:39,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:36:39,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:36:39,326 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2023-10-12 17:36:39,326 INFO L130 BoogieDeclarations]: Found specification of procedure three [2023-10-12 17:36:39,327 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2023-10-12 17:36:39,327 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2023-10-12 17:36:39,327 INFO L130 BoogieDeclarations]: Found specification of procedure two [2023-10-12 17:36:39,327 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2023-10-12 17:36:39,328 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:39,360 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:36:39,362 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:36:39,420 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:36:39,424 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:36:39,424 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:36:39,426 INFO L201 PluginConnector]: Adding new model concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:39 BoogieIcfgContainer [2023-10-12 17:36:39,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:36:39,426 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:36:39,426 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:36:39,429 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:36:39,429 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:39,429 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:36:39" (1/2) ... [2023-10-12 17:36:39,430 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d52addb and model type concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:36:39, skipping insertion in model container [2023-10-12 17:36:39,430 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:36:39,431 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:36:39" (2/2) ... [2023-10-12 17:36:39,432 INFO L332 chiAutomizerObserver]: Analyzing ICFG concurrent_ThreeThreadsAlternating_nonterminating.bpl [2023-10-12 17:36:39,475 INFO L144 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2023-10-12 17:36:39,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 32 transitions, 106 flow [2023-10-12 17:36:39,523 INFO L124 PetriNetUnfolderBase]: 8/29 cut-off events. [2023-10-12 17:36:39,524 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:36:39,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 29 events. 8/29 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 26. Up to 6 conditions per place. [2023-10-12 17:36:39,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 32 transitions, 106 flow [2023-10-12 17:36:39,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 26 transitions, 88 flow [2023-10-12 17:36:39,532 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:36:39,542 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 26 transitions, 88 flow [2023-10-12 17:36:39,544 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 88 flow [2023-10-12 17:36:39,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 88 flow [2023-10-12 17:36:39,553 INFO L124 PetriNetUnfolderBase]: 8/29 cut-off events. [2023-10-12 17:36:39,553 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:36:39,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 29 events. 8/29 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 26. Up to 6 conditions per place. [2023-10-12 17:36:39,554 INFO L119 LiptonReduction]: Number of co-enabled transitions 216 [2023-10-12 17:36:39,619 INFO L134 LiptonReduction]: Checked pairs total: 432 [2023-10-12 17:36:39,619 INFO L136 LiptonReduction]: Total number of compositions: 3 [2023-10-12 17:36:39,628 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:36:39,629 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:36:39,629 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:36:39,629 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:36:39,629 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:36:39,629 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:36:39,629 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:36:39,629 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:36:39,629 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 23 transitions, 82 flow [2023-10-12 17:36:39,632 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][16], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][9]][3:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][5], 4:4A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][3]] [2023-10-12 17:36:39,633 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:39,633 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:36:39,633 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:39,634 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:39,636 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:36:39,636 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 23 transitions, 82 flow [2023-10-12 17:36:39,637 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][16], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][9]][3:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][5], 4:4A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][3]] [2023-10-12 17:36:39,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:39,637 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:36:39,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:36:39,637 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:39,641 INFO L748 eck$LassoCheckResult]: Stem: 34#[$Ultimate##0]true [41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 36#[L8]true [63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 38#[L8-1, L19]true [2023-10-12 17:36:39,641 INFO L750 eck$LassoCheckResult]: Loop: 38#[L8-1, L19]true [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 41#[L20, L8-1]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 38#[L8-1, L19]true [2023-10-12 17:36:39,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2295, now seen corresponding path program 1 times [2023-10-12 17:36:39,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:39,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628869226] [2023-10-12 17:36:39,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:39,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:39,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2023-10-12 17:36:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:39,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404160452] [2023-10-12 17:36:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:39,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:39,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:39,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2207097, now seen corresponding path program 1 times [2023-10-12 17:36:39,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:39,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788428064] [2023-10-12 17:36:39,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:39,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:39,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:39,770 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:39,770 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:39,770 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:39,771 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:39,771 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:39,771 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,771 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:39,771 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:39,771 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:36:39,771 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:39,771 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:39,792 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,836 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:39,837 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:39,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:39,919 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:39,920 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:39,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:39,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:39,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:36:39,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:39,941 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:39,941 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:39,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:39,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:39,962 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:39,973 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:39,974 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:39,974 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:39,974 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:39,974 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:39,974 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:39,974 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:39,974 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:39,974 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:39,974 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:36:39,974 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:39,975 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:39,975 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,998 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:40,001 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:40,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:40,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:40,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:36:40,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:40,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:40,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:40,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:40,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:40,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:40,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:40,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:40,025 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:40,031 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:40,031 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:40,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:40,033 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:40,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:36:40,137 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:40,137 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:40,138 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:40,138 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2023-10-12 17:36:40,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:36:40,146 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:40,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:40,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:40,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:40,180 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:40,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:40,242 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,396 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:40,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2023-10-12 17:36:40,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:36:40,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:40,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:36:40,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:40,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:36:40,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:40,409 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 115 transitions, 640 flow [2023-10-12 17:36:40,409 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:36:40,409 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 115 transitions, 640 flow [2023-10-12 17:36:40,416 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][84], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][49], 3:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][25], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][77]][21:5A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][17], 24:6A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][25]] [2023-10-12 17:36:40,428 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:40,429 INFO L124 PetriNetUnfolderBase]: 34/59 cut-off events. [2023-10-12 17:36:40,429 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-10-12 17:36:40,429 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:40,429 INFO L748 eck$LassoCheckResult]: Stem: 34#[$Ultimate##0]true [41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 36#[L8]true [63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 38#[L8-1, L19]true [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 41#[L20, L8-1]true [66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 84#[L9, L20, L27]true [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 86#[L9, L20, L28]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 88#[L9, L28, L19]true [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 90#[L9, L27, L19]true [2023-10-12 17:36:40,429 INFO L750 eck$LassoCheckResult]: Loop: 90#[L9, L27, L19]true [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 88#[L9, L28, L19]true [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 90#[L9, L27, L19]true [2023-10-12 17:36:40,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1327591771, now seen corresponding path program 1 times [2023-10-12 17:36:40,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:40,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254637118] [2023-10-12 17:36:40,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:40,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:40,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:40,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254637118] [2023-10-12 17:36:40,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254637118] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:40,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:40,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:36:40,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098949823] [2023-10-12 17:36:40,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:40,484 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:36:40,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2819, now seen corresponding path program 1 times [2023-10-12 17:36:40,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:40,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663720767] [2023-10-12 17:36:40,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:40,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:40,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:40,508 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:40,509 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:40,509 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:40,509 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:40,509 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:40,509 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,509 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:40,509 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:40,509 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:36:40,509 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:40,509 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:40,510 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:40,526 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:40,526 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:40,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:40,527 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:40,529 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:40,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:40,531 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:40,555 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:40,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:40,556 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:40,557 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:40,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:40,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:40,576 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:40,580 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:40,581 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:40,581 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:40,581 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:40,581 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:40,581 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:40,582 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,582 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:40,582 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:40,582 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:36:40,582 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:40,582 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:40,582 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:36:40,598 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:40,599 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:40,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:40,600 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:40,603 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:40,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:36:40,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:40,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:40,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:40,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:40,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:40,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:40,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:40,627 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:40,629 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:40,629 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:40,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:40,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:40,630 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:40,631 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:40,634 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:40,635 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:40,635 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:40,635 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 5 Supporting invariants [] [2023-10-12 17:36:40,638 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:40,639 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:40,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:40,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:40,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:40,667 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:40,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:40,681 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,819 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,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2023-10-12 17:36:40,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 167 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:36:40,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:40,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 167 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:36:40,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:40,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 167 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:36:40,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:40,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:40,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:36:40,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:36:40,828 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 35 places, 690 transitions, 5220 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:40,828 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:40,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:40,977 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:40,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:41,074 INFO L124 PetriNetUnfolderBase]: 1084/1683 cut-off events. [2023-10-12 17:36:41,074 INFO L125 PetriNetUnfolderBase]: For 812/812 co-relation queries the response was YES. [2023-10-12 17:36:41,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7253 conditions, 1683 events. 1084/1683 cut-off events. For 812/812 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7487 event pairs, 65 based on Foata normal form. 0/1334 useless extension candidates. Maximal degree in co-relation 5551. Up to 1305 conditions per place. [2023-10-12 17:36:41,095 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 221 selfloop transitions, 29 changer transitions 0/250 dead transitions. [2023-10-12 17:36:41,095 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 37 places, 250 transitions, 2372 flow [2023-10-12 17:36:41,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:36:41,097 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 250 transitions, 2372 flow [2023-10-12 17:36:41,097 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:36:41,097 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 37 places, 250 transitions, 2372 flow [2023-10-12 17:36:41,099 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3]][10:4A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 11:5A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,100 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6]][22:5A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 23:6A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,103 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 24:5A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][12]][48:6A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 49:7A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,104 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 25:5A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][13]][50:6A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 52:7A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,107 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 24:5A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][12], 70:6A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][13]][95:7A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 96:8A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,110 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 25:5A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][13], 71:6A:[81] L35-->threeEXIT: Formula: (not (= v_x_45 3)) InVars {x=v_x_45} OutVars{x=v_x_45} AuxVars[] AssignedVars[][22]][109:7A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 113:8A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,113 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 22:5A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 60:6A:[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[][20], 126:7A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][27]][151:8A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 154:9A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,121 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 24:5A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][12], 70:6A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][13], 129:7A:[81] L35-->threeEXIT: Formula: (not (= v_x_45 3)) InVars {x=v_x_45} OutVars{x=v_x_45} AuxVars[] AssignedVars[][22]][157:8A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 159:9A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,122 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 24:5A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][12], 70:6A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][13], 130:7A:[71] twoEXIT-->L11: Formula: (= v_twoThread1of1ForFork1_thidvar0_4 1) InVars {twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_4} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][36]][167:8A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 171:9A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,125 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 25:5A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][13], 71:6A:[81] L35-->threeEXIT: Formula: (not (= v_x_45 3)) InVars {x=v_x_45} OutVars{x=v_x_45} AuxVars[] AssignedVars[][22], 132:7A:[70] threeEXIT-->L11: Formula: (= v_threeThread1of1ForFork2_thidvar0_4 1) InVars {threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][37]][196:8A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 200:9A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,126 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 25:5A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][13]][50:6A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 114:7A:[54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[][31], 206:8A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][27], 207:9A:[56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x][56]] [2023-10-12 17:36:41,129 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 22:5A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 60:6A:[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[][20], 126:7A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][27], 191:8A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][13]][247:9A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 252:10A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,129 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 25:5A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][13], 50:6A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 114:7A:[54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[][31], 206:8A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][27]][253:9A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 258:10A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,131 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 24:5A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][12], 70:6A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][13], 129:7A:[81] L35-->threeEXIT: Formula: (not (= v_x_45 3)) InVars {x=v_x_45} OutVars{x=v_x_45} AuxVars[] AssignedVars[][22], 236:8A:[71] twoEXIT-->L11: Formula: (= v_twoThread1of1ForFork1_thidvar0_4 1) InVars {twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_4} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][36]][268:9A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 270:10A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,131 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 24:5A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][12], 70:6A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][13], 129:7A:[81] L35-->threeEXIT: Formula: (not (= v_x_45 3)) InVars {x=v_x_45} OutVars{x=v_x_45} AuxVars[] AssignedVars[][22], 237:8A:[70] threeEXIT-->L11: Formula: (= v_threeThread1of1ForFork2_thidvar0_4 1) InVars {threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][37]][271:9A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 274:10A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][15]] [2023-10-12 17:36:41,132 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 24:5A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][12], 70:6A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][13]][95:7A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 160:8A:[54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[][31], 283:9A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][27], 284:10A:[56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x][56]] [2023-10-12 17:36:41,140 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 9:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][6], 22:5A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][7], 60:6A:[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[][20], 128:7A:[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x][33], 215:8A:[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[][48]][378:9A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][68], 380:10A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][74]] [2023-10-12 17:36:41,141 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:41,141 INFO L124 PetriNetUnfolderBase]: 245/379 cut-off events. [2023-10-12 17:36:41,141 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2023-10-12 17:36:41,142 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:41,142 INFO L748 eck$LassoCheckResult]: Stem: 34#[$Ultimate##0]true [41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 36#[L8]true [63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 38#[L8-1, L19]true [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 41#[L20, L8-1]true [66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 84#[L9, L20, L27]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 90#[L9, L27, L19]true [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 88#[L9, L28, L19]true [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 90#[L9, L27, L19]true [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 88#[L9, L28, L19]true [2023-10-12 17:36:41,143 INFO L750 eck$LassoCheckResult]: Loop: 88#[L9, L28, L19]true [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 86#[L9, L20, L28]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 88#[L9, L28, L19]true [2023-10-12 17:36:41,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1794500981, now seen corresponding path program 2 times [2023-10-12 17:36:41,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258177509] [2023-10-12 17:36:41,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,170 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:41,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:41,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258177509] [2023-10-12 17:36:41,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258177509] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:41,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:41,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:36:41,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092295448] [2023-10-12 17:36:41,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:41,174 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:36:41,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2023-10-12 17:36:41,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:41,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377491493] [2023-10-12 17:36:41,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:41,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:41,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:41,193 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,193 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,193 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,193 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,193 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:36:41,193 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,193 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,193 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,193 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:36:41,193 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,193 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,194 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,206 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,207 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:36:41,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,208 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:41,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:36:41,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:36:41,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:36:41,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,237 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:41,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:36:41,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:36:41,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:36:41,257 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:36:41,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:41,269 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:36:41,269 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:36:41,269 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:36:41,269 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:36:41,269 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:36:41,269 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,269 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:36:41,269 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:36:41,269 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:36:41,270 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:36:41,270 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:36:41,270 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,290 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:36:41,291 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:36:41,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,292 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:41,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:36:41,295 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,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:36:41,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:36:41,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:36:41,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:36:41,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:36:41,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:36:41,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:36:41,313 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:36:41,314 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:36:41,314 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:36:41,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:36:41,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:36:41,316 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:36:41,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:36:41,321 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:36:41,321 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:36:41,322 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:36:41,322 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2023-10-12 17:36:41,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:36:41,333 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:36:41,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,367 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,375 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,375 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:41,465 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:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2023-10-12 17:36:41,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:36:41,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,467 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:36:41,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,492 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,500 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,501 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:41,569 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:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2023-10-12 17:36:41,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:36:41,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,572 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:36:41,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:41,605 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:36:41,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:36:41,613 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,614 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:41,615 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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,713 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 334 transitions. [2023-10-12 17:36:41,714 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:36:41,731 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:36:41,732 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:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2023-10-12 17:36:41,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 133 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:36:41,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 133 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:36:41,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 133 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:36:41,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:36:41,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:41,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:36:41,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:36:41,733 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 55 places, 4650 transitions, 53940 flow. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:41,733 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:41,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:42,008 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:42,811 INFO L124 PetriNetUnfolderBase]: 1570/2543 cut-off events. [2023-10-12 17:36:42,811 INFO L125 PetriNetUnfolderBase]: For 1286/1286 co-relation queries the response was YES. [2023-10-12 17:36:42,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16095 conditions, 2543 events. 1570/2543 cut-off events. For 1286/1286 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13153 event pairs, 9 based on Foata normal form. 0/2041 useless extension candidates. Maximal degree in co-relation 12301. Up to 2073 conditions per place. [2023-10-12 17:36:42,829 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 536 selfloop transitions, 81 changer transitions 100/717 dead transitions. [2023-10-12 17:36:42,829 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 47 places, 717 transitions, 9660 flow [2023-10-12 17:36:42,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:36:42,830 INFO L430 stractBuchiCegarLoop]: Abstraction has has 47 places, 717 transitions, 9660 flow [2023-10-12 17:36:42,830 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:36:42,830 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 47 places, 717 transitions, 9660 flow [2023-10-12 17:36:42,833 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 6:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][4]][17:4A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][10], 18:5A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][21]] [2023-10-12 17:36:42,834 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 11:4A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7]][26:5A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][17], 27:6A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][30]] [2023-10-12 17:36:42,835 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 8:4A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][5], 22:5A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][14]][47:6A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][10], 48:7A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][21]] [2023-10-12 17:36:42,836 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 11:4A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7], 28:5A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][18]][60:6A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][10], 62:7A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][21]] [2023-10-12 17:36:42,839 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 8:4A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][5], 19:5A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][12], 43:6A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7]][88:7A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][17], 89:8A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][30]] [2023-10-12 17:36:42,841 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 13:4A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][8], 30:5A:[81] L35-->threeEXIT: Formula: (not (= v_x_45 3)) InVars {x=v_x_45} OutVars{x=v_x_45} AuxVars[] AssignedVars[][19], 58:6A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7]][113:7A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][17], 115:8A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][30]] [2023-10-12 17:36:42,845 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 8:4A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][5], 19:5A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][12], 43:6A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7], 90:7A:[81] L35-->threeEXIT: Formula: (not (= v_x_45 3)) InVars {x=v_x_45} OutVars{x=v_x_45} AuxVars[] AssignedVars[][43]][160:8A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][10], 161:9A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][21]] [2023-10-12 17:36:42,846 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 8:4A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][5], 19:5A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][12], 43:6A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7], 91:7A:[71] twoEXIT-->L11: Formula: (= v_twoThread1of1ForFork1_thidvar0_4 1) InVars {twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_4} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][44]][162:8A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][10], 164:9A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][21]] [2023-10-12 17:36:42,848 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 13:4A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][8], 30:5A:[81] L35-->threeEXIT: Formula: (not (= v_x_45 3)) InVars {x=v_x_45} OutVars{x=v_x_45} AuxVars[] AssignedVars[][19], 58:6A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7], 116:7A:[70] threeEXIT-->L11: Formula: (= v_threeThread1of1ForFork2_thidvar0_4 1) InVars {threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][47]][186:8A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][10], 188:9A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][21]] [2023-10-12 17:36:42,852 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 11:4A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7], 26:5A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][17], 63:6A:[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[][27], 134:7A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][54]][237:8A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][97], 241:9A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][165]] [2023-10-12 17:36:42,855 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 13:4A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][8], 30:5A:[81] L35-->threeEXIT: Formula: (not (= v_x_45 3)) InVars {x=v_x_45} OutVars{x=v_x_45} AuxVars[] AssignedVars[][19], 44:6A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][5], 93:7A:[71] twoEXIT-->L11: Formula: (= v_twoThread1of1ForFork1_thidvar0_4 1) InVars {twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_4} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][41], 157:8A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7]][274:9A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][17], 275:10A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][30]] [2023-10-12 17:36:42,855 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 13:4A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][8], 30:5A:[81] L35-->threeEXIT: Formula: (not (= v_x_45 3)) InVars {x=v_x_45} OutVars{x=v_x_45} AuxVars[] AssignedVars[][19], 44:6A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][5], 96:7A:[70] threeEXIT-->L11: Formula: (= v_threeThread1of1ForFork2_thidvar0_4 1) InVars {threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][45], 158:8A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7]][276:9A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][17], 278:10A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][30]] [2023-10-12 17:36:42,865 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 11:4A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7], 28:5A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][18], 60:6A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][10], 130:7A:[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[][50], 226:8A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][90]][394:9A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][97], 400:10A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][165]] [2023-10-12 17:36:42,869 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 13:4A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][8], 30:5A:[81] L35-->threeEXIT: Formula: (not (= v_x_45 3)) InVars {x=v_x_45} OutVars{x=v_x_45} AuxVars[] AssignedVars[][19], 44:6A:[80] L27-->twoEXIT: Formula: (not (= v_x_31 2)) InVars {x=v_x_31} OutVars{x=v_x_31} AuxVars[] AssignedVars[][5], 93:7A:[71] twoEXIT-->L11: Formula: (= v_twoThread1of1ForFork1_thidvar0_4 1) InVars {twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_4} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][41], 157:8A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7], 279:9A:[73] threeEXIT-->L12: Formula: (= v_threeThread1of1ForFork2_thidvar0_6 2) InVars {threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_6} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_6} AuxVars[] AssignedVars[][115]][443:10A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][10], 444:11A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][21]] [2023-10-12 17:36:42,875 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 13:4A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][8], 30:5A:[81] L35-->threeEXIT: Formula: (not (= v_x_45 3)) InVars {x=v_x_45} OutVars{x=v_x_45} AuxVars[] AssignedVars[][19], 58:6A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7], 113:7A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][17], 189:8A:[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[][27], 310:9A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][54]][490:10A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][97], 494:11A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][165]] [2023-10-12 17:36:42,880 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 11:4A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][7], 28:5A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][18], 60:6A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][10], 121:7A:[54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[][48], 207:8A:[56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x][79], 349:9A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][137]][554:10A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][211], 556:11A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][282]] [2023-10-12 17:36:42,881 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:42,881 INFO L124 PetriNetUnfolderBase]: 341/555 cut-off events. [2023-10-12 17:36:42,881 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2023-10-12 17:36:42,881 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:42,882 INFO L748 eck$LassoCheckResult]: Stem: 34#[$Ultimate##0]true [41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 36#[L8]true [63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 38#[L8-1, L19]true [66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 90#[L9, L27, L19]true [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 84#[L9, L20, L27]true [69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 287#[L27, L20, L10, L35]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 289#[L27, L10, L19, L35]true [54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[] 291#[L27, L10, L19, L36]true [56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x] 289#[L27, L10, L19, L35]true [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 287#[L27, L20, L10, L35]true [2023-10-12 17:36:42,882 INFO L750 eck$LassoCheckResult]: Loop: 287#[L27, L20, L10, L35]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 289#[L27, L10, L19, L35]true [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 287#[L27, L20, L10, L35]true [2023-10-12 17:36:42,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1077650362, now seen corresponding path program 1 times [2023-10-12 17:36:42,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:42,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531884078] [2023-10-12 17:36:42,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:42,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:42,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:42,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531884078] [2023-10-12 17:36:42,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531884078] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:42,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:42,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:36:42,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310746420] [2023-10-12 17:36:42,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:42,912 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:36:42,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:42,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 3 times [2023-10-12 17:36:42,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:42,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493624127] [2023-10-12 17:36:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:42,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:42,922 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:42,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:42,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493624127] [2023-10-12 17:36:42,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493624127] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:42,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:42,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:36:42,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934358199] [2023-10-12 17:36:42,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:42,923 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:36:42,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:42,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:36:42,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:36:42,923 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 47 places, 717 transitions, 9660 flow. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:42,923 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:42,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:43,144 INFO L124 PetriNetUnfolderBase]: 1195/1990 cut-off events. [2023-10-12 17:36:43,144 INFO L125 PetriNetUnfolderBase]: For 1110/1110 co-relation queries the response was YES. [2023-10-12 17:36:43,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14617 conditions, 1990 events. 1195/1990 cut-off events. For 1110/1110 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9643 event pairs, 3 based on Foata normal form. 0/1690 useless extension candidates. Maximal degree in co-relation 11065. Up to 1665 conditions per place. [2023-10-12 17:36:43,158 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 418 selfloop transitions, 32 changer transitions 72/522 dead transitions. [2023-10-12 17:36:43,158 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 46 places, 522 transitions, 8127 flow [2023-10-12 17:36:43,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:36:43,158 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 522 transitions, 8127 flow [2023-10-12 17:36:43,158 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:36:43,159 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 46 places, 522 transitions, 8127 flow [2023-10-12 17:36:43,208 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 3:3A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][2], 9:4A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][6], 21:5A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][14], 48:6A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][11], 97:7A:[54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[][44], 182:8A:[56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x][73]][301:9A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][123], 466:10A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][179], 627:11A:[54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[][220], 629:12A:[56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x][258]] [2023-10-12 17:36:43,208 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:43,208 INFO L124 PetriNetUnfolderBase]: 371/628 cut-off events. [2023-10-12 17:36:43,208 INFO L125 PetriNetUnfolderBase]: For 379/379 co-relation queries the response was YES. [2023-10-12 17:36:43,208 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:43,209 INFO L748 eck$LassoCheckResult]: Stem: 34#[$Ultimate##0]true [41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 36#[L8]true [63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 38#[L8-1, L19]true [66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 90#[L9, L27, L19]true [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 84#[L9, L20, L27]true [69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 287#[L27, L20, L10, L35]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 289#[L27, L10, L19, L35]true [54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[] 291#[L27, L10, L19, L36]true [56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x] 289#[L27, L10, L19, L35]true [2023-10-12 17:36:43,209 INFO L750 eck$LassoCheckResult]: Loop: 289#[L27, L10, L19, L35]true [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 287#[L27, L20, L10, L35]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 289#[L27, L10, L19, L35]true [54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[] 291#[L27, L10, L19, L36]true [56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x] 289#[L27, L10, L19, L35]true [2023-10-12 17:36:43,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1350710408, now seen corresponding path program 2 times [2023-10-12 17:36:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:43,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276337000] [2023-10-12 17:36:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:43,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:43,220 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:43,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:43,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276337000] [2023-10-12 17:36:43,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276337000] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:43,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:43,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:36:43,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073948439] [2023-10-12 17:36:43,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:43,221 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:36:43,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2464773, now seen corresponding path program 1 times [2023-10-12 17:36:43,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:43,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641829692] [2023-10-12 17:36:43,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:43,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:36:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:36:43,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:36:43,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641829692] [2023-10-12 17:36:43,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641829692] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:36:43,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:36:43,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:36:43,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737505695] [2023-10-12 17:36:43,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:36:43,229 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:36:43,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:36:43,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:36:43,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:36:43,230 INFO L103 encePairwiseOnDemand]: Start rabinDifferencePairwiseOnDemand. First operand has 46 places, 522 transitions, 8127 flow. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:36:43,230 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:36:43,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:36:43,348 INFO L124 PetriNetUnfolderBase]: 625/1092 cut-off events. [2023-10-12 17:36:43,348 INFO L125 PetriNetUnfolderBase]: For 722/722 co-relation queries the response was YES. [2023-10-12 17:36:43,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9207 conditions, 1092 events. 625/1092 cut-off events. For 722/722 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4836 event pairs, 2 based on Foata normal form. 0/952 useless extension candidates. Maximal degree in co-relation 5989. Up to 812 conditions per place. [2023-10-12 17:36:43,356 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 269 selfloop transitions, 13 changer transitions 41/323 dead transitions. [2023-10-12 17:36:43,356 INFO L145 encePairwiseOnDemand]: Finished rabinDifferencePairwiseOnDemand. Result has 48 places, 323 transitions, 5762 flow [2023-10-12 17:36:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:36:43,357 INFO L430 stractBuchiCegarLoop]: Abstraction has has 48 places, 323 transitions, 5762 flow [2023-10-12 17:36:43,357 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:36:43,357 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 48 places, 323 transitions, 5762 flow [2023-10-12 17:36:43,422 ERROR L47 etriNetUnfolderRabin]: [1:1A:[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x][0], 2:2A:[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0][1], 4:3A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][3], 10:4A:[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0][7], 29:5A:[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0][17], 45:6A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][6], 90:7A:[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[][42], 167:8A:[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x][66], 264:9A:[54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[][103], 388:10A:[56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x][139]][482:11A:[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[][169], 563:12A:[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x][192], 638:13A:[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[][199], 719:14A:[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x][223], 829:15A:[54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[][247], 831:16A:[56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x][277]] [2023-10-12 17:36:43,422 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:36:43,422 INFO L124 PetriNetUnfolderBase]: 479/830 cut-off events. [2023-10-12 17:36:43,422 INFO L125 PetriNetUnfolderBase]: For 544/544 co-relation queries the response was YES. [2023-10-12 17:36:43,422 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:36:43,423 INFO L748 eck$LassoCheckResult]: Stem: 34#[$Ultimate##0]true [41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 36#[L8]true [63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0] 38#[L8-1, L19]true [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 41#[L20, L8-1]true [66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0] 84#[L9, L20, L27]true [69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 287#[L27, L20, L10, L35]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 289#[L27, L10, L19, L35]true [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 333#[L10, L28, L19, L35]true [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 289#[L27, L10, L19, L35]true [54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[] 291#[L27, L10, L19, L36]true [56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x] 289#[L27, L10, L19, L35]true [2023-10-12 17:36:43,423 INFO L750 eck$LassoCheckResult]: Loop: 289#[L27, L10, L19, L35]true [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 287#[L27, L20, L10, L35]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 289#[L27, L10, L19, L35]true [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 333#[L10, L28, L19, L35]true [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 289#[L27, L10, L19, L35]true [54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[] 291#[L27, L10, L19, L36]true [56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x] 289#[L27, L10, L19, L35]true [2023-10-12 17:36:43,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:43,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1752458534, now seen corresponding path program 1 times [2023-10-12 17:36:43,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:43,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264756152] [2023-10-12 17:36:43,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:43,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:43,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1926195705, now seen corresponding path program 1 times [2023-10-12 17:36:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774252030] [2023-10-12 17:36:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:43,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:36:43,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1732831776, now seen corresponding path program 2 times [2023-10-12 17:36:43,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:36:43,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374162778] [2023-10-12 17:36:43,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:36:43,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:36:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:36:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:36:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:36:43,488 INFO L201 PluginConnector]: Adding new model concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:36:43 BoogieIcfgContainer [2023-10-12 17:36:43,488 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:36:43,489 INFO L158 Benchmark]: Toolchain (without parser) took 4256.17ms. Allocated memory was 207.6MB in the beginning and 402.7MB in the end (delta: 195.0MB). Free memory was 158.9MB in the beginning and 160.3MB in the end (delta: -1.4MB). Peak memory consumption was 193.9MB. Max. memory is 8.0GB. [2023-10-12 17:36:43,489 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.40ms. Allocated memory is still 207.6MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:36:43,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.97ms. Allocated memory is still 207.6MB. Free memory was 158.7MB in the beginning and 157.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:43,492 INFO L158 Benchmark]: Boogie Preprocessor took 14.38ms. Allocated memory is still 207.6MB. Free memory was 157.2MB in the beginning and 156.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:36:43,492 INFO L158 Benchmark]: RCFGBuilder took 153.93ms. Allocated memory is still 207.6MB. Free memory was 156.1MB in the beginning and 147.4MB in the end (delta: 8.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:36:43,492 INFO L158 Benchmark]: BuchiAutomizer took 4062.09ms. Allocated memory was 207.6MB in the beginning and 402.7MB in the end (delta: 195.0MB). Free memory was 147.2MB in the beginning and 160.3MB in the end (delta: -13.1MB). Peak memory consumption was 182.4MB. Max. memory is 8.0GB. [2023-10-12 17:36:43,493 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.40ms. Allocated memory is still 207.6MB. Free memory is still 159.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.97ms. Allocated memory is still 207.6MB. Free memory was 158.7MB in the beginning and 157.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.38ms. Allocated memory is still 207.6MB. Free memory was 157.2MB in the beginning and 156.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 153.93ms. Allocated memory is still 207.6MB. Free memory was 156.1MB in the beginning and 147.4MB in the end (delta: 8.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 4062.09ms. Allocated memory was 207.6MB in the beginning and 402.7MB in the end (delta: 195.0MB). Free memory was 147.2MB in the beginning and 160.3MB in the end (delta: -13.1MB). Peak memory consumption was 182.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 3 + -2 * x and consists of 4 locations. One deterministic module has affine ranking function 5 + -2 * x and consists of 5 locations. One nondeterministic module has affine ranking function 3 + -2 * x and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 5762 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 6 iterations. TraceHistogramMax:0. Analysis of lassos took 1.0s. Construction of modules took 0.3s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 581 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 438 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 778 IncrementalHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 274 mSDtfsCounter, 778 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI2 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq200 hnf87 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 136ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 19]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 one(); VAL [x=1] [L19] COND TRUE 1 x == 1 VAL [x=1] [L9] FORK 0 fork 2 two(); VAL [x=1] [L10] FORK 0 fork 3 three(); VAL [x=1] [L20] 1 x := 2; VAL [x=2] [L27] COND TRUE 2 x == 2 VAL [x=2] [L28] 2 x := 3; VAL [x=3] [L35] COND TRUE 3 x == 3 VAL [x=3] [L36] 3 x := 1; VAL [x=1] Loop: [L19] COND TRUE x == 1 [L20] x := 2; [L27] COND TRUE x == 2 [L28] x := 3; [L35] COND TRUE x == 3 [L36] x := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 19]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 one(); VAL [x=1] [L19] COND TRUE 1 x == 1 VAL [x=1] [L9] FORK 0 fork 2 two(); VAL [x=1] [L10] FORK 0 fork 3 three(); VAL [x=1] [L20] 1 x := 2; VAL [x=2] [L27] COND TRUE 2 x == 2 VAL [x=2] [L28] 2 x := 3; VAL [x=3] [L35] COND TRUE 3 x == 3 VAL [x=3] [L36] 3 x := 1; VAL [x=1] Loop: [L19] COND TRUE x == 1 [L20] x := 2; [L27] COND TRUE x == 2 [L28] x := 3; [L35] COND TRUE x == 3 [L36] x := 1; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 27 PlacesBefore, 24 PlacesAfterwards, 26 TransitionsBefore, 23 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 432 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 365, independent: 341, independent conditional: 0, independent unconditional: 341, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 160, independent: 151, independent conditional: 0, independent unconditional: 151, 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: 160, independent: 146, independent conditional: 0, independent unconditional: 146, 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: 26, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 365, independent: 190, independent conditional: 0, independent unconditional: 190, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 160, unknown conditional: 0, unknown unconditional: 160] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, 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:36:43,512 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...