/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_ThreeThreadsAlternating_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:18:08,264 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:18:08,326 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:18:08,350 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:18:08,350 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:18:08,351 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:18:08,352 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:18:08,352 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:18:08,352 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:18:08,355 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:18:08,355 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:18:08,355 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:18:08,355 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:18:08,356 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:18:08,356 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:18:08,357 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:18:08,357 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:18:08,357 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:18:08,357 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:18:08,357 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:18:08,358 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:18:08,359 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:18:08,359 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:18:08,359 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:18:08,359 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:18:08,359 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:18:08,359 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:18:08,359 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:18:08,360 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:18:08,360 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:18:08,360 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:18:08,361 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:18:08,361 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:18:08,362 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:18:08,362 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:18:08,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:18:08,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:18:08,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:18:08,570 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:18:08,572 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:18:08,573 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:18:08,573 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_ThreeThreadsAlternating_nonterminating.bpl' [2023-10-12 17:18:08,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:18:08,589 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:18:08,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:08,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:18:08,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:18:08,599 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:18:08" (1/1) ... [2023-10-12 17:18:08,604 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:18:08" (1/1) ... [2023-10-12 17:18:08,610 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:18:08,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:08,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:18:08,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:18:08,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:18:08,619 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:18:08" (1/1) ... [2023-10-12 17:18:08,619 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:18:08" (1/1) ... [2023-10-12 17:18:08,621 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:18:08" (1/1) ... [2023-10-12 17:18:08,621 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:18:08" (1/1) ... [2023-10-12 17:18:08,623 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:18:08" (1/1) ... [2023-10-12 17:18:08,626 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:18:08" (1/1) ... [2023-10-12 17:18:08,626 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:18:08" (1/1) ... [2023-10-12 17:18:08,627 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:18:08" (1/1) ... [2023-10-12 17:18:08,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:18:08,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:18:08,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:18:08,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:18:08,630 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:18:08" (1/1) ... [2023-10-12 17:18:08,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:08,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:08,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:08,692 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2023-10-12 17:18:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure one [2023-10-12 17:18:08,692 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2023-10-12 17:18:08,692 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:18:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:18:08,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:18:08,692 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2023-10-12 17:18:08,692 INFO L130 BoogieDeclarations]: Found specification of procedure three [2023-10-12 17:18:08,693 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2023-10-12 17:18:08,693 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2023-10-12 17:18:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure two [2023-10-12 17:18:08,693 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2023-10-12 17:18:08,693 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:18:08,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:18:08,733 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:18:08,734 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:18:08,788 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:18:08,792 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:18:08,792 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:18:08,793 INFO L201 PluginConnector]: Adding new model concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:08 BoogieIcfgContainer [2023-10-12 17:18:08,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:18:08,794 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:18:08,794 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:18:08,797 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:18:08,797 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:08,798 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:18:08" (1/2) ... [2023-10-12 17:18:08,799 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79a9abbc and model type concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:18:08, skipping insertion in model container [2023-10-12 17:18:08,799 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:08,799 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:18:08" (2/2) ... [2023-10-12 17:18:08,800 INFO L332 chiAutomizerObserver]: Analyzing ICFG concurrent_ThreeThreadsAlternating_nonterminating.bpl [2023-10-12 17:18:08,847 INFO L144 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2023-10-12 17:18:08,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 32 transitions, 106 flow [2023-10-12 17:18:08,880 INFO L124 PetriNetUnfolderBase]: 8/29 cut-off events. [2023-10-12 17:18:08,881 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:18:08,884 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:18:08,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 32 transitions, 106 flow [2023-10-12 17:18:08,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 26 transitions, 88 flow [2023-10-12 17:18:08,889 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:18:08,899 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 26 transitions, 88 flow [2023-10-12 17:18:08,901 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 88 flow [2023-10-12 17:18:08,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 88 flow [2023-10-12 17:18:08,907 INFO L124 PetriNetUnfolderBase]: 8/29 cut-off events. [2023-10-12 17:18:08,907 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:18:08,907 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:18:08,908 INFO L119 LiptonReduction]: Number of co-enabled transitions 216 [2023-10-12 17:18:08,981 INFO L134 LiptonReduction]: Checked pairs total: 432 [2023-10-12 17:18:08,981 INFO L136 LiptonReduction]: Total number of compositions: 3 [2023-10-12 17:18:09,004 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:18:09,004 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:18:09,004 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:18:09,004 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:18:09,004 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:18:09,004 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:18:09,004 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:18:09,005 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:18:09,005 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 places, 23 transitions, 82 flow [2023-10-12 17:18:09,008 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:09,008 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:18:09,008 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:09,008 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:09,010 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:18:09,010 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 places, 23 transitions, 82 flow [2023-10-12 17:18:09,011 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:09,011 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:18:09,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:09,011 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:09,014 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:18:09,014 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:18:09,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2295, now seen corresponding path program 1 times [2023-10-12 17:18:09,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:09,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315918420] [2023-10-12 17:18:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:09,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:09,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2023-10-12 17:18:09,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:09,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995415635] [2023-10-12 17:18:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:09,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2207097, now seen corresponding path program 1 times [2023-10-12 17:18:09,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:09,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715025421] [2023-10-12 17:18:09,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:09,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:09,162 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:09,162 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:09,162 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:09,162 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:09,163 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:18:09,163 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,163 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:09,163 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:09,163 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:18:09,163 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:09,163 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:09,173 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:09,210 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:09,210 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:18:09,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:09,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:18:09,218 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:18:09,218 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:09,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:09,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:09,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:18:09,239 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:18:09,239 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:09,266 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:18:09,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:18:09,269 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:09,269 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:09,269 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:09,269 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:09,269 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:09,270 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,270 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:09,270 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:09,270 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:18:09,270 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:09,270 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:09,271 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:09,290 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:09,293 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:09,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:09,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:18:09,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:18:09,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:09,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:09,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:09,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:09,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:09,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:09,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:09,325 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:09,329 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:18:09,329 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:18:09,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,334 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:09,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:18:09,377 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:09,378 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:18:09,378 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:09,379 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2023-10-12 17:18:09,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:18:09,385 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:09,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:09,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,436 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:09,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:09,509 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:18:09,511 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:18:09,676 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 268 transitions. [2023-10-12 17:18:09,677 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:09,683 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:09,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:09,689 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:18:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2023-10-12 17:18:09,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:18:09,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:09,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:18:09,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:09,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:18:09,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:09,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 344 transitions, 1952 flow [2023-10-12 17:18:09,826 INFO L124 PetriNetUnfolderBase]: 888/1346 cut-off events. [2023-10-12 17:18:09,826 INFO L125 PetriNetUnfolderBase]: For 503/503 co-relation queries the response was YES. [2023-10-12 17:18:09,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3117 conditions, 1346 events. 888/1346 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6197 event pairs, 76 based on Foata normal form. 0/945 useless extension candidates. Maximal degree in co-relation 2512. Up to 299 conditions per place. [2023-10-12 17:18:09,831 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 38 places, 344 transitions, 1952 flow [2023-10-12 17:18:09,838 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 38 places, 344 transitions, 1952 flow [2023-10-12 17:18:09,839 INFO L430 stractBuchiCegarLoop]: Abstraction has has 38 places, 344 transitions, 1952 flow [2023-10-12 17:18:09,839 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:18:09,839 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 places, 344 transitions, 1952 flow [2023-10-12 17:18:09,866 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:09,866 INFO L124 PetriNetUnfolderBase]: 96/152 cut-off events. [2023-10-12 17:18:09,866 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-10-12 17:18:09,866 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:09,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:09,870 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] 96#[L9, L27, L19]true [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 98#[L9, L28, L19]true [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 96#[L9, L27, L19]true [2023-10-12 17:18:09,870 INFO L750 eck$LassoCheckResult]: Loop: 96#[L9, L27, L19]true [50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[] 102#[L9, L27, L20]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 96#[L9, L27, L19]true [2023-10-12 17:18:09,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash 68435629, now seen corresponding path program 1 times [2023-10-12 17:18:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:09,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822531071] [2023-10-12 17:18:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:09,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:09,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:09,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822531071] [2023-10-12 17:18:09,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822531071] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:09,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:09,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:18:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288171932] [2023-10-12 17:18:09,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:09,924 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:18:09,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2023-10-12 17:18:09,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:09,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367157614] [2023-10-12 17:18:09,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:09,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:09,946 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:09,946 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:09,946 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:09,946 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:09,946 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:18:09,946 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,946 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:09,946 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:09,946 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:18:09,946 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:09,946 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:09,950 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:09,966 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:09,966 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:18:09,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,967 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:09,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:18:09,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:18:09,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:09,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:09,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:10,012 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:18:10,012 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:10,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:18:10,030 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:18:10,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:10,037 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:10,037 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:10,037 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:10,037 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:10,037 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:10,037 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,037 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:10,037 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:10,037 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration2_Loop [2023-10-12 17:18:10,037 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:10,038 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:10,038 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:10,057 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:10,057 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:10,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:10,059 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:10,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:18:10,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:18:10,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:10,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:10,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:10,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:10,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:10,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:10,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:10,094 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:10,096 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:18:10,096 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:18:10,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:10,100 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:10,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:18:10,115 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:10,115 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:18:10,116 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:10,116 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2023-10-12 17:18:10,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:10,120 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:10,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:10,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,148 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:10,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:10,160 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:18:10,160 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:10,289 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 268 transitions. [2023-10-12 17:18:10,290 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:10,328 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2023-10-12 17:18:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:18:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:18:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 132 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:18:10,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 5232 transitions, 40608 flow [2023-10-12 17:18:10,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:18:10,957 INFO L124 PetriNetUnfolderBase]: 2726/4075 cut-off events. [2023-10-12 17:18:10,957 INFO L125 PetriNetUnfolderBase]: For 1630/1630 co-relation queries the response was YES. [2023-10-12 17:18:10,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13413 conditions, 4075 events. 2726/4075 cut-off events. For 1630/1630 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 22458 event pairs, 92 based on Foata normal form. 0/2755 useless extension candidates. Maximal degree in co-relation 10938. Up to 1595 conditions per place. [2023-10-12 17:18:10,961 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 52 places, 5232 transitions, 40608 flow [2023-10-12 17:18:11,015 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 52 places, 5232 transitions, 40608 flow [2023-10-12 17:18:11,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:18:11,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:18:11,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:18:11,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 5232 transitions, 40608 flow. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:11,019 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:18:11,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:18:12,272 INFO L124 PetriNetUnfolderBase]: 2905/4450 cut-off events. [2023-10-12 17:18:12,272 INFO L125 PetriNetUnfolderBase]: For 2017/2017 co-relation queries the response was YES. [2023-10-12 17:18:12,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19173 conditions, 4450 events. 2905/4450 cut-off events. For 2017/2017 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 24210 event pairs, 36 based on Foata normal form. 0/3152 useless extension candidates. Maximal degree in co-relation 15242. Up to 3041 conditions per place. [2023-10-12 17:18:12,298 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 510 selfloop transitions, 61 changer transitions 110/681 dead transitions. [2023-10-12 17:18:12,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 681 transitions, 6486 flow [2023-10-12 17:18:12,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 681 transitions, 6486 flow [2023-10-12 17:18:12,550 INFO L124 PetriNetUnfolderBase]: 2905/4450 cut-off events. [2023-10-12 17:18:12,551 INFO L125 PetriNetUnfolderBase]: For 2017/2017 co-relation queries the response was YES. [2023-10-12 17:18:12,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19173 conditions, 4450 events. 2905/4450 cut-off events. For 2017/2017 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 24224 event pairs, 36 based on Foata normal form. 0/3152 useless extension candidates. Maximal degree in co-relation 15242. Up to 3041 conditions per place. [2023-10-12 17:18:12,556 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 51 places, 681 transitions, 6486 flow [2023-10-12 17:18:12,562 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 51 places, 681 transitions, 6486 flow [2023-10-12 17:18:12,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:18:12,563 INFO L430 stractBuchiCegarLoop]: Abstraction has has 51 places, 681 transitions, 6486 flow [2023-10-12 17:18:12,564 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:18:12,564 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 places, 681 transitions, 6486 flow [2023-10-12 17:18:12,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:12,680 INFO L124 PetriNetUnfolderBase]: 945/1446 cut-off events. [2023-10-12 17:18:12,680 INFO L125 PetriNetUnfolderBase]: For 645/645 co-relation queries the response was YES. [2023-10-12 17:18:12,680 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:12,681 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] 102#[L9, L27, L20]true [69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 161#[L27, L20, L10, L35]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 163#[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[] 165#[L27, L10, L19, L36]true [56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x] 163#[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[] 161#[L27, L20, L10, L35]true [2023-10-12 17:18:12,681 INFO L750 eck$LassoCheckResult]: Loop: 161#[L27, L20, L10, L35]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 163#[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[] 161#[L27, L20, L10, L35]true [2023-10-12 17:18:12,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:12,681 INFO L85 PathProgramCache]: Analyzing trace with hash 220559770, now seen corresponding path program 1 times [2023-10-12 17:18:12,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:12,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250805668] [2023-10-12 17:18:12,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:12,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:12,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:12,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250805668] [2023-10-12 17:18:12,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250805668] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:12,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:12,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:18:12,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346935504] [2023-10-12 17:18:12,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:12,719 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:18:12,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:12,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 3 times [2023-10-12 17:18:12,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:12,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812953106] [2023-10-12 17:18:12,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:12,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:12,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:12,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812953106] [2023-10-12 17:18:12,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812953106] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:12,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:12,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:18:12,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468591199] [2023-10-12 17:18:12,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:12,738 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:18:12,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:18:12,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:18:12,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:18:12,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 681 transitions, 6486 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:18:12,739 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:18:12,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:18:13,001 INFO L124 PetriNetUnfolderBase]: 1907/3063 cut-off events. [2023-10-12 17:18:13,002 INFO L125 PetriNetUnfolderBase]: For 1621/1621 co-relation queries the response was YES. [2023-10-12 17:18:13,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16368 conditions, 3063 events. 1907/3063 cut-off events. For 1621/1621 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16644 event pairs, 30 based on Foata normal form. 0/2399 useless extension candidates. Maximal degree in co-relation 11598. Up to 2316 conditions per place. [2023-10-12 17:18:13,025 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 350 selfloop transitions, 24 changer transitions 97/471 dead transitions. [2023-10-12 17:18:13,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 471 transitions, 5481 flow [2023-10-12 17:18:13,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 471 transitions, 5481 flow [2023-10-12 17:18:13,189 INFO L124 PetriNetUnfolderBase]: 1907/3063 cut-off events. [2023-10-12 17:18:13,189 INFO L125 PetriNetUnfolderBase]: For 1621/1621 co-relation queries the response was YES. [2023-10-12 17:18:13,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16368 conditions, 3063 events. 1907/3063 cut-off events. For 1621/1621 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16642 event pairs, 30 based on Foata normal form. 0/2399 useless extension candidates. Maximal degree in co-relation 11598. Up to 2316 conditions per place. [2023-10-12 17:18:13,192 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 49 places, 471 transitions, 5481 flow [2023-10-12 17:18:13,196 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 49 places, 471 transitions, 5481 flow [2023-10-12 17:18:13,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:18:13,198 INFO L430 stractBuchiCegarLoop]: Abstraction has has 49 places, 471 transitions, 5481 flow [2023-10-12 17:18:13,198 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:18:13,198 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 places, 471 transitions, 5481 flow [2023-10-12 17:18:13,263 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:13,263 INFO L124 PetriNetUnfolderBase]: 761/1196 cut-off events. [2023-10-12 17:18:13,263 INFO L125 PetriNetUnfolderBase]: For 611/611 co-relation queries the response was YES. [2023-10-12 17:18:13,263 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:13,264 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] 102#[L9, L27, L20]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 96#[L9, L27, L19]true [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 98#[L9, L28, L19]true [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 96#[L9, L27, L19]true [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 98#[L9, L28, L19]true [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 96#[L9, L27, L19]true [2023-10-12 17:18:13,264 INFO L750 eck$LassoCheckResult]: Loop: 96#[L9, L27, L19]true [58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[] 98#[L9, L28, L19]true [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 96#[L9, L27, L19]true [2023-10-12 17:18:13,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:13,264 INFO L85 PathProgramCache]: Analyzing trace with hash 205044497, now seen corresponding path program 1 times [2023-10-12 17:18:13,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:13,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119981857] [2023-10-12 17:18:13,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:13,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:13,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:13,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119981857] [2023-10-12 17:18:13,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119981857] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:13,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:13,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:18:13,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152891266] [2023-10-12 17:18:13,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:13,299 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:18:13,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:13,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2819, now seen corresponding path program 1 times [2023-10-12 17:18:13,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:13,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831288493] [2023-10-12 17:18:13,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:13,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:13,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:13,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:13,319 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:13,320 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:13,320 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:13,320 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:13,320 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:18:13,320 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:13,320 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:13,320 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:13,320 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration4_Loop [2023-10-12 17:18:13,320 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:13,320 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:13,321 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:13,334 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:13,334 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:18:13,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:13,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:13,335 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:13,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:18:13,339 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:18:13,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:13,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:13,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:13,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:13,379 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:13,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:18:13,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:18:13,382 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:13,403 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:18:13,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:13,409 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:13,409 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:13,409 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:13,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:13,409 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:13,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:13,409 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:13,409 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:13,409 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_BEv2_Iteration4_Loop [2023-10-12 17:18:13,409 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:13,409 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:13,410 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:13,430 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:13,430 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:13,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:13,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:13,437 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:13,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:18:13,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:18:13,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:13,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:13,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:13,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:13,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:13,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:13,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:13,450 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:13,453 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:18:13,453 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:18:13,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:13,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:13,455 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:13,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:18:13,458 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:13,458 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:18:13,458 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:13,458 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 5 Supporting invariants [] [2023-10-12 17:18:13,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:13,464 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:13,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:13,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:13,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:13,493 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:13,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:13,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:18:13,500 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:18:13,500 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:18:13,622 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 338 transitions. [2023-10-12 17:18:13,622 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:13,665 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:13,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:13,668 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:18:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2023-10-12 17:18:13,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 167 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:18:13,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:13,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 167 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:18:13,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:13,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 167 transitions. Stem has 9 letters. Loop has 4 letters. [2023-10-12 17:18:13,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:13,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 9092 transitions, 124524 flow [2023-10-12 17:18:13,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:17,125 INFO L124 PetriNetUnfolderBase]: 3532/5648 cut-off events. [2023-10-12 17:18:17,125 INFO L125 PetriNetUnfolderBase]: For 2839/2839 co-relation queries the response was YES. [2023-10-12 17:18:17,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35773 conditions, 5648 events. 3532/5648 cut-off events. For 2839/2839 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 34383 event pairs, 30 based on Foata normal form. 0/4175 useless extension candidates. Maximal degree in co-relation 26120. Up to 4619 conditions per place. [2023-10-12 17:18:17,129 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 67 places, 9092 transitions, 124524 flow [2023-10-12 17:18:17,237 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 67 places, 9092 transitions, 124524 flow [2023-10-12 17:18:17,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:18:17,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:18:17,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:18:17,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 9092 transitions, 124524 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:17,238 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:18:17,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:18:20,090 INFO L124 PetriNetUnfolderBase]: 2052/3425 cut-off events. [2023-10-12 17:18:20,090 INFO L125 PetriNetUnfolderBase]: For 1993/1993 co-relation queries the response was YES. [2023-10-12 17:18:20,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25298 conditions, 3425 events. 2052/3425 cut-off events. For 1993/1993 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 19407 event pairs, 23 based on Foata normal form. 0/2748 useless extension candidates. Maximal degree in co-relation 17509. Up to 2677 conditions per place. [2023-10-12 17:18:20,109 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 379 selfloop transitions, 41 changer transitions 223/643 dead transitions. [2023-10-12 17:18:20,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 643 transitions, 10109 flow [2023-10-12 17:18:20,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 643 transitions, 10109 flow [2023-10-12 17:18:20,418 INFO L124 PetriNetUnfolderBase]: 2052/3425 cut-off events. [2023-10-12 17:18:20,418 INFO L125 PetriNetUnfolderBase]: For 1993/1993 co-relation queries the response was YES. [2023-10-12 17:18:20,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25298 conditions, 3425 events. 2052/3425 cut-off events. For 1993/1993 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 19402 event pairs, 23 based on Foata normal form. 0/2748 useless extension candidates. Maximal degree in co-relation 17509. Up to 2677 conditions per place. [2023-10-12 17:18:20,422 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 60 places, 643 transitions, 10109 flow [2023-10-12 17:18:20,430 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 60 places, 643 transitions, 10109 flow [2023-10-12 17:18:20,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:18:20,431 INFO L430 stractBuchiCegarLoop]: Abstraction has has 60 places, 643 transitions, 10109 flow [2023-10-12 17:18:20,431 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:18:20,431 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60 places, 643 transitions, 10109 flow [2023-10-12 17:18:20,588 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:20,588 INFO L124 PetriNetUnfolderBase]: 1072/1703 cut-off events. [2023-10-12 17:18:20,588 INFO L125 PetriNetUnfolderBase]: For 965/965 co-relation queries the response was YES. [2023-10-12 17:18:20,588 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:20,589 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] 102#[L9, L27, L20]true [69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 161#[L27, L20, L10, L35]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 163#[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[] 165#[L27, L10, L19, L36]true [56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x] 163#[L27, L10, L19, L35]true [2023-10-12 17:18:20,589 INFO L750 eck$LassoCheckResult]: Loop: 163#[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[] 161#[L27, L20, L10, L35]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 163#[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[] 165#[L27, L10, L19, L36]true [56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x] 163#[L27, L10, L19, L35]true [2023-10-12 17:18:20,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1794000488, now seen corresponding path program 2 times [2023-10-12 17:18:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:20,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582155692] [2023-10-12 17:18:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:20,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:20,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:20,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582155692] [2023-10-12 17:18:20,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582155692] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:20,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:20,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:18:20,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956292485] [2023-10-12 17:18:20,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:20,603 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:18:20,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:20,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2464773, now seen corresponding path program 1 times [2023-10-12 17:18:20,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:20,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480306994] [2023-10-12 17:18:20,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:20,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:20,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:20,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480306994] [2023-10-12 17:18:20,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480306994] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:20,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:20,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:18:20,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202486643] [2023-10-12 17:18:20,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:20,613 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:18:20,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:18:20,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:18:20,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:18:20,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 643 transitions, 10109 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:18:20,614 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:18:20,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:18:20,921 INFO L124 PetriNetUnfolderBase]: 1312/2221 cut-off events. [2023-10-12 17:18:20,921 INFO L125 PetriNetUnfolderBase]: For 1372/1372 co-relation queries the response was YES. [2023-10-12 17:18:20,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18751 conditions, 2221 events. 1312/2221 cut-off events. For 1372/1372 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 11685 event pairs, 23 based on Foata normal form. 0/1794 useless extension candidates. Maximal degree in co-relation 12380. Up to 1826 conditions per place. [2023-10-12 17:18:20,935 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 263 selfloop transitions, 11 changer transitions 213/487 dead transitions. [2023-10-12 17:18:20,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 487 transitions, 8698 flow [2023-10-12 17:18:20,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 487 transitions, 8698 flow [2023-10-12 17:18:21,123 INFO L124 PetriNetUnfolderBase]: 1312/2221 cut-off events. [2023-10-12 17:18:21,124 INFO L125 PetriNetUnfolderBase]: For 1372/1372 co-relation queries the response was YES. [2023-10-12 17:18:21,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18751 conditions, 2221 events. 1312/2221 cut-off events. For 1372/1372 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 11678 event pairs, 23 based on Foata normal form. 0/1794 useless extension candidates. Maximal degree in co-relation 12380. Up to 1826 conditions per place. [2023-10-12 17:18:21,126 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 62 places, 487 transitions, 8698 flow [2023-10-12 17:18:21,131 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 62 places, 487 transitions, 8698 flow [2023-10-12 17:18:21,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:18:21,132 INFO L430 stractBuchiCegarLoop]: Abstraction has has 62 places, 487 transitions, 8698 flow [2023-10-12 17:18:21,132 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:18:21,132 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 62 places, 487 transitions, 8698 flow [2023-10-12 17:18:21,298 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:21,298 INFO L124 PetriNetUnfolderBase]: 1174/1972 cut-off events. [2023-10-12 17:18:21,298 INFO L125 PetriNetUnfolderBase]: For 1196/1196 co-relation queries the response was YES. [2023-10-12 17:18:21,299 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:21,299 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] 102#[L9, L27, L20]true [69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0] 161#[L27, L20, L10, L35]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 163#[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[] 288#[L28, L10, L19, L35]true [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 163#[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[] 165#[L27, L10, L19, L36]true [56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x] 163#[L27, L10, L19, L35]true [2023-10-12 17:18:21,299 INFO L750 eck$LassoCheckResult]: Loop: 163#[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[] 161#[L27, L20, L10, L35]true [52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x] 163#[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[] 288#[L28, L10, L19, L35]true [60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x] 163#[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[] 165#[L27, L10, L19, L36]true [56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x] 163#[L27, L10, L19, L35]true [2023-10-12 17:18:21,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:21,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1752458534, now seen corresponding path program 1 times [2023-10-12 17:18:21,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:21,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512813] [2023-10-12 17:18:21,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:21,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:21,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:21,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:21,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:21,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1926195705, now seen corresponding path program 1 times [2023-10-12 17:18:21,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:21,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239785876] [2023-10-12 17:18:21,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:21,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:21,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:21,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:21,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:21,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1732831776, now seen corresponding path program 2 times [2023-10-12 17:18:21,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:21,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370550894] [2023-10-12 17:18:21,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:21,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:21,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:21,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:21,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:21,384 INFO L201 PluginConnector]: Adding new model concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:18:21 BoogieIcfgContainer [2023-10-12 17:18:21,384 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:18:21,384 INFO L158 Benchmark]: Toolchain (without parser) took 12795.13ms. Allocated memory was 181.4MB in the beginning and 1.1GB in the end (delta: 959.4MB). Free memory was 136.3MB in the beginning and 469.5MB in the end (delta: -333.2MB). Peak memory consumption was 627.7MB. Max. memory is 8.0GB. [2023-10-12 17:18:21,384 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 181.4MB. Free memory was 137.4MB in the beginning and 137.2MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:18:21,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.11ms. Allocated memory is still 181.4MB. Free memory was 136.3MB in the beginning and 134.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:18:21,385 INFO L158 Benchmark]: Boogie Preprocessor took 15.61ms. Allocated memory is still 181.4MB. Free memory was 134.7MB in the beginning and 133.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:18:21,385 INFO L158 Benchmark]: RCFGBuilder took 164.58ms. Allocated memory is still 181.4MB. Free memory was 133.6MB in the beginning and 125.1MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-10-12 17:18:21,385 INFO L158 Benchmark]: BuchiAutomizer took 12589.53ms. Allocated memory was 181.4MB in the beginning and 1.1GB in the end (delta: 959.4MB). Free memory was 125.0MB in the beginning and 469.5MB in the end (delta: -344.6MB). Peak memory consumption was 616.1MB. Max. memory is 8.0GB. [2023-10-12 17:18:21,386 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.23ms. Allocated memory is still 181.4MB. Free memory was 137.4MB in the beginning and 137.2MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.11ms. Allocated memory is still 181.4MB. Free memory was 136.3MB in the beginning and 134.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.61ms. Allocated memory is still 181.4MB. Free memory was 134.7MB in the beginning and 133.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 164.58ms. Allocated memory is still 181.4MB. Free memory was 133.6MB in the beginning and 125.1MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 12589.53ms. Allocated memory was 181.4MB in the beginning and 1.1GB in the end (delta: 959.4MB). Free memory was 125.0MB in the beginning and 469.5MB in the end (delta: -344.6MB). Peak memory consumption was 616.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 3 + -2 * x and consists of 4 locations. 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. 4 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 8698 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.5s and 6 iterations. TraceHistogramMax:0. Analysis of lassos took 0.9s. Construction of modules took 0.3s. Büchi inclusion checks took 6.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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 386 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 383 mSDsluCounter, 294 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 569 IncrementalHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 178 mSDtfsCounter, 569 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: 84ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s 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: 22, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 14, dependent conditional: 0, dependent unconditional: 14, 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:18:21,405 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...