/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_FiveToOne_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:18:08,038 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:18:08,100 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,118 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:18:08,119 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:18:08,119 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:18:08,120 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:18:08,120 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:18:08,120 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:18:08,120 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:18:08,121 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:18:08,121 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:18:08,121 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:18:08,121 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:18:08,121 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:18:08,122 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:18:08,122 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:18:08,122 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:18:08,122 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:18:08,122 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:18:08,123 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:18:08,123 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:18:08,123 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:18:08,123 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:18:08,123 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:18:08,124 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:18:08,124 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:18:08,124 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:18:08,124 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:18:08,124 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:18:08,124 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:18:08,124 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:18:08,125 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:18:08,125 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:18:08,125 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,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:18:08,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:18:08,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:18:08,297 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:18:08,298 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:18:08,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_FiveToOne_nonterminating.bpl [2023-10-12 17:18:08,299 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/ConcurrentTerminationBpl/concurrent_FiveToOne_nonterminating.bpl' [2023-10-12 17:18:08,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:18:08,311 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:18:08,312 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:08,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:18:08,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:18:08,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:08" (1/1) ... [2023-10-12 17:18:08,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:08" (1/1) ... [2023-10-12 17:18:08,331 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:18:08,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:08,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:18:08,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:18:08,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:18:08,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:08" (1/1) ... [2023-10-12 17:18:08,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:08" (1/1) ... [2023-10-12 17:18:08,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:08" (1/1) ... [2023-10-12 17:18:08,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:08" (1/1) ... [2023-10-12 17:18:08,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:08" (1/1) ... [2023-10-12 17:18:08,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:08" (1/1) ... [2023-10-12 17:18:08,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:08" (1/1) ... [2023-10-12 17:18:08,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:08" (1/1) ... [2023-10-12 17:18:08,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:18:08,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:18:08,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:18:08,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:18:08,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:08" (1/1) ... [2023-10-12 17:18:08,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:08,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:08,389 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,404 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,423 INFO L124 BoogieDeclarations]: Specification and implementation of procedure once given in one single declaration [2023-10-12 17:18:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure once [2023-10-12 17:18:08,424 INFO L138 BoogieDeclarations]: Found implementation of procedure once [2023-10-12 17:18:08,424 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:18:08,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:18:08,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:18:08,425 INFO L124 BoogieDeclarations]: Specification and implementation of procedure five given in one single declaration [2023-10-12 17:18:08,425 INFO L130 BoogieDeclarations]: Found specification of procedure five [2023-10-12 17:18:08,427 INFO L138 BoogieDeclarations]: Found implementation of procedure five [2023-10-12 17:18:08,429 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,461 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:18:08,463 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:18:08,519 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:18:08,523 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:18:08,523 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:18:08,524 INFO L201 PluginConnector]: Adding new model concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:08 BoogieIcfgContainer [2023-10-12 17:18:08,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:18:08,525 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:18:08,525 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:18:08,530 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:18:08,530 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:08,530 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:08" (1/2) ... [2023-10-12 17:18:08,532 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a84ef2d and model type concurrent_FiveToOne_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,532 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:08,532 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:08" (2/2) ... [2023-10-12 17:18:08,533 INFO L332 chiAutomizerObserver]: Analyzing ICFG concurrent_FiveToOne_nonterminating.bpl [2023-10-12 17:18:08,586 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:18:08,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 20 transitions, 62 flow [2023-10-12 17:18:08,616 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-10-12 17:18:08,616 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:18:08,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 3/16 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2023-10-12 17:18:08,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 20 transitions, 62 flow [2023-10-12 17:18:08,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 16 transitions, 50 flow [2023-10-12 17:18:08,624 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:18:08,633 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 50 flow [2023-10-12 17:18:08,635 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 50 flow [2023-10-12 17:18:08,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 50 flow [2023-10-12 17:18:08,642 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-10-12 17:18:08,642 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:18:08,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 3/16 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2023-10-12 17:18:08,645 INFO L119 LiptonReduction]: Number of co-enabled transitions 56 [2023-10-12 17:18:08,716 INFO L134 LiptonReduction]: Checked pairs total: 90 [2023-10-12 17:18:08,716 INFO L136 LiptonReduction]: Total number of compositions: 4 [2023-10-12 17:18:08,725 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:18:08,725 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:18:08,725 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:18:08,725 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:18:08,725 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:18:08,725 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:18:08,725 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:18:08,725 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:18:08,726 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 places, 12 transitions, 42 flow [2023-10-12 17:18:08,728 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:08,729 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:18:08,729 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:08,730 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:08,732 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:18:08,732 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 places, 12 transitions, 42 flow [2023-10-12 17:18:08,733 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:08,733 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:18:08,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:08,733 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:08,736 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 27#[L8]true [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 29#[L17, L8-1]true [2023-10-12 17:18:08,737 INFO L750 eck$LassoCheckResult]: Loop: 29#[L17, L8-1]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 29#[L17, L8-1]true [2023-10-12 17:18:08,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1966, now seen corresponding path program 1 times [2023-10-12 17:18:08,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:08,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228040675] [2023-10-12 17:18:08,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:08,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:08,790 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:08,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:08,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:08,803 INFO L85 PathProgramCache]: Analyzing trace with hash 85, now seen corresponding path program 1 times [2023-10-12 17:18:08,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:08,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530473914] [2023-10-12 17:18:08,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:08,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:08,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:08,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:08,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:08,813 INFO L85 PathProgramCache]: Analyzing trace with hash 61000, now seen corresponding path program 1 times [2023-10-12 17:18:08,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:08,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657057626] [2023-10-12 17:18:08,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:08,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:08,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:08,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:08,891 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:08,891 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:08,891 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:08,892 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:08,892 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:18:08,892 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:08,892 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:08,892 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:08,892 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:18:08,892 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:08,892 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:08,902 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:08,933 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:08,934 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:18:08,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:08,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:08,937 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:08,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:18:08,943 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:18:08,943 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:08,964 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:08,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:08,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:08,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:08,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:18:08,968 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:18:08,968 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:08,986 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:18:09,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:09,018 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:09,018 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:09,018 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:09,018 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:09,018 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:09,018 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,019 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:09,019 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:09,019 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration1_Loop [2023-10-12 17:18:09,019 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:09,019 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:09,020 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,041 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:09,044 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:09,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,046 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,052 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,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:09,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:09,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:09,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:09,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:09,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:09,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:09,066 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,074 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:09,078 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:18:09,078 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:18:09,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,082 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,082 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,085 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:09,085 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:18:09,085 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:09,086 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 7 Supporting invariants [] [2023-10-12 17:18:09,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:09,104 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:09,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:09,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,148 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:09,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:09,149 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,168 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:18:09,169 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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,243 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 136 transitions. [2023-10-12 17:18:09,244 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:09,246 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:09,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2023-10-12 17:18:09,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:18:09,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:09,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:18:09,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:09,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:18:09,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:09,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 132 transitions, 744 flow [2023-10-12 17:18:09,268 INFO L124 PetriNetUnfolderBase]: 54/111 cut-off events. [2023-10-12 17:18:09,269 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-10-12 17:18:09,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 111 events. 54/111 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 381 event pairs, 3 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 174. Up to 24 conditions per place. [2023-10-12 17:18:09,269 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 25 places, 132 transitions, 744 flow [2023-10-12 17:18:09,272 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 25 places, 132 transitions, 744 flow [2023-10-12 17:18:09,272 INFO L430 stractBuchiCegarLoop]: Abstraction has has 25 places, 132 transitions, 744 flow [2023-10-12 17:18:09,272 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:18:09,272 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 132 transitions, 744 flow [2023-10-12 17:18:09,278 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:09,278 INFO L124 PetriNetUnfolderBase]: 23/44 cut-off events. [2023-10-12 17:18:09,278 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-10-12 17:18:09,278 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:09,279 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 27#[L8]true [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 29#[L17, L8-1]true [47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0] 74#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [2023-10-12 17:18:09,279 INFO L750 eck$LassoCheckResult]: Loop: 74#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [2023-10-12 17:18:09,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1817096117, now seen corresponding path program 1 times [2023-10-12 17:18:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:09,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657778809] [2023-10-12 17:18:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:09,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657778809] [2023-10-12 17:18:09,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657778809] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:09,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:09,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:18:09,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440605521] [2023-10-12 17:18:09,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:09,322 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:18:09,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2721, now seen corresponding path program 1 times [2023-10-12 17:18:09,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:09,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442665727] [2023-10-12 17:18:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:09,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:09,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:09,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442665727] [2023-10-12 17:18:09,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442665727] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:09,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:09,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:18:09,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2319090] [2023-10-12 17:18:09,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:09,354 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-10-12 17:18:09,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:18:09,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:18:09,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:18:09,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 132 transitions, 744 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:09,357 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:18:09,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:18:09,423 INFO L124 PetriNetUnfolderBase]: 59/142 cut-off events. [2023-10-12 17:18:09,423 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-10-12 17:18:09,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 142 events. 59/142 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 536 event pairs, 3 based on Foata normal form. 3/112 useless extension candidates. Maximal degree in co-relation 312. Up to 103 conditions per place. [2023-10-12 17:18:09,428 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 58 selfloop transitions, 10 changer transitions 10/78 dead transitions. [2023-10-12 17:18:09,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 78 transitions, 585 flow [2023-10-12 17:18:09,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 78 transitions, 585 flow [2023-10-12 17:18:09,448 INFO L124 PetriNetUnfolderBase]: 59/142 cut-off events. [2023-10-12 17:18:09,448 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-10-12 17:18:09,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 142 events. 59/142 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 539 event pairs, 3 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 312. Up to 103 conditions per place. [2023-10-12 17:18:09,448 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 26 places, 78 transitions, 585 flow [2023-10-12 17:18:09,450 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 26 places, 78 transitions, 585 flow [2023-10-12 17:18:09,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:18:09,452 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 78 transitions, 585 flow [2023-10-12 17:18:09,453 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:18:09,453 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 places, 78 transitions, 585 flow [2023-10-12 17:18:09,461 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:09,461 INFO L124 PetriNetUnfolderBase]: 22/53 cut-off events. [2023-10-12 17:18:09,461 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-10-12 17:18:09,461 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:09,462 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 27#[L8]true [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 29#[L17, L8-1]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 29#[L17, L8-1]true [47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0] 74#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [2023-10-12 17:18:09,462 INFO L750 eck$LassoCheckResult]: Loop: 74#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [2023-10-12 17:18:09,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,462 INFO L85 PathProgramCache]: Analyzing trace with hash 58622512, now seen corresponding path program 2 times [2023-10-12 17:18:09,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:09,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922428521] [2023-10-12 17:18:09,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:09,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,490 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,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:09,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922428521] [2023-10-12 17:18:09,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922428521] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:18:09,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:18:09,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-10-12 17:18:09,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322713268] [2023-10-12 17:18:09,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:18:09,491 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:18:09,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2690, now seen corresponding path program 1 times [2023-10-12 17:18:09,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:09,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317140935] [2023-10-12 17:18:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:09,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:09,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:09,522 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:09,522 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:09,522 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:09,522 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:09,522 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:18:09,522 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,522 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:09,522 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:09,522 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:18:09,522 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:09,522 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:09,523 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,538 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:09,538 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:18:09,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,540 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,542 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,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:18:09,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:09,572 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,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,575 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:09,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:18:09,579 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:18:09,579 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:09,594 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:18:09,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:09,602 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:09,602 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:09,602 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:09,602 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:09,602 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:09,602 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,602 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:09,602 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:09,602 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration3_Loop [2023-10-12 17:18:09,602 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:09,602 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:09,603 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,622 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:09,623 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:09,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,761 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:09,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:18:09,764 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,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:09,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:09,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:09,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:09,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:09,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:09,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:09,779 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:09,781 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:18:09,782 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:18:09,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:09,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:09,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:09,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:18:09,786 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:09,786 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:18:09,786 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:09,786 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2023-10-12 17:18:09,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:09,791 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:09,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:09,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:09,821 WARN L260 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:09,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:09,836 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,837 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,837 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:09,918 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 181 transitions. [2023-10-12 17:18:09,918 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:09,930 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:09,931 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,932 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:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2023-10-12 17:18:09,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:18:09,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:09,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:18:09,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:09,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:18:09,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:09,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 1196 transitions, 11440 flow [2023-10-12 17:18:09,981 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,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:10,015 INFO L124 PetriNetUnfolderBase]: 111/279 cut-off events. [2023-10-12 17:18:10,015 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2023-10-12 17:18:10,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 279 events. 111/279 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1383 event pairs, 3 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 726. Up to 178 conditions per place. [2023-10-12 17:18:10,017 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 40 places, 1196 transitions, 11440 flow [2023-10-12 17:18:10,030 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 40 places, 1196 transitions, 11440 flow [2023-10-12 17:18:10,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:18:10,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:18:10,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-10-12 17:18:10,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 1196 transitions, 11440 flow. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:10,031 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:18:10,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:18:10,103 INFO L124 PetriNetUnfolderBase]: 92/247 cut-off events. [2023-10-12 17:18:10,104 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2023-10-12 17:18:10,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 247 events. 92/247 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1166 event pairs, 0 based on Foata normal form. 11/210 useless extension candidates. Maximal degree in co-relation 893. Up to 160 conditions per place. [2023-10-12 17:18:10,107 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 95 selfloop transitions, 25 changer transitions 38/158 dead transitions. [2023-10-12 17:18:10,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 158 transitions, 1802 flow [2023-10-12 17:18:10,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 158 transitions, 1802 flow [2023-10-12 17:18:10,121 INFO L124 PetriNetUnfolderBase]: 92/247 cut-off events. [2023-10-12 17:18:10,122 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2023-10-12 17:18:10,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 247 events. 92/247 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1166 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 893. Up to 160 conditions per place. [2023-10-12 17:18:10,122 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 41 places, 158 transitions, 1802 flow [2023-10-12 17:18:10,125 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 41 places, 158 transitions, 1802 flow [2023-10-12 17:18:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:18:10,126 INFO L430 stractBuchiCegarLoop]: Abstraction has has 41 places, 158 transitions, 1802 flow [2023-10-12 17:18:10,126 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:18:10,127 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 places, 158 transitions, 1802 flow [2023-10-12 17:18:10,139 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:10,139 INFO L124 PetriNetUnfolderBase]: 58/157 cut-off events. [2023-10-12 17:18:10,139 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2023-10-12 17:18:10,140 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:10,141 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 27#[L8]true [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 29#[L17, L8-1]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 29#[L17, L8-1]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 29#[L17, L8-1]true [47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0] 74#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [52] L25-->onceEXIT: Formula: (not (= v_x_13 4)) InVars {x=v_x_13} OutVars{x=v_x_13} AuxVars[] AssignedVars[] 157#[L9, L17, onceEXIT]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 157#[L9, L17, onceEXIT]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 157#[L9, L17, onceEXIT]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 157#[L9, L17, onceEXIT]true [2023-10-12 17:18:10,141 INFO L750 eck$LassoCheckResult]: Loop: 157#[L9, L17, onceEXIT]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 157#[L9, L17, onceEXIT]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 157#[L9, L17, onceEXIT]true [2023-10-12 17:18:10,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:10,141 INFO L85 PathProgramCache]: Analyzing trace with hash 183482136, now seen corresponding path program 1 times [2023-10-12 17:18:10,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:10,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414483792] [2023-10-12 17:18:10,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:10,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-10-12 17:18:10,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:18:10,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414483792] [2023-10-12 17:18:10,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414483792] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:18:10,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931821043] [2023-10-12 17:18:10,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:10,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:18:10,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:10,199 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:18:10,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-10-12 17:18:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:10,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-10-12 17:18:10,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:18:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-10-12 17:18:10,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931821043] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:18:10,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:18:10,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-10-12 17:18:10,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305395200] [2023-10-12 17:18:10,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:18:10,256 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:18:10,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2689, now seen corresponding path program 2 times [2023-10-12 17:18:10,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:10,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272805936] [2023-10-12 17:18:10,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:10,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:10,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:10,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:10,289 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:10,289 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:10,289 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:10,289 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:10,289 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-10-12 17:18:10,289 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,289 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:10,289 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:10,289 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration4_Loop [2023-10-12 17:18:10,290 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:10,290 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:10,290 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,304 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:10,304 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-10-12 17:18:10,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:10,305 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:10,307 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:10,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-10-12 17:18:10,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:10,335 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:10,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:10,337 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:10,339 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:10,341 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-10-12 17:18:10,341 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-10-12 17:18:10,356 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-10-12 17:18:10,361 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:10,361 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:10,361 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:10,361 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:10,361 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:10,361 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:10,361 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,361 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:10,361 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:10,362 INFO L133 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_BEv2_Iteration4_Loop [2023-10-12 17:18:10,362 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:10,362 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:10,362 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,385 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:10,385 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:10,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:10,386 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:10,387 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:10,390 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,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:10,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:10,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:10,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:10,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:10,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:10,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:10,406 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:10,407 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:18:10,407 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:18:10,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:10,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:10,409 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:18:10,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:18:10,412 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:10,413 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-10-12 17:18:10,413 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:10,413 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -1*x + 3 Supporting invariants [] [2023-10-12 17:18:10,418 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:10,419 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:10,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:10,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,448 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:10,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:10,456 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:10,457 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,457 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:10,531 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 178 transitions. [2023-10-12 17:18:10,531 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:10,541 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:10,541 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,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2023-10-12 17:18:10,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:18:10,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,544 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:18:10,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:10,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,576 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:10,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:10,584 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:10,585 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:18:10,585 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:10,630 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 180 transitions. [2023-10-12 17:18:10,630 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:10,639 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:10,639 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,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2023-10-12 17:18:10,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:18:10,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,640 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:18:10,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:10,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:10,665 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:10,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:10,671 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:10,672 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:18:10,672 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:10,725 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6 states and 154 transitions. [2023-10-12 17:18:10,725 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:10,732 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:10,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2023-10-12 17:18:10,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:18:10,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 12 letters. Loop has 2 letters. [2023-10-12 17:18:10,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 88 transitions. Stem has 10 letters. Loop has 4 letters. [2023-10-12 17:18:10,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:10,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 2008 transitions, 27204 flow [2023-10-12 17:18:10,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:10,841 INFO L124 PetriNetUnfolderBase]: 156/409 cut-off events. [2023-10-12 17:18:10,841 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2023-10-12 17:18:10,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2643 conditions, 409 events. 156/409 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2280 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 1872. Up to 321 conditions per place. [2023-10-12 17:18:10,842 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 53 places, 2008 transitions, 27204 flow [2023-10-12 17:18:10,864 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 53 places, 2008 transitions, 27204 flow [2023-10-12 17:18:10,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:18:10,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:18:10,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:18:10,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 2008 transitions, 27204 flow. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:18:10,865 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:18:10,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:18:11,013 INFO L124 PetriNetUnfolderBase]: 163/452 cut-off events. [2023-10-12 17:18:11,013 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2023-10-12 17:18:11,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3380 conditions, 452 events. 163/452 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2525 event pairs, 0 based on Foata normal form. 19/363 useless extension candidates. Maximal degree in co-relation 2493. Up to 366 conditions per place. [2023-10-12 17:18:11,017 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 158 selfloop transitions, 46 changer transitions 122/326 dead transitions. [2023-10-12 17:18:11,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 326 transitions, 5050 flow [2023-10-12 17:18:11,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 326 transitions, 5050 flow [2023-10-12 17:18:11,048 INFO L124 PetriNetUnfolderBase]: 163/452 cut-off events. [2023-10-12 17:18:11,048 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2023-10-12 17:18:11,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3380 conditions, 452 events. 163/452 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2519 event pairs, 0 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 2493. Up to 366 conditions per place. [2023-10-12 17:18:11,049 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 53 places, 326 transitions, 5050 flow [2023-10-12 17:18:11,053 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 53 places, 326 transitions, 5050 flow [2023-10-12 17:18:11,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:18:11,055 INFO L430 stractBuchiCegarLoop]: Abstraction has has 53 places, 326 transitions, 5050 flow [2023-10-12 17:18:11,055 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:18:11,055 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 53 places, 326 transitions, 5050 flow [2023-10-12 17:18:11,086 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:11,086 INFO L124 PetriNetUnfolderBase]: 139/387 cut-off events. [2023-10-12 17:18:11,086 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2023-10-12 17:18:11,086 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:11,087 INFO L748 eck$LassoCheckResult]: Stem: 25#[$Ultimate##0]true [31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x] 27#[L8]true [44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0] 29#[L17, L8-1]true [47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0] 74#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [2023-10-12 17:18:11,087 INFO L750 eck$LassoCheckResult]: Loop: 74#[L9, L25, L17]true [55] L25-->L25: Formula: (and (= v_x_35 1) (= v_x_36 4)) InVars {x=v_x_36} OutVars{x=v_x_35} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [54] L17-->L17: Formula: (and (= (+ v_x_28 1) v_x_27) (< v_x_28 4)) InVars {x=v_x_28} OutVars{x=v_x_27} AuxVars[] AssignedVars[x] 74#[L9, L25, L17]true [2023-10-12 17:18:11,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:11,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1068281588, now seen corresponding path program 3 times [2023-10-12 17:18:11,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:11,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730147798] [2023-10-12 17:18:11,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:11,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:11,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:11,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2615648, now seen corresponding path program 2 times [2023-10-12 17:18:11,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:11,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513128987] [2023-10-12 17:18:11,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:11,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:11,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:11,113 INFO L85 PathProgramCache]: Analyzing trace with hash 724428499, now seen corresponding path program 4 times [2023-10-12 17:18:11,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:11,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684011791] [2023-10-12 17:18:11,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:11,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:11,229 INFO L201 PluginConnector]: Adding new model concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:18:11 BoogieIcfgContainer [2023-10-12 17:18:11,229 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:18:11,230 INFO L158 Benchmark]: Toolchain (without parser) took 2918.48ms. Allocated memory was 176.2MB in the beginning and 263.2MB in the end (delta: 87.0MB). Free memory was 130.1MB in the beginning and 234.7MB in the end (delta: -104.6MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:18:11,230 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:18:11,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.29ms. Allocated memory is still 176.2MB. Free memory was 130.0MB in the beginning and 128.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:18:11,231 INFO L158 Benchmark]: Boogie Preprocessor took 12.61ms. Allocated memory is still 176.2MB. Free memory was 128.4MB in the beginning and 127.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:18:11,231 INFO L158 Benchmark]: RCFGBuilder took 176.83ms. Allocated memory is still 176.2MB. Free memory was 127.4MB in the beginning and 118.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-10-12 17:18:11,231 INFO L158 Benchmark]: BuchiAutomizer took 2704.11ms. Allocated memory was 176.2MB in the beginning and 263.2MB in the end (delta: 87.0MB). Free memory was 118.7MB in the beginning and 235.1MB in the end (delta: -116.4MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:18:11,232 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.17ms. Allocated memory is still 176.2MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.29ms. Allocated memory is still 176.2MB. Free memory was 130.0MB in the beginning and 128.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.61ms. Allocated memory is still 176.2MB. Free memory was 128.4MB in the beginning and 127.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 176.83ms. Allocated memory is still 176.2MB. Free memory was 127.4MB in the beginning and 118.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2704.11ms. Allocated memory was 176.2MB in the beginning and 263.2MB in the end (delta: 87.0MB). Free memory was 118.7MB in the beginning and 235.1MB in the end (delta: -116.4MB). There was no memory consumed. 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 7 + -2 * x and consists of 3 locations. One deterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x + 3 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 5050 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 1.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 428 IncrementalHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 151 mSDtfsCounter, 428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI1 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital9 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq173 hnf91 smp100 dnf100 smp100 tf113 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms 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: 25]: 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 five(); VAL [x=1] [L9] FORK 0 fork 2 once(); VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=4] [L25] COND TRUE 2 x == 4 [L26] 2 x := 1; VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=4] Loop: [L25] COND TRUE x == 4 [L26] x := 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 25]: 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 five(); VAL [x=1] [L9] FORK 0 fork 2 once(); VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=4] [L25] COND TRUE 2 x == 4 [L26] 2 x := 1; VAL [x=1] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 [L18] 1 x := x + 1; VAL [x=4] Loop: [L25] COND TRUE x == 4 [L26] x := 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := 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, 19 PlacesBefore, 15 PlacesAfterwards, 16 TransitionsBefore, 12 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 90 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 42, unknown conditional: 0, unknown unconditional: 42] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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:11,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:18:11,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...