/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:09:02,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:09:02,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:09:02,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:09:02,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:09:02,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:09:02,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:09:02,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:09:02,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:09:02,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:09:02,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:09:02,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:09:02,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:09:02,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:09:02,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:09:02,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:09:02,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:09:02,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:09:02,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:09:02,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:09:02,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:09:02,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:09:02,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:09:02,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:09:02,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:09:02,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:09:02,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:09:02,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:09:02,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:09:02,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:09:02,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:09:02,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:09:02,630 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:09:02,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:09:02,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:09:02,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:09:02,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:09:02,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:09:02,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:09:02,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:09:02,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:09:02,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:09:02,656 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:09:02,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:09:02,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:09:02,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:09:02,658 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:09:02,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:09:02,659 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:09:02,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:09:02,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:09:02,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:09:02,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:09:02,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:09:02,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:09:02,660 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:09:02,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:09:02,660 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:09:02,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:09:02,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:09:02,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:09:02,661 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:09:02,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:09:02,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:09:02,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:09:02,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:09:02,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:09:02,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:09:02,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:09:02,662 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:09:02,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-12-06 04:09:02,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:09:02,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:09:02,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:09:02,977 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:09:02,977 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:09:02,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-12-06 04:09:04,032 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:09:04,238 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:09:04,239 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-12-06 04:09:04,247 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2420215/eead190a569c4362b124a7a1a7e200c6/FLAGc04f32dc1 [2022-12-06 04:09:04,258 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf2420215/eead190a569c4362b124a7a1a7e200c6 [2022-12-06 04:09:04,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:09:04,261 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:09:04,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:09:04,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:09:04,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:09:04,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36868412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04, skipping insertion in model container [2022-12-06 04:09:04,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:09:04,297 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:09:04,423 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i[958,971] [2022-12-06 04:09:04,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:09:04,609 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:09:04,617 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt_rmo.opt.i[958,971] [2022-12-06 04:09:04,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:04,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:04,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:09:04,709 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:09:04,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04 WrapperNode [2022-12-06 04:09:04,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:09:04,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:09:04,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:09:04,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:09:04,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,772 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-06 04:09:04,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:09:04,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:09:04,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:09:04,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:09:04,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,802 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:09:04,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:09:04,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:09:04,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:09:04,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04" (1/1) ... [2022-12-06 04:09:04,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:09:04,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:09:04,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:09:04,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:09:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:09:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:09:04,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:09:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:09:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:09:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:09:04,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:09:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:09:04,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:09:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:09:04,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:09:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:09:04,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:09:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:09:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:09:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:09:04,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:09:04,940 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:09:05,061 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:09:05,062 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:09:05,377 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:09:05,480 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:09:05,480 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:09:05,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:05 BoogieIcfgContainer [2022-12-06 04:09:05,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:09:05,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:09:05,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:09:05,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:09:05,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:09:04" (1/3) ... [2022-12-06 04:09:05,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541725cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:09:05, skipping insertion in model container [2022-12-06 04:09:05,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:04" (2/3) ... [2022-12-06 04:09:05,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541725cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:09:05, skipping insertion in model container [2022-12-06 04:09:05,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:05" (3/3) ... [2022-12-06 04:09:05,492 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2022-12-06 04:09:05,506 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:09:05,507 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:09:05,507 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:09:05,566 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:09:05,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 04:09:05,719 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 04:09:05,719 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:05,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 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/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 04:09:05,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 04:09:05,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-06 04:09:05,732 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:05,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 04:09:05,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-06 04:09:05,790 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 04:09:05,791 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:05,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 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/122 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-06 04:09:05,801 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 04:09:05,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 2852 [2022-12-06 04:09:09,571 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-06 04:09:09,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:09:09,591 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@366985, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:09:09,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:09:09,601 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 04:09:09,602 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:09,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:09,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:09,603 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1824037376, now seen corresponding path program 1 times [2022-12-06 04:09:09,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:09,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660637652] [2022-12-06 04:09:09,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:09,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:09,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:09,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660637652] [2022-12-06 04:09:09,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660637652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:09,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:09,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:09:09,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595193874] [2022-12-06 04:09:09,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:09,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:09,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:09,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:09,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:09,961 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-06 04:09:09,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-12-06 04:09:09,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:09,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-06 04:09:09,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:10,607 INFO L130 PetriNetUnfolder]: 4079/5876 cut-off events. [2022-12-06 04:09:10,607 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 04:09:10,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11608 conditions, 5876 events. 4079/5876 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 31057 event pairs, 1106 based on Foata normal form. 0/5407 useless extension candidates. Maximal degree in co-relation 11596. Up to 4426 conditions per place. [2022-12-06 04:09:10,632 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 35 selfloop transitions, 2 changer transitions 6/47 dead transitions. [2022-12-06 04:09:10,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 195 flow [2022-12-06 04:09:10,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 04:09:10,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-06 04:09:10,642 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 60 transitions. [2022-12-06 04:09:10,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 195 flow [2022-12-06 04:09:10,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:09:10,647 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2022-12-06 04:09:10,648 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-06 04:09:10,652 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2022-12-06 04:09:10,653 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:10,653 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 66 flow [2022-12-06 04:09:10,655 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:10,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:10,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 66 flow [2022-12-06 04:09:10,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 66 flow [2022-12-06 04:09:10,661 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-06 04:09:10,661 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:10,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:09:10,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 66 flow [2022-12-06 04:09:10,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 04:09:10,791 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:10,793 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-06 04:09:10,793 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 64 flow [2022-12-06 04:09:10,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-12-06 04:09:10,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:10,793 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:10,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:09:10,796 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash -848101402, now seen corresponding path program 1 times [2022-12-06 04:09:10,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:10,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147178111] [2022-12-06 04:09:10,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:11,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:11,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147178111] [2022-12-06 04:09:11,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147178111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:11,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:11,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:09:11,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005783718] [2022-12-06 04:09:11,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:11,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:11,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:11,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:11,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:11,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:09:11,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 64 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-12-06 04:09:11,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:11,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:09:11,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:11,768 INFO L130 PetriNetUnfolder]: 5895/8000 cut-off events. [2022-12-06 04:09:11,768 INFO L131 PetriNetUnfolder]: For 404/404 co-relation queries the response was YES. [2022-12-06 04:09:11,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16614 conditions, 8000 events. 5895/8000 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 35061 event pairs, 2395 based on Foata normal form. 16/8016 useless extension candidates. Maximal degree in co-relation 16604. Up to 7809 conditions per place. [2022-12-06 04:09:11,808 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 37 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2022-12-06 04:09:11,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 188 flow [2022-12-06 04:09:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:09:11,810 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2022-12-06 04:09:11,810 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 64 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:09:11,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 188 flow [2022-12-06 04:09:11,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:11,813 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 93 flow [2022-12-06 04:09:11,813 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-06 04:09:11,813 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -7 predicate places. [2022-12-06 04:09:11,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:11,813 INFO L89 Accepts]: Start accepts. Operand has 38 places, 30 transitions, 93 flow [2022-12-06 04:09:11,814 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:11,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:11,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 93 flow [2022-12-06 04:09:11,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 93 flow [2022-12-06 04:09:11,829 INFO L130 PetriNetUnfolder]: 45/146 cut-off events. [2022-12-06 04:09:11,829 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:11,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 146 events. 45/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 630 event pairs, 23 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 229. Up to 76 conditions per place. [2022-12-06 04:09:11,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 93 flow [2022-12-06 04:09:11,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 04:09:11,841 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:11,842 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 04:09:11,842 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 93 flow [2022-12-06 04:09:11,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-12-06 04:09:11,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:11,843 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:11,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:09:11,843 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:11,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash -750184547, now seen corresponding path program 1 times [2022-12-06 04:09:11,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:11,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522593110] [2022-12-06 04:09:11,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:11,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:11,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522593110] [2022-12-06 04:09:11,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522593110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:11,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:11,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:09:11,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110475411] [2022-12-06 04:09:11,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:11,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:11,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:11,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:11,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:11,948 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 04:09:11,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 93 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:11,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:11,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 04:09:11,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:12,573 INFO L130 PetriNetUnfolder]: 5431/7392 cut-off events. [2022-12-06 04:09:12,574 INFO L131 PetriNetUnfolder]: For 1371/1371 co-relation queries the response was YES. [2022-12-06 04:09:12,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17043 conditions, 7392 events. 5431/7392 cut-off events. For 1371/1371 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 31504 event pairs, 1667 based on Foata normal form. 144/7536 useless extension candidates. Maximal degree in co-relation 17032. Up to 5105 conditions per place. [2022-12-06 04:09:12,608 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-06 04:09:12,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 207 flow [2022-12-06 04:09:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 04:09:12,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:09:12,609 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 93 flow. Second operand 3 states and 39 transitions. [2022-12-06 04:09:12,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 207 flow [2022-12-06 04:09:12,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:12,610 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 99 flow [2022-12-06 04:09:12,610 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-06 04:09:12,611 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2022-12-06 04:09:12,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:12,611 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 99 flow [2022-12-06 04:09:12,611 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:12,612 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:12,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 99 flow [2022-12-06 04:09:12,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 99 flow [2022-12-06 04:09:12,619 INFO L130 PetriNetUnfolder]: 29/95 cut-off events. [2022-12-06 04:09:12,619 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 04:09:12,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 95 events. 29/95 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 345 event pairs, 11 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 175. Up to 53 conditions per place. [2022-12-06 04:09:12,620 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 99 flow [2022-12-06 04:09:12,620 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 04:09:12,629 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:12,630 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 04:09:12,630 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 99 flow [2022-12-06 04:09:12,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:12,630 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:12,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:12,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:09:12,630 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:12,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1016952947, now seen corresponding path program 1 times [2022-12-06 04:09:12,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:12,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556991374] [2022-12-06 04:09:12,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:12,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:12,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556991374] [2022-12-06 04:09:12,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556991374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:12,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:12,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:12,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647363126] [2022-12-06 04:09:12,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:12,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:12,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:12,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:12,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:09:12,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-12-06 04:09:12,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:12,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:09:12,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:13,156 INFO L130 PetriNetUnfolder]: 3056/4567 cut-off events. [2022-12-06 04:09:13,156 INFO L131 PetriNetUnfolder]: For 711/736 co-relation queries the response was YES. [2022-12-06 04:09:13,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10120 conditions, 4567 events. 3056/4567 cut-off events. For 711/736 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 24726 event pairs, 570 based on Foata normal form. 336/4758 useless extension candidates. Maximal degree in co-relation 10107. Up to 2966 conditions per place. [2022-12-06 04:09:13,179 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 54 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2022-12-06 04:09:13,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 71 transitions, 323 flow [2022-12-06 04:09:13,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:09:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:09:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-06 04:09:13,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2022-12-06 04:09:13,181 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 99 flow. Second operand 5 states and 84 transitions. [2022-12-06 04:09:13,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 71 transitions, 323 flow [2022-12-06 04:09:13,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 71 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:13,183 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 168 flow [2022-12-06 04:09:13,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2022-12-06 04:09:13,184 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2022-12-06 04:09:13,185 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:13,185 INFO L89 Accepts]: Start accepts. Operand has 45 places, 39 transitions, 168 flow [2022-12-06 04:09:13,186 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:13,186 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:13,186 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 39 transitions, 168 flow [2022-12-06 04:09:13,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 168 flow [2022-12-06 04:09:13,216 INFO L130 PetriNetUnfolder]: 254/510 cut-off events. [2022-12-06 04:09:13,216 INFO L131 PetriNetUnfolder]: For 278/407 co-relation queries the response was YES. [2022-12-06 04:09:13,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 510 events. 254/510 cut-off events. For 278/407 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 2977 event pairs, 117 based on Foata normal form. 2/454 useless extension candidates. Maximal degree in co-relation 1366. Up to 318 conditions per place. [2022-12-06 04:09:13,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 39 transitions, 168 flow [2022-12-06 04:09:13,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-06 04:09:13,226 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [431] L865-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_39 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_13|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [488] L786-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.base_9| 0) (= (+ v_~__unbuffered_cnt~0_114 1) v_~__unbuffered_cnt~0_113) (= |v_P1Thread1of1ForFork3_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_9|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-06 04:09:13,258 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [431] L865-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_39 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_13|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [471] L841-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res.offset_9| 0) (= v_~__unbuffered_cnt~0_85 (+ v_~__unbuffered_cnt~0_86 1)) (= 0 |v_P3Thread1of1ForFork2_#res.base_9|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_9|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] [2022-12-06 04:09:13,293 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [431] L865-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_39 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_13|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [432] L758-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_13| 0) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P0Thread1of1ForFork1_#res.offset_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_13|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-06 04:09:13,327 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [431] L865-3-->L2: Formula: (and (= v_~main$tmp_guard0~0_18 (ite (= (ite (= v_~__unbuffered_cnt~0_39 4) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_18 256))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_13|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [478] L818-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_103 (+ v_~__unbuffered_cnt~0_104 1)) (= |v_P2Thread1of1ForFork0_#res#1.base_7| 0) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_7|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] [2022-12-06 04:09:13,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:13,387 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-06 04:09:13,387 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 178 flow [2022-12-06 04:09:13,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-12-06 04:09:13,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:13,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:13,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:09:13,387 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:13,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1586531040, now seen corresponding path program 1 times [2022-12-06 04:09:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:13,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131295146] [2022-12-06 04:09:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:13,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:13,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131295146] [2022-12-06 04:09:13,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131295146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:13,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:13,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:13,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344965375] [2022-12-06 04:09:13,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:13,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:13,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:13,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:13,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:13,520 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 04:09:13,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-12-06 04:09:13,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:13,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 04:09:13,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:13,948 INFO L130 PetriNetUnfolder]: 2165/3408 cut-off events. [2022-12-06 04:09:13,948 INFO L131 PetriNetUnfolder]: For 2440/2443 co-relation queries the response was YES. [2022-12-06 04:09:13,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10256 conditions, 3408 events. 2165/3408 cut-off events. For 2440/2443 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18703 event pairs, 289 based on Foata normal form. 227/3542 useless extension candidates. Maximal degree in co-relation 10240. Up to 1301 conditions per place. [2022-12-06 04:09:13,966 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 64 selfloop transitions, 18 changer transitions 0/89 dead transitions. [2022-12-06 04:09:13,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 89 transitions, 512 flow [2022-12-06 04:09:13,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 04:09:13,967 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2022-12-06 04:09:13,968 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 178 flow. Second operand 6 states and 107 transitions. [2022-12-06 04:09:13,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 89 transitions, 512 flow [2022-12-06 04:09:13,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 89 transitions, 499 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:13,974 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 297 flow [2022-12-06 04:09:13,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2022-12-06 04:09:13,975 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2022-12-06 04:09:13,975 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:13,975 INFO L89 Accepts]: Start accepts. Operand has 51 places, 47 transitions, 297 flow [2022-12-06 04:09:13,976 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:13,976 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:13,976 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 47 transitions, 297 flow [2022-12-06 04:09:13,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 47 transitions, 297 flow [2022-12-06 04:09:14,008 INFO L130 PetriNetUnfolder]: 189/430 cut-off events. [2022-12-06 04:09:14,008 INFO L131 PetriNetUnfolder]: For 1134/1693 co-relation queries the response was YES. [2022-12-06 04:09:14,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 430 events. 189/430 cut-off events. For 1134/1693 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2524 event pairs, 38 based on Foata normal form. 11/405 useless extension candidates. Maximal degree in co-relation 1764. Up to 309 conditions per place. [2022-12-06 04:09:14,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 47 transitions, 297 flow [2022-12-06 04:09:14,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-06 04:09:14,069 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:14,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 04:09:14,071 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 289 flow [2022-12-06 04:09:14,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-12-06 04:09:14,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:14,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:14,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:09:14,071 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:14,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash 51318119, now seen corresponding path program 1 times [2022-12-06 04:09:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:14,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376389005] [2022-12-06 04:09:14,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:14,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:14,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376389005] [2022-12-06 04:09:14,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376389005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:14,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:14,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:14,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051276585] [2022-12-06 04:09:14,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:14,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:14,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:14,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:14,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:14,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 04:09:14,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 289 flow. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-12-06 04:09:14,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:14,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 04:09:14,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:14,706 INFO L130 PetriNetUnfolder]: 3599/5391 cut-off events. [2022-12-06 04:09:14,707 INFO L131 PetriNetUnfolder]: For 11853/11853 co-relation queries the response was YES. [2022-12-06 04:09:14,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19631 conditions, 5391 events. 3599/5391 cut-off events. For 11853/11853 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 27627 event pairs, 521 based on Foata normal form. 46/5437 useless extension candidates. Maximal degree in co-relation 19611. Up to 2983 conditions per place. [2022-12-06 04:09:14,733 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 82 selfloop transitions, 10 changer transitions 39/131 dead transitions. [2022-12-06 04:09:14,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 131 transitions, 1047 flow [2022-12-06 04:09:14,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-06 04:09:14,735 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 04:09:14,735 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 289 flow. Second operand 6 states and 99 transitions. [2022-12-06 04:09:14,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 131 transitions, 1047 flow [2022-12-06 04:09:14,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 131 transitions, 907 flow, removed 47 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:14,808 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 222 flow [2022-12-06 04:09:14,808 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-12-06 04:09:14,809 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2022-12-06 04:09:14,809 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:14,809 INFO L89 Accepts]: Start accepts. Operand has 55 places, 42 transitions, 222 flow [2022-12-06 04:09:14,810 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:14,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:14,810 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 222 flow [2022-12-06 04:09:14,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 222 flow [2022-12-06 04:09:14,838 INFO L130 PetriNetUnfolder]: 203/464 cut-off events. [2022-12-06 04:09:14,838 INFO L131 PetriNetUnfolder]: For 832/903 co-relation queries the response was YES. [2022-12-06 04:09:14,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 464 events. 203/464 cut-off events. For 832/903 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2608 event pairs, 60 based on Foata normal form. 16/453 useless extension candidates. Maximal degree in co-relation 1628. Up to 268 conditions per place. [2022-12-06 04:09:14,842 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 42 transitions, 222 flow [2022-12-06 04:09:14,842 INFO L188 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-06 04:09:14,860 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L770: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] and [373] L808-->L811: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-06 04:09:15,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L770: Formula: (and (= v_~x~0_4 1) (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] and [380] L828-->L831: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-06 04:09:15,334 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:09:15,335 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 526 [2022-12-06 04:09:15,335 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 224 flow [2022-12-06 04:09:15,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-12-06 04:09:15,335 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:15,336 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:15,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:09:15,336 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:15,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1451186370, now seen corresponding path program 1 times [2022-12-06 04:09:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:15,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641652647] [2022-12-06 04:09:15,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:15,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:15,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641652647] [2022-12-06 04:09:15,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641652647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:15,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:15,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:09:15,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109630381] [2022-12-06 04:09:15,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:15,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:15,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:15,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:15,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:15,497 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-06 04:09:15,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-12-06 04:09:15,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:15,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-06 04:09:15,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:15,803 INFO L130 PetriNetUnfolder]: 1328/2159 cut-off events. [2022-12-06 04:09:15,803 INFO L131 PetriNetUnfolder]: For 3220/3268 co-relation queries the response was YES. [2022-12-06 04:09:15,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7036 conditions, 2159 events. 1328/2159 cut-off events. For 3220/3268 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11420 event pairs, 200 based on Foata normal form. 161/2239 useless extension candidates. Maximal degree in co-relation 7015. Up to 665 conditions per place. [2022-12-06 04:09:15,815 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 65 selfloop transitions, 18 changer transitions 10/101 dead transitions. [2022-12-06 04:09:15,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 101 transitions, 677 flow [2022-12-06 04:09:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:09:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:09:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-12-06 04:09:15,817 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6059113300492611 [2022-12-06 04:09:15,817 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 224 flow. Second operand 7 states and 123 transitions. [2022-12-06 04:09:15,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 101 transitions, 677 flow [2022-12-06 04:09:15,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 101 transitions, 634 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:15,831 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 343 flow [2022-12-06 04:09:15,831 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=343, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2022-12-06 04:09:15,832 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2022-12-06 04:09:15,832 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:15,832 INFO L89 Accepts]: Start accepts. Operand has 57 places, 50 transitions, 343 flow [2022-12-06 04:09:15,833 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:15,833 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:15,834 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 50 transitions, 343 flow [2022-12-06 04:09:15,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 343 flow [2022-12-06 04:09:15,855 INFO L130 PetriNetUnfolder]: 133/343 cut-off events. [2022-12-06 04:09:15,856 INFO L131 PetriNetUnfolder]: For 748/826 co-relation queries the response was YES. [2022-12-06 04:09:15,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 343 events. 133/343 cut-off events. For 748/826 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1873 event pairs, 17 based on Foata normal form. 1/325 useless extension candidates. Maximal degree in co-relation 1372. Up to 210 conditions per place. [2022-12-06 04:09:15,859 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 50 transitions, 343 flow [2022-12-06 04:09:15,859 INFO L188 LiptonReduction]: Number of co-enabled transitions 596 [2022-12-06 04:09:15,931 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:15,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 04:09:15,932 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 333 flow [2022-12-06 04:09:15,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-12-06 04:09:15,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:15,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:15,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:09:15,932 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:15,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:15,933 INFO L85 PathProgramCache]: Analyzing trace with hash 332039778, now seen corresponding path program 1 times [2022-12-06 04:09:15,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:15,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61692389] [2022-12-06 04:09:15,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:15,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:16,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:16,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61692389] [2022-12-06 04:09:16,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61692389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:16,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:16,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196828050] [2022-12-06 04:09:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:16,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:16,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:16,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:16,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:16,133 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 04:09:16,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 333 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-12-06 04:09:16,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:16,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 04:09:16,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:16,445 INFO L130 PetriNetUnfolder]: 1694/2807 cut-off events. [2022-12-06 04:09:16,445 INFO L131 PetriNetUnfolder]: For 6190/6205 co-relation queries the response was YES. [2022-12-06 04:09:16,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9939 conditions, 2807 events. 1694/2807 cut-off events. For 6190/6205 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15779 event pairs, 242 based on Foata normal form. 11/2728 useless extension candidates. Maximal degree in co-relation 9916. Up to 1448 conditions per place. [2022-12-06 04:09:16,461 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 83 selfloop transitions, 2 changer transitions 4/96 dead transitions. [2022-12-06 04:09:16,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 804 flow [2022-12-06 04:09:16,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 04:09:16,467 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-06 04:09:16,468 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 333 flow. Second operand 4 states and 72 transitions. [2022-12-06 04:09:16,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 804 flow [2022-12-06 04:09:16,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 96 transitions, 692 flow, removed 39 selfloop flow, removed 4 redundant places. [2022-12-06 04:09:16,490 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 257 flow [2022-12-06 04:09:16,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2022-12-06 04:09:16,492 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2022-12-06 04:09:16,492 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:16,492 INFO L89 Accepts]: Start accepts. Operand has 56 places, 46 transitions, 257 flow [2022-12-06 04:09:16,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:16,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:16,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 46 transitions, 257 flow [2022-12-06 04:09:16,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 46 transitions, 257 flow [2022-12-06 04:09:16,521 INFO L130 PetriNetUnfolder]: 176/442 cut-off events. [2022-12-06 04:09:16,521 INFO L131 PetriNetUnfolder]: For 592/605 co-relation queries the response was YES. [2022-12-06 04:09:16,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 442 events. 176/442 cut-off events. For 592/605 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2554 event pairs, 21 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1367. Up to 180 conditions per place. [2022-12-06 04:09:16,525 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 46 transitions, 257 flow [2022-12-06 04:09:16,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-06 04:09:16,564 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:16,565 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 04:09:16,565 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 260 flow [2022-12-06 04:09:16,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-12-06 04:09:16,566 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:16,566 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:16,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:09:16,566 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:16,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash 448588945, now seen corresponding path program 1 times [2022-12-06 04:09:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:16,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62266430] [2022-12-06 04:09:16,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:16,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:16,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:16,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:16,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62266430] [2022-12-06 04:09:16,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62266430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:16,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:16,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:16,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058737984] [2022-12-06 04:09:16,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:16,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:16,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:16,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:16,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:16,730 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 04:09:16,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 260 flow. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-12-06 04:09:16,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:16,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 04:09:16,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:17,187 INFO L130 PetriNetUnfolder]: 3026/4716 cut-off events. [2022-12-06 04:09:17,188 INFO L131 PetriNetUnfolder]: For 8074/8074 co-relation queries the response was YES. [2022-12-06 04:09:17,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16489 conditions, 4716 events. 3026/4716 cut-off events. For 8074/8074 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 24867 event pairs, 307 based on Foata normal form. 11/4727 useless extension candidates. Maximal degree in co-relation 16466. Up to 2284 conditions per place. [2022-12-06 04:09:17,207 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 66 selfloop transitions, 9 changer transitions 33/108 dead transitions. [2022-12-06 04:09:17,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 108 transitions, 807 flow [2022-12-06 04:09:17,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-12-06 04:09:17,209 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2022-12-06 04:09:17,209 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 260 flow. Second operand 6 states and 74 transitions. [2022-12-06 04:09:17,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 108 transitions, 807 flow [2022-12-06 04:09:17,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 108 transitions, 800 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:17,240 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 281 flow [2022-12-06 04:09:17,240 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2022-12-06 04:09:17,241 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2022-12-06 04:09:17,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:17,241 INFO L89 Accepts]: Start accepts. Operand has 62 places, 47 transitions, 281 flow [2022-12-06 04:09:17,242 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:17,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:17,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 47 transitions, 281 flow [2022-12-06 04:09:17,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 47 transitions, 281 flow [2022-12-06 04:09:17,280 INFO L130 PetriNetUnfolder]: 281/681 cut-off events. [2022-12-06 04:09:17,280 INFO L131 PetriNetUnfolder]: For 1063/1091 co-relation queries the response was YES. [2022-12-06 04:09:17,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2229 conditions, 681 events. 281/681 cut-off events. For 1063/1091 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4323 event pairs, 35 based on Foata normal form. 1/637 useless extension candidates. Maximal degree in co-relation 2206. Up to 305 conditions per place. [2022-12-06 04:09:17,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 47 transitions, 281 flow [2022-12-06 04:09:17,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 518 [2022-12-06 04:09:17,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:17,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-06 04:09:17,329 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 277 flow [2022-12-06 04:09:17,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-12-06 04:09:17,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:17,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:17,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:09:17,330 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:17,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1437389867, now seen corresponding path program 2 times [2022-12-06 04:09:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:17,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148319989] [2022-12-06 04:09:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:17,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:17,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:17,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148319989] [2022-12-06 04:09:17,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148319989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:17,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:17,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:09:17,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924030591] [2022-12-06 04:09:17,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:17,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:09:17,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:17,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:09:17,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:09:17,488 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 04:09:17,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 277 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-12-06 04:09:17,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:17,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 04:09:17,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:17,831 INFO L130 PetriNetUnfolder]: 1813/2984 cut-off events. [2022-12-06 04:09:17,831 INFO L131 PetriNetUnfolder]: For 4391/4495 co-relation queries the response was YES. [2022-12-06 04:09:17,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10270 conditions, 2984 events. 1813/2984 cut-off events. For 4391/4495 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 17617 event pairs, 252 based on Foata normal form. 126/2984 useless extension candidates. Maximal degree in co-relation 10244. Up to 1013 conditions per place. [2022-12-06 04:09:17,843 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 30 selfloop transitions, 17 changer transitions 40/91 dead transitions. [2022-12-06 04:09:17,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 91 transitions, 631 flow [2022-12-06 04:09:17,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:09:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:09:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-12-06 04:09:17,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-12-06 04:09:17,844 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 277 flow. Second operand 8 states and 117 transitions. [2022-12-06 04:09:17,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 91 transitions, 631 flow [2022-12-06 04:09:17,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 91 transitions, 602 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:17,884 INFO L231 Difference]: Finished difference. Result has 69 places, 37 transitions, 241 flow [2022-12-06 04:09:17,884 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=241, PETRI_PLACES=69, PETRI_TRANSITIONS=37} [2022-12-06 04:09:17,884 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2022-12-06 04:09:17,884 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:17,884 INFO L89 Accepts]: Start accepts. Operand has 69 places, 37 transitions, 241 flow [2022-12-06 04:09:17,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:17,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:17,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 37 transitions, 241 flow [2022-12-06 04:09:17,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 37 transitions, 241 flow [2022-12-06 04:09:17,892 INFO L130 PetriNetUnfolder]: 35/96 cut-off events. [2022-12-06 04:09:17,892 INFO L131 PetriNetUnfolder]: For 147/160 co-relation queries the response was YES. [2022-12-06 04:09:17,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 96 events. 35/96 cut-off events. For 147/160 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 295 event pairs, 3 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 343. Up to 36 conditions per place. [2022-12-06 04:09:17,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 37 transitions, 241 flow [2022-12-06 04:09:17,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 04:09:18,336 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:09:18,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 453 [2022-12-06 04:09:18,337 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 32 transitions, 231 flow [2022-12-06 04:09:18,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-12-06 04:09:18,337 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:18,337 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:18,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:09:18,337 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:18,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1083459079, now seen corresponding path program 1 times [2022-12-06 04:09:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:18,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070715245] [2022-12-06 04:09:18,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:18,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:18,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:18,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070715245] [2022-12-06 04:09:18,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070715245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:18,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:18,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:18,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602997232] [2022-12-06 04:09:18,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:18,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:18,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:18,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:18,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:18,708 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 04:09:18,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 32 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-12-06 04:09:18,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:18,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 04:09:18,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:18,857 INFO L130 PetriNetUnfolder]: 370/642 cut-off events. [2022-12-06 04:09:18,857 INFO L131 PetriNetUnfolder]: For 1807/1807 co-relation queries the response was YES. [2022-12-06 04:09:18,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2679 conditions, 642 events. 370/642 cut-off events. For 1807/1807 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2800 event pairs, 13 based on Foata normal form. 1/642 useless extension candidates. Maximal degree in co-relation 2650. Up to 206 conditions per place. [2022-12-06 04:09:18,860 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 49 selfloop transitions, 5 changer transitions 30/85 dead transitions. [2022-12-06 04:09:18,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 783 flow [2022-12-06 04:09:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:09:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:09:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-12-06 04:09:18,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2022-12-06 04:09:18,861 INFO L175 Difference]: Start difference. First operand has 58 places, 32 transitions, 231 flow. Second operand 7 states and 54 transitions. [2022-12-06 04:09:18,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 783 flow [2022-12-06 04:09:18,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 85 transitions, 615 flow, removed 30 selfloop flow, removed 13 redundant places. [2022-12-06 04:09:18,865 INFO L231 Difference]: Finished difference. Result has 54 places, 34 transitions, 186 flow [2022-12-06 04:09:18,866 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=54, PETRI_TRANSITIONS=34} [2022-12-06 04:09:18,866 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2022-12-06 04:09:18,866 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:18,866 INFO L89 Accepts]: Start accepts. Operand has 54 places, 34 transitions, 186 flow [2022-12-06 04:09:18,867 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:18,867 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:18,867 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 34 transitions, 186 flow [2022-12-06 04:09:18,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 34 transitions, 186 flow [2022-12-06 04:09:18,876 INFO L130 PetriNetUnfolder]: 51/133 cut-off events. [2022-12-06 04:09:18,876 INFO L131 PetriNetUnfolder]: For 154/158 co-relation queries the response was YES. [2022-12-06 04:09:18,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 133 events. 51/133 cut-off events. For 154/158 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 524 event pairs, 5 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 396. Up to 50 conditions per place. [2022-12-06 04:09:18,877 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 34 transitions, 186 flow [2022-12-06 04:09:18,877 INFO L188 LiptonReduction]: Number of co-enabled transitions 174 [2022-12-06 04:09:18,877 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:18,878 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:09:18,878 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 186 flow [2022-12-06 04:09:18,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-12-06 04:09:18,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:18,878 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:18,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:09:18,878 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash 147098971, now seen corresponding path program 2 times [2022-12-06 04:09:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:18,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956891566] [2022-12-06 04:09:18,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:09:18,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:09:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:09:19,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:09:19,003 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:09:19,004 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:09:19,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:09:19,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:09:19,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:09:19,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:09:19,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:09:19,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:09:19,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:09:19,007 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:19,011 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:09:19,011 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:09:19,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:09:19 BasicIcfg [2022-12-06 04:09:19,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:09:19,082 INFO L158 Benchmark]: Toolchain (without parser) took 14821.26ms. Allocated memory was 190.8MB in the beginning and 827.3MB in the end (delta: 636.5MB). Free memory was 165.4MB in the beginning and 560.0MB in the end (delta: -394.6MB). Peak memory consumption was 243.2MB. Max. memory is 8.0GB. [2022-12-06 04:09:19,082 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:09:19,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.80ms. Allocated memory is still 190.8MB. Free memory was 165.1MB in the beginning and 137.2MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:09:19,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.91ms. Allocated memory is still 190.8MB. Free memory was 137.2MB in the beginning and 134.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:09:19,083 INFO L158 Benchmark]: Boogie Preprocessor took 45.24ms. Allocated memory is still 190.8MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:09:19,083 INFO L158 Benchmark]: RCFGBuilder took 664.84ms. Allocated memory is still 190.8MB. Free memory was 132.7MB in the beginning and 99.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-06 04:09:19,084 INFO L158 Benchmark]: TraceAbstraction took 13595.36ms. Allocated memory was 190.8MB in the beginning and 827.3MB in the end (delta: 636.5MB). Free memory was 98.6MB in the beginning and 560.0MB in the end (delta: -461.4MB). Peak memory consumption was 176.1MB. Max. memory is 8.0GB. [2022-12-06 04:09:19,085 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 447.80ms. Allocated memory is still 190.8MB. Free memory was 165.1MB in the beginning and 137.2MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.91ms. Allocated memory is still 190.8MB. Free memory was 137.2MB in the beginning and 134.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.24ms. Allocated memory is still 190.8MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 664.84ms. Allocated memory is still 190.8MB. Free memory was 132.7MB in the beginning and 99.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13595.36ms. Allocated memory was 190.8MB in the beginning and 827.3MB in the end (delta: 636.5MB). Free memory was 98.6MB in the beginning and 560.0MB in the end (delta: -461.4MB). Peak memory consumption was 176.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 137 PlacesBefore, 45 PlacesAfterwards, 126 TransitionsBefore, 33 TransitionsAfterwards, 2852 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 44 TrivialYvCompositions, 51 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2040, independent: 1977, independent conditional: 1977, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2040, independent: 1977, independent conditional: 0, independent unconditional: 1977, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2040, independent: 1977, independent conditional: 0, independent unconditional: 1977, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2040, independent: 1977, independent conditional: 0, independent unconditional: 1977, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1674, independent: 1638, independent conditional: 0, independent unconditional: 1638, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1674, independent: 1624, independent conditional: 0, independent unconditional: 1624, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 121, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2040, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 1674, unknown conditional: 0, unknown unconditional: 1674] , Statistics on independence cache: Total cache size (in pairs): 2471, Positive cache size: 2435, Positive conditional cache size: 0, Positive unconditional cache size: 2435, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 376, independent: 323, independent conditional: 323, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 376, independent: 323, independent conditional: 23, independent unconditional: 300, dependent: 53, dependent conditional: 6, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 376, independent: 323, independent conditional: 23, independent unconditional: 300, dependent: 53, dependent conditional: 6, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 376, independent: 323, independent conditional: 23, independent unconditional: 300, dependent: 53, dependent conditional: 6, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 183, independent: 158, independent conditional: 11, independent unconditional: 147, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 183, independent: 152, independent conditional: 0, independent unconditional: 152, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 90, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 83, dependent conditional: 13, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 376, independent: 165, independent conditional: 12, independent unconditional: 153, dependent: 28, dependent conditional: 4, dependent unconditional: 24, unknown: 183, unknown conditional: 13, unknown unconditional: 170] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 159, Positive conditional cache size: 11, Positive unconditional cache size: 148, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, independent: 137, independent conditional: 137, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 156, independent: 137, independent conditional: 15, independent unconditional: 122, dependent: 19, dependent conditional: 8, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 156, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 156, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 156, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 167, Positive conditional cache size: 11, Positive unconditional cache size: 156, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 143, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 143, independent: 123, independent conditional: 15, independent unconditional: 108, dependent: 20, dependent conditional: 8, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 143, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 143, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 143, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 169, Positive conditional cache size: 11, Positive unconditional cache size: 158, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 45 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 296, independent: 254, independent conditional: 254, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 296, independent: 254, independent conditional: 114, independent unconditional: 140, dependent: 42, dependent conditional: 12, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 296, independent: 254, independent conditional: 90, independent unconditional: 164, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 296, independent: 254, independent conditional: 90, independent unconditional: 164, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 296, independent: 245, independent conditional: 84, independent unconditional: 161, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 11, unknown conditional: 6, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 192, Positive conditional cache size: 17, Positive unconditional cache size: 175, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 51 PlacesBefore, 51 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 303, independent: 253, independent conditional: 253, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 303, independent: 253, independent conditional: 89, independent unconditional: 164, dependent: 50, dependent conditional: 12, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 303, independent: 253, independent conditional: 65, independent unconditional: 188, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 303, independent: 253, independent conditional: 65, independent unconditional: 188, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 6, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 303, independent: 246, independent conditional: 59, independent unconditional: 187, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 199, Positive conditional cache size: 23, Positive unconditional cache size: 176, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 52 PlacesBefore, 51 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 311, independent: 275, independent conditional: 275, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 311, independent: 275, independent conditional: 117, independent unconditional: 158, dependent: 36, dependent conditional: 9, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 320, independent: 275, independent conditional: 69, independent unconditional: 206, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 320, independent: 275, independent conditional: 69, independent unconditional: 206, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 5, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 320, independent: 255, independent conditional: 64, independent unconditional: 191, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 20, unknown conditional: 5, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 271, Positive conditional cache size: 29, Positive unconditional cache size: 242, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 66, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 57 PlacesBefore, 57 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 596 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 359, independent: 315, independent conditional: 315, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 359, independent: 315, independent conditional: 175, independent unconditional: 140, dependent: 44, dependent conditional: 12, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 359, independent: 315, independent conditional: 127, independent unconditional: 188, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 359, independent: 315, independent conditional: 127, independent unconditional: 188, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 359, independent: 306, independent conditional: 118, independent unconditional: 188, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 14, unknown conditional: 9, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 280, Positive conditional cache size: 38, Positive unconditional cache size: 242, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 222, independent: 190, independent conditional: 190, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 222, independent: 190, independent conditional: 113, independent unconditional: 77, dependent: 32, dependent conditional: 12, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 222, independent: 190, independent conditional: 93, independent unconditional: 97, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222, independent: 190, independent conditional: 93, independent unconditional: 97, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 222, independent: 186, independent conditional: 90, independent unconditional: 96, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 344, Positive cache size: 307, Positive conditional cache size: 42, Positive unconditional cache size: 265, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 61 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 140, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 140, independent: 110, independent conditional: 78, independent unconditional: 32, dependent: 30, dependent conditional: 8, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 148, independent: 110, independent conditional: 68, independent unconditional: 42, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 148, independent: 110, independent conditional: 68, independent unconditional: 42, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 148, independent: 108, independent conditional: 66, independent unconditional: 42, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 362, Positive cache size: 324, Positive conditional cache size: 45, Positive unconditional cache size: 279, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 63 PlacesBefore, 58 PlacesAfterwards, 37 TransitionsBefore, 32 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 97, independent: 75, independent conditional: 43, independent unconditional: 32, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, independent: 75, independent conditional: 42, independent unconditional: 33, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, independent: 75, independent conditional: 42, independent unconditional: 33, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, independent: 70, independent conditional: 40, independent unconditional: 30, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 424, Positive cache size: 385, Positive conditional cache size: 49, Positive unconditional cache size: 336, Negative cache size: 39, Negative conditional cache size: 2, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 424, Positive cache size: 385, Positive conditional cache size: 49, Positive unconditional cache size: 336, Negative cache size: 39, Negative conditional cache size: 2, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t437; [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t437, ((void *)0), P0, ((void *)0))=-3, t437={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t438; [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t438, ((void *)0), P1, ((void *)0))=-2, t437={5:0}, t438={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t439; [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t439, ((void *)0), P2, ((void *)0))=-1, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L864] 0 pthread_t t440; [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t440, ((void *)0), P3, ((void *)0))=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 4 z = 1 [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 a = 1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 434 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 434 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1170 IncrementalHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 25 mSDtfsCounter, 1170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:09:19,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...