/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:45:34,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:45:34,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:45:34,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:45:34,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:45:34,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:45:34,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:45:34,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:45:34,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:45:34,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:45:34,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:45:34,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:45:34,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:45:34,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:45:34,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:45:34,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:45:34,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:45:34,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:45:34,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:45:34,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:45:34,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:45:34,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:45:34,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:45:34,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:45:34,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:45:34,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:45:34,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:45:34,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:45:34,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:45:34,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:45:34,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:45:34,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:45:34,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:45:34,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:45:34,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:45:34,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:45:34,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:45:34,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:45:34,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:45:34,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:45:34,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:45:34,553 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:45:34,580 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:45:34,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:45:34,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:45:34,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:45:34,582 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:45:34,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:45:34,583 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:45:34,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:45:34,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:45:34,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:45:34,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:45:34,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:45:34,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:45:34,584 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:45:34,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:45:34,584 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:45:34,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:45:34,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:45:34,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:45:34,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:45:34,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:45:34,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:45:34,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:45:34,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:45:34,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:45:34,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:45:34,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:45:34,585 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:45:34,586 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 06:45:34,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:45:34,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:45:34,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:45:34,878 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:45:34,879 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:45:34,879 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:45:36,143 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:45:36,385 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:45:36,386 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:45:36,404 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded69ec50/107d31913146466ebef1db1edeb6cd61/FLAG92d91c1e3 [2022-12-06 06:45:36,415 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded69ec50/107d31913146466ebef1db1edeb6cd61 [2022-12-06 06:45:36,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:45:36,418 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:45:36,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:45:36,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:45:36,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:45:36,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:45:36" (1/1) ... [2022-12-06 06:45:36,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2569c11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36, skipping insertion in model container [2022-12-06 06:45:36,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:45:36" (1/1) ... [2022-12-06 06:45:36,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:45:36,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:45:36,563 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 06:45:36,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:45:36,747 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:45:36,755 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/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-06 06:45:36,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:45:36,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:45:36,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:45:36,845 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:45:36,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36 WrapperNode [2022-12-06 06:45:36,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:45:36,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:45:36,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:45:36,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:45:36,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36" (1/1) ... [2022-12-06 06:45:36,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36" (1/1) ... [2022-12-06 06:45:36,906 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-06 06:45:36,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:45:36,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:45:36,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:45:36,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:45:36,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36" (1/1) ... [2022-12-06 06:45:36,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36" (1/1) ... [2022-12-06 06:45:36,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36" (1/1) ... [2022-12-06 06:45:36,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36" (1/1) ... [2022-12-06 06:45:36,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36" (1/1) ... [2022-12-06 06:45:36,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36" (1/1) ... [2022-12-06 06:45:36,949 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36" (1/1) ... [2022-12-06 06:45:36,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36" (1/1) ... [2022-12-06 06:45:36,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:45:36,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:45:36,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:45:36,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:45:36,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36" (1/1) ... [2022-12-06 06:45:36,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:45:36,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:45:37,018 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 06:45:37,071 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 06:45:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:45:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:45:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:45:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:45:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:45:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:45:37,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:45:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:45:37,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:45:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:45:37,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:45:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:45:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:45:37,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:45:37,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:45:37,098 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 06:45:37,308 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:45:37,309 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:45:37,635 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:45:37,743 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:45:37,744 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:45:37,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:45:37 BoogieIcfgContainer [2022-12-06 06:45:37,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:45:37,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:45:37,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:45:37,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:45:37,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:45:36" (1/3) ... [2022-12-06 06:45:37,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5d961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:45:37, skipping insertion in model container [2022-12-06 06:45:37,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:45:36" (2/3) ... [2022-12-06 06:45:37,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5d961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:45:37, skipping insertion in model container [2022-12-06 06:45:37,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:45:37" (3/3) ... [2022-12-06 06:45:37,751 INFO L112 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:45:37,765 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:45:37,765 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:45:37,765 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:45:37,843 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:45:37,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-06 06:45:37,931 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-06 06:45:37,932 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:45:37,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 06:45:37,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-06 06:45:37,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-06 06:45:37,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:37,970 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-06 06:45:37,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-06 06:45:38,000 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-06 06:45:38,001 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:45:38,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 06:45:38,004 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-06 06:45:38,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 1676 [2022-12-06 06:45:41,460 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-06 06:45:41,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:45:41,511 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;@24a7a2d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:45:41,511 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:45:41,520 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 06:45:41,520 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:45:41,520 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:41,521 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:41,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:41,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash -580746594, now seen corresponding path program 1 times [2022-12-06 06:45:41,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:41,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156520313] [2022-12-06 06:45:41,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:41,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:41,855 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 06:45:41,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:41,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156520313] [2022-12-06 06:45:41,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156520313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:41,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:41,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:45:41,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181142125] [2022-12-06 06:45:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:41,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:45:41,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:41,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:45:41,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:45:41,883 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:45:41,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 06:45:41,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:41,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:45:41,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:42,016 INFO L130 PetriNetUnfolder]: 615/1020 cut-off events. [2022-12-06 06:45:42,016 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 06:45:42,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1991 conditions, 1020 events. 615/1020 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5095 event pairs, 129 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1980. Up to 703 conditions per place. [2022-12-06 06:45:42,024 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 23 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-06 06:45:42,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 131 flow [2022-12-06 06:45:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:45:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:45:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 06:45:42,033 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-06 06:45:42,034 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 43 transitions. [2022-12-06 06:45:42,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 131 flow [2022-12-06 06:45:42,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:45:42,038 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 50 flow [2022-12-06 06:45:42,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-06 06:45:42,041 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 06:45:42,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:42,042 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 50 flow [2022-12-06 06:45:42,043 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:42,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:42,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 50 flow [2022-12-06 06:45:42,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 06:45:42,048 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:45:42,048 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:45:42,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:45:42,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 06:45:42,048 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 06:45:42,166 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:45:42,167 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 06:45:42,167 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 48 flow [2022-12-06 06:45:42,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 06:45:42,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:42,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:42,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:45:42,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:42,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash 248248355, now seen corresponding path program 1 times [2022-12-06 06:45:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:42,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815886519] [2022-12-06 06:45:42,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:42,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:42,300 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 06:45:42,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:42,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815886519] [2022-12-06 06:45:42,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815886519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:42,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:42,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:45:42,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252134780] [2022-12-06 06:45:42,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:42,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:45:42,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:42,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:45:42,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:45:42,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:45:42,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 48 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:42,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:42,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:45:42,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:42,491 INFO L130 PetriNetUnfolder]: 951/1470 cut-off events. [2022-12-06 06:45:42,491 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 06:45:42,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3048 conditions, 1470 events. 951/1470 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6754 event pairs, 319 based on Foata normal form. 52/1522 useless extension candidates. Maximal degree in co-relation 3038. Up to 1018 conditions per place. [2022-12-06 06:45:42,499 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 30 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2022-12-06 06:45:42,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 35 transitions, 156 flow [2022-12-06 06:45:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:45:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:45:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 06:45:42,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-06 06:45:42,501 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 48 flow. Second operand 3 states and 36 transitions. [2022-12-06 06:45:42,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 35 transitions, 156 flow [2022-12-06 06:45:42,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 35 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:45:42,502 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 82 flow [2022-12-06 06:45:42,503 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2022-12-06 06:45:42,503 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -4 predicate places. [2022-12-06 06:45:42,503 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:42,503 INFO L89 Accepts]: Start accepts. Operand has 30 places, 23 transitions, 82 flow [2022-12-06 06:45:42,504 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:42,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:42,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 23 transitions, 82 flow [2022-12-06 06:45:42,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 82 flow [2022-12-06 06:45:42,517 INFO L130 PetriNetUnfolder]: 24/99 cut-off events. [2022-12-06 06:45:42,517 INFO L131 PetriNetUnfolder]: For 14/18 co-relation queries the response was YES. [2022-12-06 06:45:42,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 99 events. 24/99 cut-off events. For 14/18 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 441 event pairs, 12 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 180. Up to 45 conditions per place. [2022-12-06 06:45:42,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 82 flow [2022-12-06 06:45:42,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-06 06:45:42,551 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:42,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 06:45:42,553 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 82 flow [2022-12-06 06:45:42,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:42,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:42,554 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:42,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:45:42,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:42,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:42,555 INFO L85 PathProgramCache]: Analyzing trace with hash -894235628, now seen corresponding path program 1 times [2022-12-06 06:45:42,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:42,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930000697] [2022-12-06 06:45:42,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:42,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:42,754 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 06:45:42,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:42,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930000697] [2022-12-06 06:45:42,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930000697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:42,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:42,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:45:42,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739182729] [2022-12-06 06:45:42,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:42,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:45:42,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:42,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:45:42,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:45:42,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:45:42,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:42,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:42,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:45:42,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:42,921 INFO L130 PetriNetUnfolder]: 575/996 cut-off events. [2022-12-06 06:45:42,921 INFO L131 PetriNetUnfolder]: For 371/371 co-relation queries the response was YES. [2022-12-06 06:45:42,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2390 conditions, 996 events. 575/996 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5035 event pairs, 110 based on Foata normal form. 96/1063 useless extension candidates. Maximal degree in co-relation 2378. Up to 625 conditions per place. [2022-12-06 06:45:42,927 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 43 selfloop transitions, 8 changer transitions 3/58 dead transitions. [2022-12-06 06:45:42,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 58 transitions, 300 flow [2022-12-06 06:45:42,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:45:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:45:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 06:45:42,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6105263157894737 [2022-12-06 06:45:42,929 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 82 flow. Second operand 5 states and 58 transitions. [2022-12-06 06:45:42,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 58 transitions, 300 flow [2022-12-06 06:45:42,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 58 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:45:42,932 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 132 flow [2022-12-06 06:45:42,933 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2022-12-06 06:45:42,933 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-06 06:45:42,933 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:42,933 INFO L89 Accepts]: Start accepts. Operand has 35 places, 30 transitions, 132 flow [2022-12-06 06:45:42,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:42,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:42,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 30 transitions, 132 flow [2022-12-06 06:45:42,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 30 transitions, 132 flow [2022-12-06 06:45:42,956 INFO L130 PetriNetUnfolder]: 114/286 cut-off events. [2022-12-06 06:45:42,956 INFO L131 PetriNetUnfolder]: For 142/220 co-relation queries the response was YES. [2022-12-06 06:45:42,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 286 events. 114/286 cut-off events. For 142/220 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 1714 event pairs, 44 based on Foata normal form. 5/260 useless extension candidates. Maximal degree in co-relation 724. Up to 158 conditions per place. [2022-12-06 06:45:42,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 30 transitions, 132 flow [2022-12-06 06:45:42,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 06:45:42,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:45:43,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 06:45:43,000 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 126 flow [2022-12-06 06:45:43,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:45:43,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:43,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:43,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:45:43,001 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1158460356, now seen corresponding path program 1 times [2022-12-06 06:45:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:43,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053247304] [2022-12-06 06:45:43,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:43,127 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 06:45:43,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:43,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053247304] [2022-12-06 06:45:43,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053247304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:43,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:43,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:45:43,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786522572] [2022-12-06 06:45:43,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:43,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:45:43,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:43,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:45:43,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:45:43,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:45:43,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 4.2) 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 06:45:43,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:43,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:45:43,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:43,237 INFO L130 PetriNetUnfolder]: 276/529 cut-off events. [2022-12-06 06:45:43,237 INFO L131 PetriNetUnfolder]: For 310/310 co-relation queries the response was YES. [2022-12-06 06:45:43,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1650 conditions, 529 events. 276/529 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2438 event pairs, 46 based on Foata normal form. 61/576 useless extension candidates. Maximal degree in co-relation 1635. Up to 228 conditions per place. [2022-12-06 06:45:43,240 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 42 selfloop transitions, 11 changer transitions 13/70 dead transitions. [2022-12-06 06:45:43,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 70 transitions, 404 flow [2022-12-06 06:45:43,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:45:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:45:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 06:45:43,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6140350877192983 [2022-12-06 06:45:43,241 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 126 flow. Second operand 6 states and 70 transitions. [2022-12-06 06:45:43,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 70 transitions, 404 flow [2022-12-06 06:45:43,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 70 transitions, 398 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:45:43,244 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 190 flow [2022-12-06 06:45:43,244 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-06 06:45:43,245 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-06 06:45:43,245 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:43,245 INFO L89 Accepts]: Start accepts. Operand has 39 places, 33 transitions, 190 flow [2022-12-06 06:45:43,245 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:43,246 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:43,246 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 190 flow [2022-12-06 06:45:43,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 190 flow [2022-12-06 06:45:43,258 INFO L130 PetriNetUnfolder]: 49/162 cut-off events. [2022-12-06 06:45:43,258 INFO L131 PetriNetUnfolder]: For 261/339 co-relation queries the response was YES. [2022-12-06 06:45:43,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 162 events. 49/162 cut-off events. For 261/339 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 821 event pairs, 8 based on Foata normal form. 1/155 useless extension candidates. Maximal degree in co-relation 546. Up to 99 conditions per place. [2022-12-06 06:45:43,259 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 33 transitions, 190 flow [2022-12-06 06:45:43,260 INFO L188 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-06 06:45:43,290 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:45:43,291 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 06:45:43,291 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 182 flow [2022-12-06 06:45:43,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) 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 06:45:43,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:43,291 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:43,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:45:43,291 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:43,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 956565081, now seen corresponding path program 1 times [2022-12-06 06:45:43,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:43,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471401301] [2022-12-06 06:45:43,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:43,398 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 06:45:43,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:43,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471401301] [2022-12-06 06:45:43,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471401301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:43,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:43,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:45:43,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67879772] [2022-12-06 06:45:43,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:43,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:45:43,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:43,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:45:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:45:43,399 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:45:43,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 182 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 06:45:43,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:43,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:45:43,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:43,519 INFO L130 PetriNetUnfolder]: 306/583 cut-off events. [2022-12-06 06:45:43,519 INFO L131 PetriNetUnfolder]: For 836/836 co-relation queries the response was YES. [2022-12-06 06:45:43,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 583 events. 306/583 cut-off events. For 836/836 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2612 event pairs, 5 based on Foata normal form. 8/591 useless extension candidates. Maximal degree in co-relation 2038. Up to 263 conditions per place. [2022-12-06 06:45:43,522 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 63 selfloop transitions, 11 changer transitions 1/75 dead transitions. [2022-12-06 06:45:43,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 75 transitions, 550 flow [2022-12-06 06:45:43,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:45:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:45:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 06:45:43,523 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6105263157894737 [2022-12-06 06:45:43,523 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 182 flow. Second operand 5 states and 58 transitions. [2022-12-06 06:45:43,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 75 transitions, 550 flow [2022-12-06 06:45:43,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 75 transitions, 483 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-06 06:45:43,527 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 207 flow [2022-12-06 06:45:43,527 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2022-12-06 06:45:43,528 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2022-12-06 06:45:43,528 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:43,528 INFO L89 Accepts]: Start accepts. Operand has 41 places, 36 transitions, 207 flow [2022-12-06 06:45:43,528 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:43,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:43,529 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 36 transitions, 207 flow [2022-12-06 06:45:43,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 207 flow [2022-12-06 06:45:43,543 INFO L130 PetriNetUnfolder]: 58/189 cut-off events. [2022-12-06 06:45:43,543 INFO L131 PetriNetUnfolder]: For 191/232 co-relation queries the response was YES. [2022-12-06 06:45:43,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 189 events. 58/189 cut-off events. For 191/232 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 915 event pairs, 6 based on Foata normal form. 1/184 useless extension candidates. Maximal degree in co-relation 562. Up to 69 conditions per place. [2022-12-06 06:45:43,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 36 transitions, 207 flow [2022-12-06 06:45:43,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 06:45:43,546 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:45:43,547 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 06:45:43,547 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 207 flow [2022-12-06 06:45:43,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 06:45:43,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:43,547 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:43,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:45:43,547 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:43,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:43,548 INFO L85 PathProgramCache]: Analyzing trace with hash -106285999, now seen corresponding path program 2 times [2022-12-06 06:45:43,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:43,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348920133] [2022-12-06 06:45:43,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:43,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:43,679 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 06:45:43,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:43,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348920133] [2022-12-06 06:45:43,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348920133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:43,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:43,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:45:43,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776268172] [2022-12-06 06:45:43,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:43,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:45:43,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:43,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:45:43,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:45:43,681 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:45:43,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 06:45:43,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:43,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:45:43,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:43,781 INFO L130 PetriNetUnfolder]: 215/427 cut-off events. [2022-12-06 06:45:43,781 INFO L131 PetriNetUnfolder]: For 703/710 co-relation queries the response was YES. [2022-12-06 06:45:43,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 427 events. 215/427 cut-off events. For 703/710 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1930 event pairs, 32 based on Foata normal form. 26/441 useless extension candidates. Maximal degree in co-relation 1568. Up to 157 conditions per place. [2022-12-06 06:45:43,784 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 36 selfloop transitions, 10 changer transitions 20/74 dead transitions. [2022-12-06 06:45:43,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 74 transitions, 541 flow [2022-12-06 06:45:43,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:45:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:45:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-06 06:45:43,785 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48120300751879697 [2022-12-06 06:45:43,785 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 207 flow. Second operand 7 states and 64 transitions. [2022-12-06 06:45:43,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 74 transitions, 541 flow [2022-12-06 06:45:43,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 529 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 06:45:43,788 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 229 flow [2022-12-06 06:45:43,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2022-12-06 06:45:43,788 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-12-06 06:45:43,788 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:43,788 INFO L89 Accepts]: Start accepts. Operand has 50 places, 35 transitions, 229 flow [2022-12-06 06:45:43,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:43,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:43,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 35 transitions, 229 flow [2022-12-06 06:45:43,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 35 transitions, 229 flow [2022-12-06 06:45:43,801 INFO L130 PetriNetUnfolder]: 35/118 cut-off events. [2022-12-06 06:45:43,801 INFO L131 PetriNetUnfolder]: For 184/225 co-relation queries the response was YES. [2022-12-06 06:45:43,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 118 events. 35/118 cut-off events. For 184/225 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 492 event pairs, 0 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 418. Up to 40 conditions per place. [2022-12-06 06:45:43,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 35 transitions, 229 flow [2022-12-06 06:45:43,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 06:45:44,171 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:45:44,172 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 384 [2022-12-06 06:45:44,172 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 225 flow [2022-12-06 06:45:44,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 06:45:44,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:44,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:44,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:45:44,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:44,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:44,172 INFO L85 PathProgramCache]: Analyzing trace with hash -875636791, now seen corresponding path program 1 times [2022-12-06 06:45:44,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:44,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254073355] [2022-12-06 06:45:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:44,295 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 06:45:44,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:44,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254073355] [2022-12-06 06:45:44,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254073355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:44,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:44,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:45:44,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816784655] [2022-12-06 06:45:44,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:44,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:45:44,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:44,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:45:44,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:45:44,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 06:45:44,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 225 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 06:45:44,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:44,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 06:45:44,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:44,362 INFO L130 PetriNetUnfolder]: 236/472 cut-off events. [2022-12-06 06:45:44,362 INFO L131 PetriNetUnfolder]: For 1235/1244 co-relation queries the response was YES. [2022-12-06 06:45:44,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1983 conditions, 472 events. 236/472 cut-off events. For 1235/1244 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2258 event pairs, 93 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 1958. Up to 261 conditions per place. [2022-12-06 06:45:44,364 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 25 selfloop transitions, 3 changer transitions 20/50 dead transitions. [2022-12-06 06:45:44,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 442 flow [2022-12-06 06:45:44,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:45:44,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:45:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 06:45:44,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2022-12-06 06:45:44,365 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 225 flow. Second operand 3 states and 27 transitions. [2022-12-06 06:45:44,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 442 flow [2022-12-06 06:45:44,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 379 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-06 06:45:44,368 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 158 flow [2022-12-06 06:45:44,369 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-06 06:45:44,369 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 06:45:44,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:44,369 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 158 flow [2022-12-06 06:45:44,370 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:44,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:44,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 158 flow [2022-12-06 06:45:44,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 27 transitions, 158 flow [2022-12-06 06:45:44,374 INFO L130 PetriNetUnfolder]: 13/47 cut-off events. [2022-12-06 06:45:44,374 INFO L131 PetriNetUnfolder]: For 57/60 co-relation queries the response was YES. [2022-12-06 06:45:44,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 47 events. 13/47 cut-off events. For 57/60 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 0 based on Foata normal form. 2/48 useless extension candidates. Maximal degree in co-relation 132. Up to 16 conditions per place. [2022-12-06 06:45:44,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 158 flow [2022-12-06 06:45:44,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 06:45:44,494 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:45:44,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-06 06:45:44,495 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 162 flow [2022-12-06 06:45:44,495 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 06:45:44,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:44,495 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:44,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:45:44,495 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:44,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:44,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1878843346, now seen corresponding path program 1 times [2022-12-06 06:45:44,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:44,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960465694] [2022-12-06 06:45:44,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:44,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:44,834 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 06:45:44,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:44,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960465694] [2022-12-06 06:45:44,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960465694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:44,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:44,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:45:44,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81114475] [2022-12-06 06:45:44,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:44,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:45:44,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:44,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:45:44,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:45:44,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 06:45:44,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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 06:45:44,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:44,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 06:45:44,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:44,921 INFO L130 PetriNetUnfolder]: 64/147 cut-off events. [2022-12-06 06:45:44,921 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-12-06 06:45:44,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 147 events. 64/147 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 533 event pairs, 8 based on Foata normal form. 1/148 useless extension candidates. Maximal degree in co-relation 557. Up to 47 conditions per place. [2022-12-06 06:45:44,922 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 26 selfloop transitions, 5 changer transitions 17/49 dead transitions. [2022-12-06 06:45:44,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 402 flow [2022-12-06 06:45:44,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:45:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:45:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-12-06 06:45:44,923 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3425925925925926 [2022-12-06 06:45:44,923 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 162 flow. Second operand 6 states and 37 transitions. [2022-12-06 06:45:44,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 402 flow [2022-12-06 06:45:44,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 349 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 06:45:44,925 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 151 flow [2022-12-06 06:45:44,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-06 06:45:44,926 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 06:45:44,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:44,926 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 151 flow [2022-12-06 06:45:44,926 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:44,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:44,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 151 flow [2022-12-06 06:45:44,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 27 transitions, 151 flow [2022-12-06 06:45:44,931 INFO L130 PetriNetUnfolder]: 14/52 cut-off events. [2022-12-06 06:45:44,931 INFO L131 PetriNetUnfolder]: For 53/54 co-relation queries the response was YES. [2022-12-06 06:45:44,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 52 events. 14/52 cut-off events. For 53/54 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 0 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 146. Up to 18 conditions per place. [2022-12-06 06:45:44,932 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 27 transitions, 151 flow [2022-12-06 06:45:44,932 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 06:45:45,119 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:45:45,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 194 [2022-12-06 06:45:45,120 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 153 flow [2022-12-06 06:45:45,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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 06:45:45,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:45,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:45,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:45:45,121 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:45,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:45,121 INFO L85 PathProgramCache]: Analyzing trace with hash -470200895, now seen corresponding path program 1 times [2022-12-06 06:45:45,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:45,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193384434] [2022-12-06 06:45:45,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:45,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:45:45,233 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 06:45:45,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:45:45,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193384434] [2022-12-06 06:45:45,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193384434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:45:45,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:45:45,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:45:45,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926902743] [2022-12-06 06:45:45,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:45:45,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:45:45,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:45:45,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:45:45,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:45:45,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:45:45,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 153 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 06:45:45,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:45:45,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:45:45,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:45:45,287 INFO L130 PetriNetUnfolder]: 55/137 cut-off events. [2022-12-06 06:45:45,287 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2022-12-06 06:45:45,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 137 events. 55/137 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 492 event pairs, 12 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 514. Up to 59 conditions per place. [2022-12-06 06:45:45,288 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 21 selfloop transitions, 1 changer transitions 23/45 dead transitions. [2022-12-06 06:45:45,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 338 flow [2022-12-06 06:45:45,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:45:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:45:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 06:45:45,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40789473684210525 [2022-12-06 06:45:45,289 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 153 flow. Second operand 4 states and 31 transitions. [2022-12-06 06:45:45,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 338 flow [2022-12-06 06:45:45,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 324 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 06:45:45,290 INFO L231 Difference]: Finished difference. Result has 42 places, 21 transitions, 112 flow [2022-12-06 06:45:45,290 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=21} [2022-12-06 06:45:45,291 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 06:45:45,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:45:45,291 INFO L89 Accepts]: Start accepts. Operand has 42 places, 21 transitions, 112 flow [2022-12-06 06:45:45,292 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:45:45,292 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:45:45,292 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 21 transitions, 112 flow [2022-12-06 06:45:45,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 21 transitions, 112 flow [2022-12-06 06:45:45,295 INFO L130 PetriNetUnfolder]: 5/24 cut-off events. [2022-12-06 06:45:45,295 INFO L131 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2022-12-06 06:45:45,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 24 events. 5/24 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 63. Up to 8 conditions per place. [2022-12-06 06:45:45,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 21 transitions, 112 flow [2022-12-06 06:45:45,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-06 06:45:46,179 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] $Ultimate##0-->L803: Formula: (and (= v_~y$r_buff0_thd0~0_140 v_~y$r_buff1_thd0~0_147) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_307) (= v_~z~0_74 1) (= v_~y$w_buff0~0_209 1) (= |v_P2Thread1of1ForFork0_~arg#1.offset_23| |v_P2Thread1of1ForFork0_#in~arg#1.offset_23|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|) (= v_~y$r_buff0_thd3~0_155 v_~y$r_buff1_thd3~0_121) (= v_~y$w_buff1~0_171 v_~y$w_buff0~0_210) (= |v_P2Thread1of1ForFork0_#in~arg#1.base_23| |v_P2Thread1of1ForFork0_~arg#1.base_23|) (= v_~y$r_buff0_thd3~0_154 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_307 256) 0)) (not (= (mod v_~y$w_buff0_used~0_344 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_344 1) (= v_~y$r_buff0_thd1~0_45 v_~y$r_buff1_thd1~0_51) (= v_~y$r_buff0_thd2~0_151 v_~y$r_buff1_thd2~0_160) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0))) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_23|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_23|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_210, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_151, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_45} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_23|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_160, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_121, ~y$w_buff1~0=v_~y$w_buff1~0_171, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_23|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_154, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_209, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_151, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_45, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_23|, ~z~0=v_~z~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_307} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [432] $Ultimate##0-->P0EXIT: Formula: (and (= v_~z~0_82 2) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= |v_P0Thread1of1ForFork1_#res.offset_19| 0) (= v_~__unbuffered_cnt~0_167 (+ v_~__unbuffered_cnt~0_168 1)) (= |v_P0Thread1of1ForFork1_#res.base_19| 0) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= v_~x~0_49 v_~__unbuffered_p0_EAX~0_60)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_168, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x~0=v_~x~0_49} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_19|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_167, ~z~0=v_~z~0_82, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 06:45:46,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] $Ultimate##0-->L803: Formula: (and (= v_~y$r_buff0_thd0~0_140 v_~y$r_buff1_thd0~0_147) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_307) (= v_~z~0_74 1) (= v_~y$w_buff0~0_209 1) (= |v_P2Thread1of1ForFork0_~arg#1.offset_23| |v_P2Thread1of1ForFork0_#in~arg#1.offset_23|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|) (= v_~y$r_buff0_thd3~0_155 v_~y$r_buff1_thd3~0_121) (= v_~y$w_buff1~0_171 v_~y$w_buff0~0_210) (= |v_P2Thread1of1ForFork0_#in~arg#1.base_23| |v_P2Thread1of1ForFork0_~arg#1.base_23|) (= v_~y$r_buff0_thd3~0_154 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_307 256) 0)) (not (= (mod v_~y$w_buff0_used~0_344 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_344 1) (= v_~y$r_buff0_thd1~0_45 v_~y$r_buff1_thd1~0_51) (= v_~y$r_buff0_thd2~0_151 v_~y$r_buff1_thd2~0_160) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0))) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_23|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_23|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_155, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_210, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_151, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_45} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_23|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_160, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_121, ~y$w_buff1~0=v_~y$w_buff1~0_171, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_23|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_154, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_209, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_151, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_45, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_23|, ~z~0=v_~z~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_147, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_307} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [429] $Ultimate##0-->L749: Formula: (and (= v_~x~0_45 v_~__unbuffered_p0_EAX~0_58) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= v_~z~0_78 2) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x~0=v_~x~0_45} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, ~z~0=v_~z~0_78, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x~0=v_~x~0_45, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~z~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 06:45:46,408 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:45:46,409 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1118 [2022-12-06 06:45:46,409 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 18 transitions, 126 flow [2022-12-06 06:45:46,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 06:45:46,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:45:46,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:46,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:45:46,410 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:45:46,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:45:46,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1482647681, now seen corresponding path program 1 times [2022-12-06 06:45:46,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:45:46,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127916663] [2022-12-06 06:45:46,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:45:46,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:45:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:45:46,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:45:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:45:46,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:45:46,480 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:45:46,481 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:45:46,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:45:46,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:45:46,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:45:46,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:45:46,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:45:46,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:45:46,483 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:45:46,489 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:45:46,490 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:45:46,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:45:46 BasicIcfg [2022-12-06 06:45:46,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:45:46,549 INFO L158 Benchmark]: Toolchain (without parser) took 10131.70ms. Allocated memory was 166.7MB in the beginning and 363.9MB in the end (delta: 197.1MB). Free memory was 121.4MB in the beginning and 140.0MB in the end (delta: -18.6MB). Peak memory consumption was 179.0MB. Max. memory is 8.0GB. [2022-12-06 06:45:46,550 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 166.7MB. Free memory was 142.9MB in the beginning and 142.8MB in the end (delta: 80.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:45:46,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.71ms. Allocated memory is still 166.7MB. Free memory was 120.9MB in the beginning and 95.1MB in the end (delta: 25.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:45:46,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.65ms. Allocated memory is still 166.7MB. Free memory was 95.1MB in the beginning and 92.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:45:46,550 INFO L158 Benchmark]: Boogie Preprocessor took 43.65ms. Allocated memory is still 166.7MB. Free memory was 92.6MB in the beginning and 91.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:45:46,550 INFO L158 Benchmark]: RCFGBuilder took 792.27ms. Allocated memory is still 166.7MB. Free memory was 91.0MB in the beginning and 61.1MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 06:45:46,551 INFO L158 Benchmark]: TraceAbstraction took 8802.20ms. Allocated memory was 166.7MB in the beginning and 363.9MB in the end (delta: 197.1MB). Free memory was 60.0MB in the beginning and 140.0MB in the end (delta: -80.0MB). Peak memory consumption was 118.2MB. Max. memory is 8.0GB. [2022-12-06 06:45:46,551 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.10ms. Allocated memory is still 166.7MB. Free memory was 142.9MB in the beginning and 142.8MB in the end (delta: 80.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.71ms. Allocated memory is still 166.7MB. Free memory was 120.9MB in the beginning and 95.1MB in the end (delta: 25.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.65ms. Allocated memory is still 166.7MB. Free memory was 95.1MB in the beginning and 92.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.65ms. Allocated memory is still 166.7MB. Free memory was 92.6MB in the beginning and 91.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 792.27ms. Allocated memory is still 166.7MB. Free memory was 91.0MB in the beginning and 61.1MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 8802.20ms. Allocated memory was 166.7MB in the beginning and 363.9MB in the end (delta: 197.1MB). Free memory was 60.0MB in the beginning and 140.0MB in the end (delta: -80.0MB). Peak memory consumption was 118.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 111 PlacesBefore, 34 PlacesAfterwards, 103 TransitionsBefore, 25 TransitionsAfterwards, 1676 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1500, independent: 1457, independent conditional: 1457, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1500, independent: 1457, independent conditional: 0, independent unconditional: 1457, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1500, independent: 1457, independent conditional: 0, independent unconditional: 1457, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1500, independent: 1457, independent conditional: 0, independent unconditional: 1457, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1112, independent: 1083, independent conditional: 0, independent unconditional: 1083, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1112, independent: 1063, independent conditional: 0, independent unconditional: 1063, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1500, independent: 374, independent conditional: 0, independent unconditional: 374, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1112, unknown conditional: 0, unknown unconditional: 1112] , Statistics on independence cache: Total cache size (in pairs): 1906, Positive cache size: 1877, Positive conditional cache size: 0, Positive unconditional cache size: 1877, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, 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, 29 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 142, independent conditional: 142, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 179, independent: 142, independent conditional: 18, independent unconditional: 124, dependent: 37, dependent conditional: 6, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 179, independent: 142, independent conditional: 18, independent unconditional: 124, dependent: 37, dependent conditional: 6, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 179, independent: 142, independent conditional: 18, independent unconditional: 124, dependent: 37, dependent conditional: 6, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 88, independent: 70, independent conditional: 8, independent unconditional: 62, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 88, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 84, dependent conditional: 37, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 72, independent conditional: 10, independent unconditional: 62, dependent: 19, dependent conditional: 4, dependent unconditional: 15, unknown: 88, unknown conditional: 10, unknown unconditional: 78] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 75, Positive conditional cache size: 9, Positive unconditional cache size: 66, Negative cache size: 18, Negative conditional cache size: 2, Negative unconditional cache size: 16, 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, 30 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 37, independent conditional: 13, independent unconditional: 24, dependent: 11, dependent conditional: 4, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 92, Positive conditional cache size: 9, Positive unconditional cache size: 83, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 117, independent: 99, independent conditional: 39, independent unconditional: 60, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 117, independent: 99, independent conditional: 39, independent unconditional: 60, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 117, independent: 99, independent conditional: 39, independent unconditional: 60, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 5, 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: 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 117, independent: 91, independent conditional: 34, independent unconditional: 57, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 9, unknown conditional: 5, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 100, Positive conditional cache size: 14, Positive unconditional cache size: 86, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, 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, 39 PlacesBefore, 39 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 98, independent conditional: 98, 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: 118, independent: 98, independent conditional: 26, independent unconditional: 72, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, independent: 98, independent conditional: 26, independent unconditional: 72, 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: 118, independent: 98, independent conditional: 26, independent unconditional: 72, 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: 5, independent: 5, independent conditional: 3, independent unconditional: 2, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 118, independent: 93, independent conditional: 23, independent unconditional: 70, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 105, Positive conditional cache size: 17, Positive unconditional cache size: 88, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, 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, 41 PlacesBefore, 41 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 80, independent conditional: 50, independent unconditional: 30, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 90, independent: 80, independent conditional: 20, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 90, independent: 80, independent conditional: 20, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, 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: 90, independent: 80, independent conditional: 20, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 105, Positive conditional cache size: 17, Positive unconditional cache size: 88, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 48 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 110, independent conditional: 110, 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: 132, independent: 110, independent conditional: 66, independent unconditional: 44, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, independent: 110, independent conditional: 22, independent unconditional: 88, 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: 132, independent: 110, independent conditional: 22, independent unconditional: 88, 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: 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: 132, independent: 110, independent conditional: 22, independent unconditional: 88, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 109, Positive conditional cache size: 17, Positive unconditional cache size: 92, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 66, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 51, independent conditional: 51, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 51, independent conditional: 40, independent unconditional: 11, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 51, independent conditional: 21, independent unconditional: 30, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 51, independent conditional: 21, independent unconditional: 30, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 63, independent: 49, independent conditional: 19, independent unconditional: 30, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 145, Positive conditional cache size: 23, Positive unconditional cache size: 122, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, 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, 41 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 3, independent unconditional: 4, 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: 7, independent: 7, independent conditional: 3, independent unconditional: 4, 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: 7, independent: 7, independent conditional: 3, independent unconditional: 4, 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): 167, Positive cache size: 145, Positive conditional cache size: 23, Positive unconditional cache size: 122, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 38 PlacesBefore, 35 PlacesAfterwards, 21 TransitionsBefore, 18 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 10, 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): 228, Positive cache size: 206, Positive conditional cache size: 24, Positive unconditional cache size: 182, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2577; [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2577, ((void *)0), P0, ((void *)0))=-2, t2577={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L829] 0 pthread_t t2578; [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2578, ((void *)0), P1, ((void *)0))=-1, t2577={5:0}, t2578={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L831] 0 pthread_t t2579; [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2579, ((void *)0), P2, ((void *)0))=0, t2577={5:0}, t2578={6:0}, t2579={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 [L802] 3 z = 1 [L743] 3 z = 2 [L748] 3 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L760] 2 x = 1 [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 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) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L805] 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) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 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 [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 3 return 0; [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 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) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 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 [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 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 [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] - 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: 830]: 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: 832]: 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: 828]: 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 7 procedures, 131 locations, 6 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: 8.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 571 IncrementalHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 8 mSDtfsCounter, 571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=6, InterpolantAutomatonStates: 42, 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.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 06:45:46,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...