/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/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/bigNumberOfThreads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.fs.omega-petrinet-ed1a3e5-m [2022-09-29 14:47:44,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-29 14:47:44,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-29 14:47:44,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-29 14:47:44,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-29 14:47:44,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-29 14:47:44,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-29 14:47:44,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-29 14:47:44,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-29 14:47:44,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-29 14:47:44,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-29 14:47:44,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-29 14:47:44,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-29 14:47:44,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-29 14:47:44,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-29 14:47:44,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-29 14:47:44,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-29 14:47:44,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-29 14:47:44,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-29 14:47:44,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-29 14:47:44,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-29 14:47:44,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-29 14:47:44,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-29 14:47:44,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-29 14:47:44,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-29 14:47:44,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-29 14:47:44,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-29 14:47:44,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-29 14:47:44,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-29 14:47:44,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-29 14:47:44,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-29 14:47:44,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-29 14:47:44,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-29 14:47:44,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-29 14:47:44,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-29 14:47:44,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-29 14:47:44,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-29 14:47:44,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-29 14:47:44,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-29 14:47:44,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-29 14:47:44,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-29 14:47:44,413 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-09-29 14:47:44,443 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-29 14:47:44,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-29 14:47:44,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-29 14:47:44,444 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-29 14:47:44,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-29 14:47:44,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-29 14:47:44,445 INFO L138 SettingsManager]: * Use SBE=true [2022-09-29 14:47:44,445 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-09-29 14:47:44,445 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-09-29 14:47:44,445 INFO L138 SettingsManager]: * Use old map elimination=false [2022-09-29 14:47:44,446 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-09-29 14:47:44,446 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-09-29 14:47:44,446 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-09-29 14:47:44,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-29 14:47:44,447 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-29 14:47:44,447 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-09-29 14:47:44,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-29 14:47:44,447 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-29 14:47:44,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-29 14:47:44,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-09-29 14:47:44,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-09-29 14:47:44,448 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-09-29 14:47:44,448 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-29 14:47:44,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-29 14:47:44,449 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-09-29 14:47:44,449 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-29 14:47:44,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-09-29 14:47:44,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-29 14:47:44,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-29 14:47:44,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-29 14:47:44,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-29 14:47:44,450 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-09-29 14:47:44,451 INFO L138 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 [2022-09-29 14:47:44,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-29 14:47:44,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-29 14:47:44,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-29 14:47:44,671 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-09-29 14:47:44,672 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-09-29 14:47:44,673 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/bigNumberOfThreads.bpl [2022-09-29 14:47:44,673 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/bigNumberOfThreads.bpl' [2022-09-29 14:47:44,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-29 14:47:44,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-09-29 14:47:44,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-29 14:47:44,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-29 14:47:44,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-29 14:47:44,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,724 INFO L137 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-09-29 14:47:44,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-29 14:47:44,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-29 14:47:44,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-29 14:47:44,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-29 14:47:44,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-29 14:47:44,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-29 14:47:44,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-29 14:47:44,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-29 14:47:44,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/1) ... [2022-09-29 14:47:44,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-09-29 14:47:44,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-29 14:47:44,772 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) [2022-09-29 14:47:44,775 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 [2022-09-29 14:47:44,804 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-09-29 14:47:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-29 14:47:44,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-29 14:47:44,804 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2022-09-29 14:47:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2022-09-29 14:47:44,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2022-09-29 14:47:44,805 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-29 14:47:44,835 INFO L234 CfgBuilder]: Building ICFG [2022-09-29 14:47:44,836 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-29 14:47:44,899 INFO L275 CfgBuilder]: Performing block encoding [2022-09-29 14:47:44,904 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-29 14:47:44,905 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-29 14:47:44,906 INFO L202 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 02:47:44 BoogieIcfgContainer [2022-09-29 14:47:44,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-29 14:47:44,907 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-09-29 14:47:44,907 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-09-29 14:47:44,920 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-09-29 14:47:44,920 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 14:47:44,921 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.09 02:47:44" (1/2) ... [2022-09-29 14:47:44,924 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23cb9da5 and model type bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.09 02:47:44, skipping insertion in model container [2022-09-29 14:47:44,924 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-09-29 14:47:44,924 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.09 02:47:44" (2/2) ... [2022-09-29 14:47:44,925 INFO L322 chiAutomizerObserver]: Analyzing ICFG bigNumberOfThreads.bpl [2022-09-29 14:47:44,981 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-29 14:47:45,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 13 transitions, 31 flow [2022-09-29 14:47:45,023 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:45,023 INFO L123 PetriNetUnfolderBase]: 1/18 cut-off events. [2022-09-29 14:47:45,023 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 14:47:45,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 18 events. 1/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2022-09-29 14:47:45,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 15 places, 13 transitions, 31 flow [2022-09-29 14:47:45,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 13 transitions, 31 flow [2022-09-29 14:47:45,032 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:47:45,044 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 15 places, 13 transitions, 31 flow [2022-09-29 14:47:45,046 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 15 places, 13 transitions, 31 flow [2022-09-29 14:47:45,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 13 transitions, 31 flow [2022-09-29 14:47:45,051 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:45,051 INFO L123 PetriNetUnfolderBase]: 1/18 cut-off events. [2022-09-29 14:47:45,072 INFO L124 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2022-09-29 14:47:45,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 18 events. 1/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2022-09-29 14:47:45,073 INFO L116 LiptonReduction]: Number of co-enabled transitions 32 [2022-09-29 14:47:45,231 INFO L131 LiptonReduction]: Checked pairs total: 37 [2022-09-29 14:47:45,231 INFO L133 LiptonReduction]: Total number of compositions: 5 [2022-09-29 14:47:45,246 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:47:45,246 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:47:45,246 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:47:45,246 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:47:45,246 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:47:45,247 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:47:45,247 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:47:45,247 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-09-29 14:47:45,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-09-29 14:47:45,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-09-29 14:47:45,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:45,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:45,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2022-09-29 14:47:45,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:47:45,292 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:47:45,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 16 states, but on-demand construction may add more states [2022-09-29 14:47:45,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-09-29 14:47:45,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:45,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:45,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2022-09-29 14:47:45,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:47:45,298 INFO L733 eck$LassoCheckResult]: Stem: 18#[ULTIMATE.startENTRY]don't care [31] ULTIMATE.startENTRY-->L29-1: Formula: (and (= 0 v_ULTIMATE.start_i_8) (= v_x_6 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_8, x=v_x_6} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 21#[L29-1]don't care [20] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 27#[L30]don't care [30] L30-->threadENTRY: Formula: (= v_threadThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_i_7) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_7} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_7, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of1ForFork0_thidvar0] 29#[L30-1, threadENTRY]don't care [15] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 33#[L29-1, threadENTRY]don't care [20] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 41#[L30, threadENTRY]don't care [28] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 49#[threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2022-09-29 14:47:45,299 INFO L735 eck$LassoCheckResult]: Loop: 49#[threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [29] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 49#[threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2022-09-29 14:47:45,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1794386575, now seen corresponding path program 1 times [2022-09-29 14:47:45,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405165014] [2022-09-29 14:47:45,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,388 INFO L85 PathProgramCache]: Analyzing trace with hash 60, now seen corresponding path program 1 times [2022-09-29 14:47:45,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817717252] [2022-09-29 14:47:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,391 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,395 INFO L85 PathProgramCache]: Analyzing trace with hash -208590994, now seen corresponding path program 1 times [2022-09-29 14:47:45,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682164495] [2022-09-29 14:47:45,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,401 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,492 WARN L146 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-09-29 14:47:45,498 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-29 14:47:45,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 44 flow [2022-09-29 14:47:45,506 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:45,506 INFO L123 PetriNetUnfolderBase]: 1/27 cut-off events. [2022-09-29 14:47:45,506 INFO L124 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2022-09-29 14:47:45,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 27 events. 1/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 3 conditions per place. [2022-09-29 14:47:45,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 16 transitions, 44 flow [2022-09-29 14:47:45,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2022-09-29 14:47:45,508 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:47:45,508 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 16 transitions, 44 flow [2022-09-29 14:47:45,508 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 16 transitions, 44 flow [2022-09-29 14:47:45,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 44 flow [2022-09-29 14:47:45,514 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:45,514 INFO L123 PetriNetUnfolderBase]: 1/27 cut-off events. [2022-09-29 14:47:45,514 INFO L124 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2022-09-29 14:47:45,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 27 events. 1/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 3 conditions per place. [2022-09-29 14:47:45,515 INFO L116 LiptonReduction]: Number of co-enabled transitions 76 [2022-09-29 14:47:45,659 INFO L131 LiptonReduction]: Checked pairs total: 96 [2022-09-29 14:47:45,659 INFO L133 LiptonReduction]: Total number of compositions: 6 [2022-09-29 14:47:45,661 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:47:45,661 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:47:45,661 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:47:45,661 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:47:45,661 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:47:45,661 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:47:45,661 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:47:45,661 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-09-29 14:47:45,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-09-29 14:47:45,681 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2022-09-29 14:47:45,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:45,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:45,682 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1] [2022-09-29 14:47:45,682 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:47:45,682 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:47:45,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 38 states, but on-demand construction may add more states [2022-09-29 14:47:45,685 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2022-09-29 14:47:45,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:45,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:45,686 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1] [2022-09-29 14:47:45,686 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:47:45,686 INFO L733 eck$LassoCheckResult]: Stem: 23#[ULTIMATE.startENTRY]don't care [59] ULTIMATE.startENTRY-->L29-1: Formula: (and (= v_ULTIMATE.start_i_28 0) (= v_x_65 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_28, x=v_x_65} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 26#[L29-1]don't care [41] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 30#[L30]don't care [53] L30-->threadENTRY: Formula: (= v_threadThread1of2ForFork0_thidvar0_2 v_ULTIMATE.start_i_21) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_21} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_21} AuxVars[] AssignedVars[threadThread1of2ForFork0_thidvar0] 34#[threadENTRY, L30-1]don't care [36] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 36#[threadENTRY, L29-1]don't care [41] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 44#[threadENTRY, L30]don't care [54] L30-->threadENTRY: Formula: (= v_threadThread2of2ForFork0_thidvar0_2 v_ULTIMATE.start_i_23) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_23} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_23, threadThread2of2ForFork0_thidvar0=v_threadThread2of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of2ForFork0_thidvar0] 54#[L30-1, threadENTRY, threadENTRY]don't care [36] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 58#[L29-1, threadENTRY, threadENTRY]don't care [41] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 68#[L30, threadENTRY, threadENTRY]don't care [51] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 84#[threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2022-09-29 14:47:45,687 INFO L735 eck$LassoCheckResult]: Loop: 84#[threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [52] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 84#[threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]don't care [2022-09-29 14:47:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash -158151453, now seen corresponding path program 1 times [2022-09-29 14:47:45,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555079530] [2022-09-29 14:47:45,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,696 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times [2022-09-29 14:47:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283930036] [2022-09-29 14:47:45,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,707 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,709 INFO L85 PathProgramCache]: Analyzing trace with hash -607727695, now seen corresponding path program 1 times [2022-09-29 14:47:45,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339970536] [2022-09-29 14:47:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,716 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,774 WARN L146 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-09-29 14:47:45,781 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-29 14:47:45,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 19 transitions, 59 flow [2022-09-29 14:47:45,795 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:45,795 INFO L123 PetriNetUnfolderBase]: 1/36 cut-off events. [2022-09-29 14:47:45,795 INFO L124 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2022-09-29 14:47:45,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 36 events. 1/36 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-09-29 14:47:45,795 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 19 transitions, 59 flow [2022-09-29 14:47:45,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 19 transitions, 59 flow [2022-09-29 14:47:45,796 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:47:45,796 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 19 transitions, 59 flow [2022-09-29 14:47:45,797 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 19 transitions, 59 flow [2022-09-29 14:47:45,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 19 transitions, 59 flow [2022-09-29 14:47:45,802 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:45,802 INFO L123 PetriNetUnfolderBase]: 1/36 cut-off events. [2022-09-29 14:47:45,802 INFO L124 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2022-09-29 14:47:45,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 36 events. 1/36 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-09-29 14:47:45,805 INFO L116 LiptonReduction]: Number of co-enabled transitions 132 [2022-09-29 14:47:45,907 INFO L131 LiptonReduction]: Checked pairs total: 177 [2022-09-29 14:47:45,907 INFO L133 LiptonReduction]: Total number of compositions: 7 [2022-09-29 14:47:45,911 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:47:45,911 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:47:45,911 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:47:45,911 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:47:45,912 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:47:45,912 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:47:45,912 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:47:45,912 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-09-29 14:47:45,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-09-29 14:47:45,937 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-09-29 14:47:45,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:45,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:45,938 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1] [2022-09-29 14:47:45,938 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:47:45,938 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:47:45,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 82 states, but on-demand construction may add more states [2022-09-29 14:47:45,942 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2022-09-29 14:47:45,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:45,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:45,943 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1] [2022-09-29 14:47:45,944 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:47:45,945 INFO L733 eck$LassoCheckResult]: Stem: 28#[ULTIMATE.startENTRY]don't care [87] ULTIMATE.startENTRY-->L29-1: Formula: (and (= v_x_118 0) (= v_ULTIMATE.start_i_47 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_47, x=v_x_118} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 31#[L29-1]don't care [66] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 33#[L30]don't care [80] L30-->threadENTRY: Formula: (= v_ULTIMATE.start_i_40 v_threadThread1of3ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_40} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_40, threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of3ForFork0_thidvar0] 39#[L30-1, threadENTRY]don't care [61] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 43#[L29-1, threadENTRY]don't care [66] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 47#[L30, threadENTRY]don't care [81] L30-->threadENTRY: Formula: (= v_threadThread2of3ForFork0_thidvar0_2 v_ULTIMATE.start_i_42) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_42} OutVars{threadThread2of3ForFork0_thidvar0=v_threadThread2of3ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_42} AuxVars[] AssignedVars[threadThread2of3ForFork0_thidvar0] 59#[threadENTRY, threadENTRY, L30-1]don't care [61] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 65#[threadENTRY, threadENTRY, L29-1]don't care [66] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 73#[threadENTRY, threadENTRY, L30]don't care [82] L30-->threadENTRY: Formula: (= v_threadThread3of3ForFork0_thidvar0_2 v_ULTIMATE.start_i_44) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_44} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_44, threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread3of3ForFork0_thidvar0] 93#[threadENTRY, L30-1, threadENTRY, threadENTRY]don't care [61] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 107#[threadENTRY, L29-1, threadENTRY, threadENTRY]don't care [66] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 121#[threadENTRY, L30, threadENTRY, threadENTRY]don't care [78] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 153#[threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY, threadENTRY]don't care [2022-09-29 14:47:45,945 INFO L735 eck$LassoCheckResult]: Loop: 153#[threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY, threadENTRY]don't care [79] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 153#[threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY, threadENTRY]don't care [2022-09-29 14:47:45,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1965011356, now seen corresponding path program 1 times [2022-09-29 14:47:45,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098757002] [2022-09-29 14:47:45,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,958 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,965 INFO L85 PathProgramCache]: Analyzing trace with hash 110, now seen corresponding path program 1 times [2022-09-29 14:47:45,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514946910] [2022-09-29 14:47:45,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,975 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:45,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:45,979 INFO L85 PathProgramCache]: Analyzing trace with hash -785809813, now seen corresponding path program 1 times [2022-09-29 14:47:45,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:45,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987214880] [2022-09-29 14:47:45,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:45,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:45,986 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:46,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:46,051 WARN L146 chiAutomizerObserver]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-09-29 14:47:46,055 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-29 14:47:46,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 76 flow [2022-09-29 14:47:46,066 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:46,066 INFO L123 PetriNetUnfolderBase]: 1/45 cut-off events. [2022-09-29 14:47:46,067 INFO L124 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2022-09-29 14:47:46,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 45 events. 1/45 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 51. Up to 5 conditions per place. [2022-09-29 14:47:46,071 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 22 transitions, 76 flow [2022-09-29 14:47:46,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 22 transitions, 76 flow [2022-09-29 14:47:46,072 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:47:46,072 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 76 flow [2022-09-29 14:47:46,072 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 76 flow [2022-09-29 14:47:46,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 76 flow [2022-09-29 14:47:46,079 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:46,079 INFO L123 PetriNetUnfolderBase]: 1/45 cut-off events. [2022-09-29 14:47:46,079 INFO L124 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2022-09-29 14:47:46,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 45 events. 1/45 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 51. Up to 5 conditions per place. [2022-09-29 14:47:46,080 INFO L116 LiptonReduction]: Number of co-enabled transitions 200 [2022-09-29 14:47:46,171 INFO L131 LiptonReduction]: Checked pairs total: 280 [2022-09-29 14:47:46,172 INFO L133 LiptonReduction]: Total number of compositions: 8 [2022-09-29 14:47:46,176 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:47:46,176 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:47:46,176 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:47:46,176 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:47:46,176 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:47:46,176 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:47:46,176 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:47:46,176 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-09-29 14:47:46,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-09-29 14:47:46,227 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 16 [2022-09-29 14:47:46,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:46,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:46,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2022-09-29 14:47:46,232 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:47:46,232 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:47:46,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 170 states, but on-demand construction may add more states [2022-09-29 14:47:46,237 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 16 [2022-09-29 14:47:46,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:46,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:46,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2022-09-29 14:47:46,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:47:46,239 INFO L733 eck$LassoCheckResult]: Stem: 33#[ULTIMATE.startENTRY]don't care [115] ULTIMATE.startENTRY-->L29-1: Formula: (and (= v_x_135 0) (= v_ULTIMATE.start_i_63 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_63, x=v_x_135} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 36#[L29-1]don't care [95] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 42#[L30]don't care [111] L30-->threadENTRY: Formula: (= v_ULTIMATE.start_i_56 v_threadThread1of4ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_56} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_56, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of4ForFork0_thidvar0] 44#[L30-1, threadENTRY]don't care [90] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 48#[threadENTRY, L29-1]don't care [95] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 56#[threadENTRY, L30]don't care [112] L30-->threadENTRY: Formula: (= v_threadThread2of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_58) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_58} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_58, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of4ForFork0_thidvar0] 64#[L30-1, threadENTRY, threadENTRY]don't care [90] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 70#[threadENTRY, threadENTRY, L29-1]don't care [95] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 82#[threadENTRY, L30, threadENTRY]don't care [113] L30-->threadENTRY: Formula: (= v_threadThread3of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_60) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_60} OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_60} AuxVars[] AssignedVars[threadThread3of4ForFork0_thidvar0] 98#[L30-1, threadENTRY, threadENTRY, threadENTRY]don't care [90] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 112#[L29-1, threadENTRY, threadENTRY, threadENTRY]don't care [95] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 130#[threadENTRY, threadENTRY, threadENTRY, L30]don't care [114] L30-->threadENTRY: Formula: (= v_threadThread4of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_62) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_62} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_62, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread4of4ForFork0_thidvar0] 158#[threadENTRY, L30-1, threadENTRY, threadENTRY, threadENTRY]don't care [90] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 188#[threadENTRY, threadENTRY, L29-1, threadENTRY, threadENTRY]don't care [95] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 220#[threadENTRY, threadENTRY, L30, threadENTRY, threadENTRY]don't care [109] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 266#[threadENTRY, threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY]don't care [2022-09-29 14:47:46,239 INFO L735 eck$LassoCheckResult]: Loop: 266#[threadENTRY, threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY]don't care [110] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 266#[threadENTRY, threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY]don't care [2022-09-29 14:47:46,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash -168355522, now seen corresponding path program 1 times [2022-09-29 14:47:46,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:46,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671654337] [2022-09-29 14:47:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:46,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:46,249 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:46,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 1 times [2022-09-29 14:47:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:46,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524575969] [2022-09-29 14:47:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:46,260 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:46,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:46,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:46,262 INFO L85 PathProgramCache]: Analyzing trace with hash -924053776, now seen corresponding path program 1 times [2022-09-29 14:47:46,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:46,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532064751] [2022-09-29 14:47:46,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:46,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:46,270 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:46,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:46,343 WARN L146 chiAutomizerObserver]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-09-29 14:47:46,349 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-29 14:47:46,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 95 flow [2022-09-29 14:47:46,370 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:46,370 INFO L123 PetriNetUnfolderBase]: 1/54 cut-off events. [2022-09-29 14:47:46,370 INFO L124 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2022-09-29 14:47:46,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 54 events. 1/54 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 67. Up to 6 conditions per place. [2022-09-29 14:47:46,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 25 transitions, 95 flow [2022-09-29 14:47:46,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 25 transitions, 95 flow [2022-09-29 14:47:46,372 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-09-29 14:47:46,372 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 95 flow [2022-09-29 14:47:46,372 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 95 flow [2022-09-29 14:47:46,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 95 flow [2022-09-29 14:47:46,386 INFO L175 PetriNetUnfolderBase]: Searched whole Unfolding. [2022-09-29 14:47:46,386 INFO L123 PetriNetUnfolderBase]: 1/54 cut-off events. [2022-09-29 14:47:46,386 INFO L124 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2022-09-29 14:47:46,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 54 events. 1/54 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 67. Up to 6 conditions per place. [2022-09-29 14:47:46,387 INFO L116 LiptonReduction]: Number of co-enabled transitions 280 [2022-09-29 14:47:46,465 INFO L131 LiptonReduction]: Checked pairs total: 405 [2022-09-29 14:47:46,465 INFO L133 LiptonReduction]: Total number of compositions: 9 [2022-09-29 14:47:46,467 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-09-29 14:47:46,467 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-09-29 14:47:46,467 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-09-29 14:47:46,467 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-09-29 14:47:46,467 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-09-29 14:47:46,467 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-09-29 14:47:46,468 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-09-29 14:47:46,468 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-09-29 14:47:46,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-09-29 14:47:46,514 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 32 [2022-09-29 14:47:46,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:46,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:46,515 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2022-09-29 14:47:46,515 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:47:46,515 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-09-29 14:47:46,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 346 states, but on-demand construction may add more states [2022-09-29 14:47:46,530 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 32 [2022-09-29 14:47:46,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-09-29 14:47:46,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-09-29 14:47:46,532 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2022-09-29 14:47:46,532 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-09-29 14:47:46,532 INFO L733 eck$LassoCheckResult]: Stem: 38#[ULTIMATE.startENTRY]don't care [151] ULTIMATE.startENTRY-->L29-1: Formula: (and (= v_x_208 0) (= v_ULTIMATE.start_i_84 0)) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_84, x=v_x_208} AuxVars[] AssignedVars[ULTIMATE.start_i, x] 41#[L29-1]don't care [128] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 43#[L30]don't care [146] L30-->threadENTRY: Formula: (= v_threadThread1of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_75) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_75} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_75, threadThread1of5ForFork0_thidvar0=v_threadThread1of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of5ForFork0_thidvar0] 49#[L30-1, threadENTRY]don't care [123] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 51#[threadENTRY, L29-1]don't care [128] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 55#[threadENTRY, L30]don't care [147] L30-->threadENTRY: Formula: (= v_threadThread2of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_77) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_77} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_77, threadThread2of5ForFork0_thidvar0=v_threadThread2of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of5ForFork0_thidvar0] 63#[L30-1, threadENTRY, threadENTRY]don't care [123] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 71#[L29-1, threadENTRY, threadENTRY]don't care [128] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 77#[threadENTRY, L30, threadENTRY]don't care [148] L30-->threadENTRY: Formula: (= v_threadThread3of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_79) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_79} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_79, threadThread3of5ForFork0_thidvar0=v_threadThread3of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread3of5ForFork0_thidvar0] 89#[L30-1, threadENTRY, threadENTRY, threadENTRY]don't care [123] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 105#[threadENTRY, threadENTRY, L29-1, threadENTRY]don't care [128] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 119#[L30, threadENTRY, threadENTRY, threadENTRY]don't care [149] L30-->threadENTRY: Formula: (= v_threadThread4of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_81) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_81} OutVars{threadThread4of5ForFork0_thidvar0=v_threadThread4of5ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_81} AuxVars[] AssignedVars[threadThread4of5ForFork0_thidvar0] 137#[threadENTRY, threadENTRY, L30-1, threadENTRY, threadENTRY]don't care [123] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 167#[L29-1, threadENTRY, threadENTRY, threadENTRY, threadENTRY]don't care [128] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 203#[L30, threadENTRY, threadENTRY, threadENTRY, threadENTRY]don't care [150] L30-->threadENTRY: Formula: (= v_ULTIMATE.start_i_83 v_threadThread5of5ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_83} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_83, threadThread5of5ForFork0_thidvar0=v_threadThread5of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread5of5ForFork0_thidvar0] 245#[threadENTRY, threadENTRY, threadENTRY, threadENTRY, L30-1, threadENTRY]don't care [123] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i] 303#[threadENTRY, threadENTRY, threadENTRY, threadENTRY, L29-1, threadENTRY]don't care [128] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[] 369#[threadENTRY, threadENTRY, threadENTRY, threadENTRY, L30, threadENTRY]don't care [144] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 443#[threadENTRY, threadENTRY, threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY]don't care [2022-09-29 14:47:46,533 INFO L735 eck$LassoCheckResult]: Loop: 443#[threadENTRY, threadENTRY, threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY]don't care [145] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 443#[threadENTRY, threadENTRY, threadENTRY, threadENTRY, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadENTRY]don't care [2022-09-29 14:47:46,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:46,533 INFO L85 PathProgramCache]: Analyzing trace with hash -96779327, now seen corresponding path program 1 times [2022-09-29 14:47:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:46,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469105140] [2022-09-29 14:47:46,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:46,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-29 14:47:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-29 14:47:46,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-29 14:47:46,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469105140] [2022-09-29 14:47:46,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469105140] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-29 14:47:46,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-29 14:47:46,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-29 14:47:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118775974] [2022-09-29 14:47:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-29 14:47:46,630 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-09-29 14:47:46,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-29 14:47:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 1 times [2022-09-29 14:47:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-29 14:47:46,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556614374] [2022-09-29 14:47:46,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-29 14:47:46,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-29 14:47:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:46,633 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-29 14:47:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-29 14:47:46,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-29 14:47:46,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-29 14:47:46,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-29 14:47:46,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-09-29 14:47:46,659 INFO L87 Difference]: Start difference. First operand currently 346 states, but on-demand construction may add more states Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-29 14:47:46,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-09-29 14:47:46,776 INFO L93 Difference]: Finished difference Result 283 states and 816 transitions. [2022-09-29 14:47:46,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 283 states and 816 transitions. [2022-09-29 14:47:46,782 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-09-29 14:47:46,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 283 states to 0 states and 0 transitions. [2022-09-29 14:47:46,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-09-29 14:47:46,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-09-29 14:47:46,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-09-29 14:47:46,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-29 14:47:46,786 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-09-29 14:47:46,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-09-29 14:47:46,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-29 14:47:46,793 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-09-29 14:47:46,794 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-09-29 14:47:46,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-09-29 14:47:46,796 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-09-29 14:47:46,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-09-29 14:47:46,801 INFO L202 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.09 02:47:46 BoogieIcfgContainer [2022-09-29 14:47:46,801 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-09-29 14:47:46,804 INFO L158 Benchmark]: Toolchain (without parser) took 2108.10ms. Allocated memory was 179.3MB in the beginning and 220.2MB in the end (delta: 40.9MB). Free memory was 137.4MB in the beginning and 181.0MB in the end (delta: -43.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 14:47:46,804 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 179.3MB. Free memory was 138.4MB in the beginning and 138.3MB in the end (delta: 76.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 14:47:46,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.37ms. Allocated memory is still 179.3MB. Free memory was 137.3MB in the beginning and 135.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-29 14:47:46,808 INFO L158 Benchmark]: Boogie Preprocessor took 14.23ms. Allocated memory is still 179.3MB. Free memory was 135.8MB in the beginning and 134.9MB in the end (delta: 921.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-29 14:47:46,808 INFO L158 Benchmark]: RCFGBuilder took 164.21ms. Allocated memory is still 179.3MB. Free memory was 134.8MB in the beginning and 126.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-09-29 14:47:46,811 INFO L158 Benchmark]: BuchiAutomizer took 1894.17ms. Allocated memory was 179.3MB in the beginning and 220.2MB in the end (delta: 40.9MB). Free memory was 126.6MB in the beginning and 181.0MB in the end (delta: -54.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-29 14:47:46,813 INFO L339 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.14ms. Allocated memory is still 179.3MB. Free memory was 138.4MB in the beginning and 138.3MB in the end (delta: 76.8kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.37ms. Allocated memory is still 179.3MB. Free memory was 137.3MB in the beginning and 135.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.23ms. Allocated memory is still 179.3MB. Free memory was 135.8MB in the beginning and 134.9MB in the end (delta: 921.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 164.21ms. Allocated memory is still 179.3MB. Free memory was 134.8MB in the beginning and 126.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1894.17ms. Allocated memory was 179.3MB in the beginning and 220.2MB in the end (delta: 40.9MB). Free memory was 126.6MB in the beginning and 181.0MB in the end (delta: -54.3MB). 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 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic). 1 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 6 iterations. TraceHistogramMax:6. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 0 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont4 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 15 PlacesBefore, 11 PlacesAfterwards, 13 TransitionsBefore, 9 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 37 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 20 PlacesBefore, 15 PlacesAfterwards, 16 TransitionsBefore, 11 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 96 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 93, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 48, unknown conditional: 0, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 25 PlacesBefore, 19 PlacesAfterwards, 19 TransitionsBefore, 13 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 177 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 150, positive: 147, positive conditional: 0, positive unconditional: 147, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 69, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 69, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 69, unknown conditional: 0, unknown unconditional: 69] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 23 PlacesAfterwards, 22 TransitionsBefore, 15 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 280 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 230, positive: 226, positive conditional: 0, positive unconditional: 226, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 100, positive: 96, positive conditional: 0, positive unconditional: 96, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 100, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 230, positive: 130, positive conditional: 0, positive unconditional: 130, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 100, unknown conditional: 0, unknown unconditional: 100] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 17 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 405 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 335, positive: 330, positive conditional: 0, positive unconditional: 330, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 145, positive: 140, positive conditional: 0, positive unconditional: 140, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 145, positive: 130, positive conditional: 0, positive unconditional: 130, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 335, positive: 190, positive conditional: 0, positive unconditional: 190, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 145, unknown conditional: 0, unknown unconditional: 145] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 25, Positive conditional cache size: 0, Positive unconditional cache size: 25, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2022-09-29 14:47:46,843 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...