/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:20:08,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:20:08,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:20:08,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:20:08,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:20:08,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:20:08,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:20:08,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:20:08,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:20:08,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:20:08,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:20:08,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:20:08,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:20:08,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:20:08,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:20:08,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:20:08,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:20:08,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:20:08,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:20:08,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:20:08,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:20:08,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:20:08,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:20:08,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:20:08,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:20:08,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:20:08,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:20:08,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:20:08,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:20:08,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:20:08,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:20:08,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:20:08,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:20:08,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:20:08,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:20:08,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:20:08,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:20:08,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:20:08,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:20:08,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:20:08,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:20:08,661 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-RepeatedSemanticLbe.epf [2022-12-05 23:20:08,691 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:20:08,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:20:08,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:20:08,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:20:08,693 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:20:08,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:20:08,694 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:20:08,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:20:08,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:20:08,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:20:08,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:20:08,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:20:08,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:20:08,695 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:20:08,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:20:08,696 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:20:08,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:20:08,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:20:08,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:20:08,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:20:08,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:20:08,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:20:08,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:20:08,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:20:08,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:20:08,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:20:08,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:20:08,697 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:20:08,697 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-05 23:20:08,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:20:09,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:20:09,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:20:09,014 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:20:09,015 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:20:09,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:20:10,192 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:20:10,409 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:20:10,409 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:20:10,429 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/775671781/c52434c3ac5f46cd888953f6ac34952d/FLAG06fdedebb [2022-12-05 23:20:10,447 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/775671781/c52434c3ac5f46cd888953f6ac34952d [2022-12-05 23:20:10,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:20:10,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:20:10,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:20:10,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:20:10,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:20:10,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:20:10" (1/1) ... [2022-12-05 23:20:10,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c399c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10, skipping insertion in model container [2022-12-05 23:20:10,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:20:10" (1/1) ... [2022-12-05 23:20:10,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:20:10,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:20:10,638 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-05 23:20:10,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:20:10,807 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:20:10,829 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-05 23:20:10,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:10,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:10,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:20:10,948 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:20:10,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10 WrapperNode [2022-12-05 23:20:10,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:20:10,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:20:10,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:20:10,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:20:10,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10" (1/1) ... [2022-12-05 23:20:10,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10" (1/1) ... [2022-12-05 23:20:11,022 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-05 23:20:11,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:20:11,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:20:11,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:20:11,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:20:11,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10" (1/1) ... [2022-12-05 23:20:11,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10" (1/1) ... [2022-12-05 23:20:11,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10" (1/1) ... [2022-12-05 23:20:11,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10" (1/1) ... [2022-12-05 23:20:11,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10" (1/1) ... [2022-12-05 23:20:11,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10" (1/1) ... [2022-12-05 23:20:11,081 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10" (1/1) ... [2022-12-05 23:20:11,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10" (1/1) ... [2022-12-05 23:20:11,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:20:11,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:20:11,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:20:11,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:20:11,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10" (1/1) ... [2022-12-05 23:20:11,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:20:11,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:20:11,128 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-05 23:20:11,155 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-05 23:20:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:20:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:20:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:20:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:20:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:20:11,173 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:20:11,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:20:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:20:11,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:20:11,174 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:20:11,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:20:11,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:20:11,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:20:11,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:20:11,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:20:11,177 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:20:11,321 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:20:11,324 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:20:11,620 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:20:11,766 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:20:11,766 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:20:11,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:20:11 BoogieIcfgContainer [2022-12-05 23:20:11,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:20:11,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:20:11,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:20:11,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:20:11,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:20:10" (1/3) ... [2022-12-05 23:20:11,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7cab5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:20:11, skipping insertion in model container [2022-12-05 23:20:11,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:10" (2/3) ... [2022-12-05 23:20:11,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7cab5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:20:11, skipping insertion in model container [2022-12-05 23:20:11,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:20:11" (3/3) ... [2022-12-05 23:20:11,779 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 23:20:11,792 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:20:11,792 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:20:11,792 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:20:11,843 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:20:11,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 23:20:11,944 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 23:20:11,944 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:11,950 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 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 23:20:11,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 23:20:11,954 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-05 23:20:11,956 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:11,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 23:20:11,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-05 23:20:12,032 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 23:20:12,033 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:12,035 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 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 23:20:12,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 23:20:12,038 INFO L188 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-05 23:20:16,327 INFO L203 LiptonReduction]: Total number of compositions: 80 [2022-12-05 23:20:16,345 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:20:16,351 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;@45ee104c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:20:16,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 23:20:16,353 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 23:20:16,353 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:16,354 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:16,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 23:20:16,355 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:16,358 INFO L85 PathProgramCache]: Analyzing trace with hash 461827, now seen corresponding path program 1 times [2022-12-05 23:20:16,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:16,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086195696] [2022-12-05 23:20:16,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:16,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:16,650 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-05 23:20:16,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:16,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086195696] [2022-12-05 23:20:16,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086195696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:16,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:16,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:20:16,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054687362] [2022-12-05 23:20:16,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:16,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:16,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:16,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:16,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:16,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-05 23:20:16,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05 23:20:16,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:16,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-05 23:20:16,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:17,001 INFO L130 PetriNetUnfolder]: 1026/1672 cut-off events. [2022-12-05 23:20:17,001 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 23:20:17,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 1672 events. 1026/1672 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9284 event pairs, 162 based on Foata normal form. 0/1516 useless extension candidates. Maximal degree in co-relation 3243. Up to 1246 conditions per place. [2022-12-05 23:20:17,017 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 31 selfloop transitions, 2 changer transitions 8/44 dead transitions. [2022-12-05 23:20:17,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 185 flow [2022-12-05 23:20:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-05 23:20:17,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2022-12-05 23:20:17,030 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 55 transitions. [2022-12-05 23:20:17,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 185 flow [2022-12-05 23:20:17,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:20:17,034 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 54 flow [2022-12-05 23:20:17,035 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-05 23:20:17,039 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-05 23:20:17,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:17,040 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 54 flow [2022-12-05 23:20:17,043 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:17,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:17,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 54 flow [2022-12-05 23:20:17,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2022-12-05 23:20:17,056 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-05 23:20:17,056 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:17,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:20:17,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 54 flow [2022-12-05 23:20:17,056 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-05 23:20:17,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:20:17,403 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 363 [2022-12-05 23:20:17,403 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-05 23:20:17,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-05 23:20:17,404 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:17,404 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:17,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:20:17,404 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:17,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash -56031803, now seen corresponding path program 1 times [2022-12-05 23:20:17,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:17,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193775271] [2022-12-05 23:20:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:17,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:17,998 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-05 23:20:17,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:17,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193775271] [2022-12-05 23:20:17,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193775271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:17,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:18,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:20:18,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059578102] [2022-12-05 23:20:18,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:18,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:18,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:18,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:18,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:18,002 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:20:18,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:18,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:18,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:20:18,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:18,356 INFO L130 PetriNetUnfolder]: 1487/2212 cut-off events. [2022-12-05 23:20:18,357 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-12-05 23:20:18,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4627 conditions, 2212 events. 1487/2212 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9601 event pairs, 234 based on Foata normal form. 53/2265 useless extension candidates. Maximal degree in co-relation 4617. Up to 1676 conditions per place. [2022-12-05 23:20:18,371 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 36 selfloop transitions, 12 changer transitions 0/48 dead transitions. [2022-12-05 23:20:18,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 210 flow [2022-12-05 23:20:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-05 23:20:18,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-05 23:20:18,373 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 4 states and 50 transitions. [2022-12-05 23:20:18,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 48 transitions, 210 flow [2022-12-05 23:20:18,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 48 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:18,375 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 140 flow [2022-12-05 23:20:18,375 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2022-12-05 23:20:18,375 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2022-12-05 23:20:18,376 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:18,377 INFO L89 Accepts]: Start accepts. Operand has 34 places, 32 transitions, 140 flow [2022-12-05 23:20:18,378 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:18,378 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:18,378 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 32 transitions, 140 flow [2022-12-05 23:20:18,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 140 flow [2022-12-05 23:20:18,466 INFO L130 PetriNetUnfolder]: 294/522 cut-off events. [2022-12-05 23:20:18,467 INFO L131 PetriNetUnfolder]: For 80/94 co-relation queries the response was YES. [2022-12-05 23:20:18,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 522 events. 294/522 cut-off events. For 80/94 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2574 event pairs, 121 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 1237. Up to 385 conditions per place. [2022-12-05 23:20:18,471 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 32 transitions, 140 flow [2022-12-05 23:20:18,471 INFO L188 LiptonReduction]: Number of co-enabled transitions 250 [2022-12-05 23:20:18,490 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:18,492 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-05 23:20:18,492 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 140 flow [2022-12-05 23:20:18,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:18,493 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:18,493 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:18,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:20:18,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:18,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:18,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1736987375, now seen corresponding path program 1 times [2022-12-05 23:20:18,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:18,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625896930] [2022-12-05 23:20:18,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:19,014 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-05 23:20:19,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:19,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625896930] [2022-12-05 23:20:19,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625896930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:19,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:19,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:20:19,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951472283] [2022-12-05 23:20:19,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:19,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:19,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:19,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:19,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:20:19,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 140 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:19,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:19,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:20:19,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:19,359 INFO L130 PetriNetUnfolder]: 1472/2191 cut-off events. [2022-12-05 23:20:19,359 INFO L131 PetriNetUnfolder]: For 923/923 co-relation queries the response was YES. [2022-12-05 23:20:19,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6564 conditions, 2191 events. 1472/2191 cut-off events. For 923/923 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9563 event pairs, 323 based on Foata normal form. 8/2199 useless extension candidates. Maximal degree in co-relation 6551. Up to 1688 conditions per place. [2022-12-05 23:20:19,375 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 42 selfloop transitions, 19 changer transitions 0/61 dead transitions. [2022-12-05 23:20:19,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 61 transitions, 362 flow [2022-12-05 23:20:19,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-05 23:20:19,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2022-12-05 23:20:19,378 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 140 flow. Second operand 4 states and 53 transitions. [2022-12-05 23:20:19,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 61 transitions, 362 flow [2022-12-05 23:20:19,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 61 transitions, 362 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:20:19,382 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 272 flow [2022-12-05 23:20:19,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=272, PETRI_PLACES=40, PETRI_TRANSITIONS=41} [2022-12-05 23:20:19,384 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2022-12-05 23:20:19,384 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:19,384 INFO L89 Accepts]: Start accepts. Operand has 40 places, 41 transitions, 272 flow [2022-12-05 23:20:19,385 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:19,385 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:19,385 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 41 transitions, 272 flow [2022-12-05 23:20:19,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 41 transitions, 272 flow [2022-12-05 23:20:19,460 INFO L130 PetriNetUnfolder]: 303/560 cut-off events. [2022-12-05 23:20:19,460 INFO L131 PetriNetUnfolder]: For 547/667 co-relation queries the response was YES. [2022-12-05 23:20:19,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1864 conditions, 560 events. 303/560 cut-off events. For 547/667 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2838 event pairs, 82 based on Foata normal form. 1/535 useless extension candidates. Maximal degree in co-relation 1849. Up to 373 conditions per place. [2022-12-05 23:20:19,465 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 41 transitions, 272 flow [2022-12-05 23:20:19,465 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-05 23:20:19,482 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:19,484 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-05 23:20:19,484 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 272 flow [2022-12-05 23:20:19,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:19,484 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:19,484 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:19,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:20:19,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:19,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1989049834, now seen corresponding path program 1 times [2022-12-05 23:20:19,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:19,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391001058] [2022-12-05 23:20:19,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:19,948 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-05 23:20:19,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:19,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391001058] [2022-12-05 23:20:19,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391001058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:19,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:19,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:19,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423138773] [2022-12-05 23:20:19,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:19,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:19,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:19,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:19,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:19,951 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 23:20:19,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 272 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:19,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:19,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 23:20:19,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:20,392 INFO L130 PetriNetUnfolder]: 1902/2879 cut-off events. [2022-12-05 23:20:20,393 INFO L131 PetriNetUnfolder]: For 3919/3919 co-relation queries the response was YES. [2022-12-05 23:20:20,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10387 conditions, 2879 events. 1902/2879 cut-off events. For 3919/3919 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13981 event pairs, 349 based on Foata normal form. 75/2954 useless extension candidates. Maximal degree in co-relation 10369. Up to 1403 conditions per place. [2022-12-05 23:20:20,408 INFO L137 encePairwiseOnDemand]: 10/21 looper letters, 46 selfloop transitions, 24 changer transitions 0/70 dead transitions. [2022-12-05 23:20:20,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 70 transitions, 548 flow [2022-12-05 23:20:20,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-05 23:20:20,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-05 23:20:20,409 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 272 flow. Second operand 4 states and 52 transitions. [2022-12-05 23:20:20,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 70 transitions, 548 flow [2022-12-05 23:20:20,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 70 transitions, 546 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-05 23:20:20,417 INFO L231 Difference]: Finished difference. Result has 46 places, 50 transitions, 462 flow [2022-12-05 23:20:20,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=462, PETRI_PLACES=46, PETRI_TRANSITIONS=50} [2022-12-05 23:20:20,418 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-05 23:20:20,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:20,418 INFO L89 Accepts]: Start accepts. Operand has 46 places, 50 transitions, 462 flow [2022-12-05 23:20:20,419 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:20,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:20,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 50 transitions, 462 flow [2022-12-05 23:20:20,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 50 transitions, 462 flow [2022-12-05 23:20:20,501 INFO L130 PetriNetUnfolder]: 350/693 cut-off events. [2022-12-05 23:20:20,501 INFO L131 PetriNetUnfolder]: For 1332/1558 co-relation queries the response was YES. [2022-12-05 23:20:20,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2761 conditions, 693 events. 350/693 cut-off events. For 1332/1558 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3951 event pairs, 82 based on Foata normal form. 6/683 useless extension candidates. Maximal degree in co-relation 2741. Up to 458 conditions per place. [2022-12-05 23:20:20,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 50 transitions, 462 flow [2022-12-05 23:20:20,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-05 23:20:20,528 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:20,529 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-05 23:20:20,529 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 50 transitions, 462 flow [2022-12-05 23:20:20,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:20,530 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:20,530 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:20,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:20:20,530 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:20,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1989096923, now seen corresponding path program 1 times [2022-12-05 23:20:20,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:20,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851206095] [2022-12-05 23:20:20,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:20,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:20,795 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-05 23:20:20,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:20,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851206095] [2022-12-05 23:20:20,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851206095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:20,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:20,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:20:20,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854166223] [2022-12-05 23:20:20,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:20,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:20,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:20,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:20,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:20,798 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:20:20,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-05 23:20:20,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:20,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:20:20,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:21,131 INFO L130 PetriNetUnfolder]: 1637/2517 cut-off events. [2022-12-05 23:20:21,132 INFO L131 PetriNetUnfolder]: For 6615/6822 co-relation queries the response was YES. [2022-12-05 23:20:21,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10491 conditions, 2517 events. 1637/2517 cut-off events. For 6615/6822 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12516 event pairs, 595 based on Foata normal form. 122/2592 useless extension candidates. Maximal degree in co-relation 10468. Up to 2246 conditions per place. [2022-12-05 23:20:21,181 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 52 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2022-12-05 23:20:21,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 688 flow [2022-12-05 23:20:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 23:20:21,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2022-12-05 23:20:21,183 INFO L175 Difference]: Start difference. First operand has 46 places, 50 transitions, 462 flow. Second operand 3 states and 38 transitions. [2022-12-05 23:20:21,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 688 flow [2022-12-05 23:20:21,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 658 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 23:20:21,191 INFO L231 Difference]: Finished difference. Result has 48 places, 53 transitions, 477 flow [2022-12-05 23:20:21,192 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=48, PETRI_TRANSITIONS=53} [2022-12-05 23:20:21,192 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-05 23:20:21,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:21,193 INFO L89 Accepts]: Start accepts. Operand has 48 places, 53 transitions, 477 flow [2022-12-05 23:20:21,193 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:21,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:21,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 53 transitions, 477 flow [2022-12-05 23:20:21,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 53 transitions, 477 flow [2022-12-05 23:20:21,296 INFO L130 PetriNetUnfolder]: 430/827 cut-off events. [2022-12-05 23:20:21,296 INFO L131 PetriNetUnfolder]: For 1634/1829 co-relation queries the response was YES. [2022-12-05 23:20:21,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3373 conditions, 827 events. 430/827 cut-off events. For 1634/1829 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4649 event pairs, 98 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 3351. Up to 553 conditions per place. [2022-12-05 23:20:21,305 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 53 transitions, 477 flow [2022-12-05 23:20:21,305 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-05 23:20:21,311 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:21,311 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-05 23:20:21,312 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 53 transitions, 477 flow [2022-12-05 23:20:21,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-05 23:20:21,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:21,312 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:21,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:20:21,312 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:21,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1505857624, now seen corresponding path program 1 times [2022-12-05 23:20:21,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:21,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631005125] [2022-12-05 23:20:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:21,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:21,465 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-05 23:20:21,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:21,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631005125] [2022-12-05 23:20:21,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631005125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:21,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:21,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:20:21,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218536940] [2022-12-05 23:20:21,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:21,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:21,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:21,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:21,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:21,468 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:20:21,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 53 transitions, 477 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-05 23:20:21,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:21,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:20:21,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:21,906 INFO L130 PetriNetUnfolder]: 2071/3335 cut-off events. [2022-12-05 23:20:21,906 INFO L131 PetriNetUnfolder]: For 8276/8340 co-relation queries the response was YES. [2022-12-05 23:20:21,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13527 conditions, 3335 events. 2071/3335 cut-off events. For 8276/8340 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 19230 event pairs, 647 based on Foata normal form. 103/3407 useless extension candidates. Maximal degree in co-relation 13502. Up to 1722 conditions per place. [2022-12-05 23:20:21,931 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 54 selfloop transitions, 8 changer transitions 5/72 dead transitions. [2022-12-05 23:20:21,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 726 flow [2022-12-05 23:20:21,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-05 23:20:21,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2022-12-05 23:20:21,933 INFO L175 Difference]: Start difference. First operand has 48 places, 53 transitions, 477 flow. Second operand 3 states and 40 transitions. [2022-12-05 23:20:21,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 726 flow [2022-12-05 23:20:21,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 721 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:20:21,942 INFO L231 Difference]: Finished difference. Result has 50 places, 51 transitions, 477 flow [2022-12-05 23:20:21,942 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=50, PETRI_TRANSITIONS=51} [2022-12-05 23:20:21,944 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2022-12-05 23:20:21,944 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:21,944 INFO L89 Accepts]: Start accepts. Operand has 50 places, 51 transitions, 477 flow [2022-12-05 23:20:21,945 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:21,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:21,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 51 transitions, 477 flow [2022-12-05 23:20:21,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 51 transitions, 477 flow [2022-12-05 23:20:22,068 INFO L130 PetriNetUnfolder]: 481/1023 cut-off events. [2022-12-05 23:20:22,068 INFO L131 PetriNetUnfolder]: For 2308/2420 co-relation queries the response was YES. [2022-12-05 23:20:22,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 1023 events. 481/1023 cut-off events. For 2308/2420 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6745 event pairs, 124 based on Foata normal form. 1/1006 useless extension candidates. Maximal degree in co-relation 3982. Up to 673 conditions per place. [2022-12-05 23:20:22,077 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 51 transitions, 477 flow [2022-12-05 23:20:22,078 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-05 23:20:22,084 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:22,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-05 23:20:22,085 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 51 transitions, 477 flow [2022-12-05 23:20:22,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-05 23:20:22,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:22,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:22,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:20:22,086 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:22,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:22,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1541026842, now seen corresponding path program 1 times [2022-12-05 23:20:22,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:22,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529414873] [2022-12-05 23:20:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:22,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:22,830 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-05 23:20:22,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:22,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529414873] [2022-12-05 23:20:22,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529414873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:22,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:22,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:22,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337822492] [2022-12-05 23:20:22,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:22,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:20:22,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:22,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:20:22,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:20:22,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:20:22,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 51 transitions, 477 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-05 23:20:22,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:22,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:20:22,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:23,362 INFO L130 PetriNetUnfolder]: 2253/3508 cut-off events. [2022-12-05 23:20:23,363 INFO L131 PetriNetUnfolder]: For 9494/9722 co-relation queries the response was YES. [2022-12-05 23:20:23,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14505 conditions, 3508 events. 2253/3508 cut-off events. For 9494/9722 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 19141 event pairs, 601 based on Foata normal form. 192/3675 useless extension candidates. Maximal degree in co-relation 14479. Up to 3056 conditions per place. [2022-12-05 23:20:23,382 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 70 selfloop transitions, 22 changer transitions 5/105 dead transitions. [2022-12-05 23:20:23,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 105 transitions, 1117 flow [2022-12-05 23:20:23,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:20:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:20:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-05 23:20:23,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-05 23:20:23,384 INFO L175 Difference]: Start difference. First operand has 50 places, 51 transitions, 477 flow. Second operand 5 states and 60 transitions. [2022-12-05 23:20:23,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 105 transitions, 1117 flow [2022-12-05 23:20:23,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 105 transitions, 1105 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:20:23,395 INFO L231 Difference]: Finished difference. Result has 56 places, 69 transitions, 722 flow [2022-12-05 23:20:23,395 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=722, PETRI_PLACES=56, PETRI_TRANSITIONS=69} [2022-12-05 23:20:23,396 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2022-12-05 23:20:23,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:23,396 INFO L89 Accepts]: Start accepts. Operand has 56 places, 69 transitions, 722 flow [2022-12-05 23:20:23,398 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:23,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:23,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 69 transitions, 722 flow [2022-12-05 23:20:23,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 69 transitions, 722 flow [2022-12-05 23:20:23,516 INFO L130 PetriNetUnfolder]: 514/1044 cut-off events. [2022-12-05 23:20:23,516 INFO L131 PetriNetUnfolder]: For 3090/3236 co-relation queries the response was YES. [2022-12-05 23:20:23,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4922 conditions, 1044 events. 514/1044 cut-off events. For 3090/3236 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6592 event pairs, 97 based on Foata normal form. 33/1060 useless extension candidates. Maximal degree in co-relation 4895. Up to 696 conditions per place. [2022-12-05 23:20:23,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 69 transitions, 722 flow [2022-12-05 23:20:23,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-05 23:20:23,537 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:23,537 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-05 23:20:23,537 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 69 transitions, 722 flow [2022-12-05 23:20:23,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-05 23:20:23,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:23,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:23,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:20:23,538 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:23,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:23,538 INFO L85 PathProgramCache]: Analyzing trace with hash 840998136, now seen corresponding path program 1 times [2022-12-05 23:20:23,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:23,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75280380] [2022-12-05 23:20:23,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:23,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:23,857 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-05 23:20:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:23,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75280380] [2022-12-05 23:20:23,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75280380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:23,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:23,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:23,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509318153] [2022-12-05 23:20:23,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:23,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:20:23,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:23,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:20:23,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:20:23,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:20:23,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 69 transitions, 722 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-05 23:20:23,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:23,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:20:23,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:24,354 INFO L130 PetriNetUnfolder]: 2224/3476 cut-off events. [2022-12-05 23:20:24,354 INFO L131 PetriNetUnfolder]: For 13156/13462 co-relation queries the response was YES. [2022-12-05 23:20:24,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16183 conditions, 3476 events. 2224/3476 cut-off events. For 13156/13462 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 18960 event pairs, 824 based on Foata normal form. 197/3639 useless extension candidates. Maximal degree in co-relation 16153. Up to 2987 conditions per place. [2022-12-05 23:20:24,373 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 70 selfloop transitions, 18 changer transitions 4/100 dead transitions. [2022-12-05 23:20:24,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 100 transitions, 1137 flow [2022-12-05 23:20:24,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-05 23:20:24,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 23:20:24,376 INFO L175 Difference]: Start difference. First operand has 56 places, 69 transitions, 722 flow. Second operand 4 states and 49 transitions. [2022-12-05 23:20:24,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 100 transitions, 1137 flow [2022-12-05 23:20:24,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 100 transitions, 1127 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-05 23:20:24,388 INFO L231 Difference]: Finished difference. Result has 61 places, 76 transitions, 854 flow [2022-12-05 23:20:24,388 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=854, PETRI_PLACES=61, PETRI_TRANSITIONS=76} [2022-12-05 23:20:24,391 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2022-12-05 23:20:24,391 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:24,391 INFO L89 Accepts]: Start accepts. Operand has 61 places, 76 transitions, 854 flow [2022-12-05 23:20:24,393 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:24,393 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:24,393 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 76 transitions, 854 flow [2022-12-05 23:20:24,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 76 transitions, 854 flow [2022-12-05 23:20:24,521 INFO L130 PetriNetUnfolder]: 521/1057 cut-off events. [2022-12-05 23:20:24,521 INFO L131 PetriNetUnfolder]: For 3847/3993 co-relation queries the response was YES. [2022-12-05 23:20:24,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5369 conditions, 1057 events. 521/1057 cut-off events. For 3847/3993 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6706 event pairs, 91 based on Foata normal form. 33/1069 useless extension candidates. Maximal degree in co-relation 5338. Up to 704 conditions per place. [2022-12-05 23:20:24,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 76 transitions, 854 flow [2022-12-05 23:20:24,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 420 [2022-12-05 23:20:24,541 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:24,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-05 23:20:24,544 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 76 transitions, 854 flow [2022-12-05 23:20:24,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-05 23:20:24,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:24,544 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:24,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:20:24,545 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:24,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:24,545 INFO L85 PathProgramCache]: Analyzing trace with hash 839683922, now seen corresponding path program 1 times [2022-12-05 23:20:24,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:24,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484742527] [2022-12-05 23:20:24,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:24,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:24,961 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-05 23:20:24,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:24,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484742527] [2022-12-05 23:20:24,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484742527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:24,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:24,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:20:24,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560899123] [2022-12-05 23:20:24,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:24,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:20:24,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:24,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:20:24,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:20:24,964 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:20:24,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 76 transitions, 854 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:24,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:24,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:20:24,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:25,627 INFO L130 PetriNetUnfolder]: 2538/3990 cut-off events. [2022-12-05 23:20:25,627 INFO L131 PetriNetUnfolder]: For 18463/18805 co-relation queries the response was YES. [2022-12-05 23:20:25,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20297 conditions, 3990 events. 2538/3990 cut-off events. For 18463/18805 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 22638 event pairs, 660 based on Foata normal form. 255/4217 useless extension candidates. Maximal degree in co-relation 20263. Up to 2839 conditions per place. [2022-12-05 23:20:25,652 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 77 selfloop transitions, 40 changer transitions 15/140 dead transitions. [2022-12-05 23:20:25,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 140 transitions, 1680 flow [2022-12-05 23:20:25,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:20:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:20:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-12-05 23:20:25,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2022-12-05 23:20:25,655 INFO L175 Difference]: Start difference. First operand has 61 places, 76 transitions, 854 flow. Second operand 6 states and 74 transitions. [2022-12-05 23:20:25,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 140 transitions, 1680 flow [2022-12-05 23:20:25,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 140 transitions, 1667 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 23:20:25,688 INFO L231 Difference]: Finished difference. Result has 67 places, 88 transitions, 1112 flow [2022-12-05 23:20:25,688 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1112, PETRI_PLACES=67, PETRI_TRANSITIONS=88} [2022-12-05 23:20:25,689 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 29 predicate places. [2022-12-05 23:20:25,689 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:25,689 INFO L89 Accepts]: Start accepts. Operand has 67 places, 88 transitions, 1112 flow [2022-12-05 23:20:25,690 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:25,690 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:25,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 88 transitions, 1112 flow [2022-12-05 23:20:25,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 88 transitions, 1112 flow [2022-12-05 23:20:25,809 INFO L130 PetriNetUnfolder]: 513/1075 cut-off events. [2022-12-05 23:20:25,809 INFO L131 PetriNetUnfolder]: For 6057/6211 co-relation queries the response was YES. [2022-12-05 23:20:25,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6429 conditions, 1075 events. 513/1075 cut-off events. For 6057/6211 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 7181 event pairs, 105 based on Foata normal form. 20/1074 useless extension candidates. Maximal degree in co-relation 6395. Up to 706 conditions per place. [2022-12-05 23:20:25,817 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 88 transitions, 1112 flow [2022-12-05 23:20:25,817 INFO L188 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-05 23:20:27,047 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:20:27,048 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1359 [2022-12-05 23:20:27,048 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 88 transitions, 1112 flow [2022-12-05 23:20:27,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:27,048 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:27,048 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:27,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:20:27,048 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:27,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:27,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1385890145, now seen corresponding path program 1 times [2022-12-05 23:20:27,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:27,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684777395] [2022-12-05 23:20:27,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:27,168 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-05 23:20:27,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:27,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684777395] [2022-12-05 23:20:27,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684777395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:27,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:27,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:20:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354720618] [2022-12-05 23:20:27,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:27,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:27,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:27,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:27,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:27,171 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-05 23:20:27,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 88 transitions, 1112 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-05 23:20:27,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:27,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-05 23:20:27,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:27,445 INFO L130 PetriNetUnfolder]: 1117/1994 cut-off events. [2022-12-05 23:20:27,445 INFO L131 PetriNetUnfolder]: For 14916/15180 co-relation queries the response was YES. [2022-12-05 23:20:27,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11174 conditions, 1994 events. 1117/1994 cut-off events. For 14916/15180 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 12002 event pairs, 244 based on Foata normal form. 242/2212 useless extension candidates. Maximal degree in co-relation 11137. Up to 1492 conditions per place. [2022-12-05 23:20:27,453 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 87 selfloop transitions, 4 changer transitions 14/117 dead transitions. [2022-12-05 23:20:27,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 117 transitions, 1655 flow [2022-12-05 23:20:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:27,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-05 23:20:27,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2022-12-05 23:20:27,455 INFO L175 Difference]: Start difference. First operand has 68 places, 88 transitions, 1112 flow. Second operand 3 states and 41 transitions. [2022-12-05 23:20:27,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 117 transitions, 1655 flow [2022-12-05 23:20:27,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 117 transitions, 1603 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:27,477 INFO L231 Difference]: Finished difference. Result has 69 places, 80 transitions, 948 flow [2022-12-05 23:20:27,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=69, PETRI_TRANSITIONS=80} [2022-12-05 23:20:27,478 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 31 predicate places. [2022-12-05 23:20:27,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:27,478 INFO L89 Accepts]: Start accepts. Operand has 69 places, 80 transitions, 948 flow [2022-12-05 23:20:27,480 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:27,481 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:27,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 80 transitions, 948 flow [2022-12-05 23:20:27,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 80 transitions, 948 flow [2022-12-05 23:20:27,616 INFO L130 PetriNetUnfolder]: 519/1155 cut-off events. [2022-12-05 23:20:27,616 INFO L131 PetriNetUnfolder]: For 6274/6456 co-relation queries the response was YES. [2022-12-05 23:20:27,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6006 conditions, 1155 events. 519/1155 cut-off events. For 6274/6456 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 8340 event pairs, 160 based on Foata normal form. 11/1094 useless extension candidates. Maximal degree in co-relation 5970. Up to 621 conditions per place. [2022-12-05 23:20:27,630 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 80 transitions, 948 flow [2022-12-05 23:20:27,630 INFO L188 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-05 23:20:27,960 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:20:27,961 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 483 [2022-12-05 23:20:27,961 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 79 transitions, 936 flow [2022-12-05 23:20:27,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-05 23:20:27,961 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:27,961 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:27,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:20:27,962 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:27,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:27,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1864910797, now seen corresponding path program 1 times [2022-12-05 23:20:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:27,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577504346] [2022-12-05 23:20:27,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:27,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:28,104 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-05 23:20:28,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:28,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577504346] [2022-12-05 23:20:28,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577504346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:28,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:28,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:28,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182973472] [2022-12-05 23:20:28,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:28,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:28,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:28,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:28,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-05 23:20:28,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 79 transitions, 936 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-05 23:20:28,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:28,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-05 23:20:28,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:28,323 INFO L130 PetriNetUnfolder]: 523/1028 cut-off events. [2022-12-05 23:20:28,324 INFO L131 PetriNetUnfolder]: For 6691/6794 co-relation queries the response was YES. [2022-12-05 23:20:28,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6022 conditions, 1028 events. 523/1028 cut-off events. For 6691/6794 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5797 event pairs, 56 based on Foata normal form. 165/1180 useless extension candidates. Maximal degree in co-relation 5983. Up to 517 conditions per place. [2022-12-05 23:20:28,331 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 88 selfloop transitions, 7 changer transitions 17/123 dead transitions. [2022-12-05 23:20:28,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 123 transitions, 1633 flow [2022-12-05 23:20:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-05 23:20:28,332 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2022-12-05 23:20:28,333 INFO L175 Difference]: Start difference. First operand has 68 places, 79 transitions, 936 flow. Second operand 4 states and 55 transitions. [2022-12-05 23:20:28,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 123 transitions, 1633 flow [2022-12-05 23:20:28,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 123 transitions, 1613 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 23:20:28,345 INFO L231 Difference]: Finished difference. Result has 69 places, 75 transitions, 846 flow [2022-12-05 23:20:28,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=846, PETRI_PLACES=69, PETRI_TRANSITIONS=75} [2022-12-05 23:20:28,346 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 31 predicate places. [2022-12-05 23:20:28,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:28,347 INFO L89 Accepts]: Start accepts. Operand has 69 places, 75 transitions, 846 flow [2022-12-05 23:20:28,350 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:28,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:28,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 75 transitions, 846 flow [2022-12-05 23:20:28,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 75 transitions, 846 flow [2022-12-05 23:20:28,419 INFO L130 PetriNetUnfolder]: 191/545 cut-off events. [2022-12-05 23:20:28,419 INFO L131 PetriNetUnfolder]: For 2345/2430 co-relation queries the response was YES. [2022-12-05 23:20:28,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2882 conditions, 545 events. 191/545 cut-off events. For 2345/2430 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3507 event pairs, 25 based on Foata normal form. 25/553 useless extension candidates. Maximal degree in co-relation 2846. Up to 260 conditions per place. [2022-12-05 23:20:28,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 75 transitions, 846 flow [2022-12-05 23:20:28,425 INFO L188 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-05 23:20:28,426 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:28,426 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-05 23:20:28,426 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 846 flow [2022-12-05 23:20:28,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-05 23:20:28,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:28,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:28,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:20:28,427 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:28,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:28,427 INFO L85 PathProgramCache]: Analyzing trace with hash -358686953, now seen corresponding path program 1 times [2022-12-05 23:20:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:28,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656041981] [2022-12-05 23:20:28,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:28,606 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-05 23:20:28,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:28,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656041981] [2022-12-05 23:20:28,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656041981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:28,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:28,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:20:28,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139043436] [2022-12-05 23:20:28,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:28,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:20:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:28,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:20:28,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:20:28,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-05 23:20:28,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 846 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:28,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:28,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-05 23:20:28,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:28,770 INFO L130 PetriNetUnfolder]: 411/819 cut-off events. [2022-12-05 23:20:28,770 INFO L131 PetriNetUnfolder]: For 5059/5143 co-relation queries the response was YES. [2022-12-05 23:20:28,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4812 conditions, 819 events. 411/819 cut-off events. For 5059/5143 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4607 event pairs, 45 based on Foata normal form. 79/887 useless extension candidates. Maximal degree in co-relation 4773. Up to 394 conditions per place. [2022-12-05 23:20:28,775 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 42 selfloop transitions, 10 changer transitions 54/110 dead transitions. [2022-12-05 23:20:28,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 110 transitions, 1401 flow [2022-12-05 23:20:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:20:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:20:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-05 23:20:28,776 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2022-12-05 23:20:28,777 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 846 flow. Second operand 5 states and 58 transitions. [2022-12-05 23:20:28,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 110 transitions, 1401 flow [2022-12-05 23:20:28,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 110 transitions, 1340 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-05 23:20:28,786 INFO L231 Difference]: Finished difference. Result has 71 places, 39 transitions, 372 flow [2022-12-05 23:20:28,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=372, PETRI_PLACES=71, PETRI_TRANSITIONS=39} [2022-12-05 23:20:28,787 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2022-12-05 23:20:28,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:28,788 INFO L89 Accepts]: Start accepts. Operand has 71 places, 39 transitions, 372 flow [2022-12-05 23:20:28,788 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:28,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:28,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 39 transitions, 372 flow [2022-12-05 23:20:28,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 39 transitions, 372 flow [2022-12-05 23:20:28,798 INFO L130 PetriNetUnfolder]: 21/67 cut-off events. [2022-12-05 23:20:28,798 INFO L131 PetriNetUnfolder]: For 196/202 co-relation queries the response was YES. [2022-12-05 23:20:28,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 67 events. 21/67 cut-off events. For 196/202 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 157 event pairs, 1 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 297. Up to 26 conditions per place. [2022-12-05 23:20:28,799 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 39 transitions, 372 flow [2022-12-05 23:20:28,799 INFO L188 LiptonReduction]: Number of co-enabled transitions 136 [2022-12-05 23:20:29,124 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [336] L789-->L792: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0] and [323] L752-->L759: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_98 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and (not (= (mod v_~z$w_buff1_used~0_93 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_92 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= (ite .cse2 0 v_~z$w_buff0_used~0_98) v_~z$w_buff0_used~0_97) (= v_~z$r_buff0_thd1~0_28 (ite .cse3 0 v_~z$r_buff0_thd1~0_29)) (= (ite .cse2 v_~z$w_buff0~0_39 (ite .cse4 v_~z$w_buff1~0_34 v_~z~0_52)) v_~z~0_51) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_98, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_52, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_97, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_51, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0] [2022-12-05 23:20:29,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [336] L789-->L792: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0] and [330] L772-->L779: Formula: (let ((.cse3 (not (= 0 (mod v_~z$w_buff0_used~0_101 256)))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse4)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_102 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= v_~z~0_55 (ite .cse0 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_36 v_~z~0_56))) (= v_~z$w_buff1_used~0_96 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_97)) (= v_~z$w_buff0_used~0_101 (ite .cse0 0 v_~z$w_buff0_used~0_102)) (= v_~z$r_buff0_thd2~0_25 (ite .cse2 0 v_~z$r_buff0_thd2~0_26)) (= v_~z$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_96 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_20))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_102, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_56, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_101, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_36, ~z~0=v_~z~0_55, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0] [2022-12-05 23:20:30,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [445] L789-->L759: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_452 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_151 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_116 256) 0)))) (let ((.cse0 (and (not (= 0 (mod v_~z$w_buff1_used~0_417 256))) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_453 256) 0)))) (.cse1 (and .cse5 .cse4))) (and (= v_~z$w_buff1_used~0_416 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_417)) (= v_~z~0_377 (ite .cse2 v_~z$w_buff0~0_285 (ite .cse0 v_~z$w_buff1~0_251 1))) (= v_~z$w_buff0_used~0_452 (ite .cse2 0 v_~z$w_buff0_used~0_453)) (= v_~z$r_buff0_thd1~0_150 (ite .cse1 0 v_~z$r_buff0_thd1~0_151)) (= v_~z$r_buff1_thd1~0_115 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_416 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd1~0_150 256) 0)) .cse4)) 0 v_~z$r_buff1_thd1~0_116))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_453, ~z$w_buff0~0=v_~z$w_buff0~0_285, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_116, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_417, ~z$w_buff1~0=v_~z$w_buff1~0_251, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_151} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_452, ~z$w_buff0~0=v_~z$w_buff0~0_285, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_115, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_416, ~z$w_buff1~0=v_~z$w_buff1~0_251, ~z~0=v_~z~0_377, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_150} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0] and [337] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_116 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_111 256) 0)) .cse3))) (and (= v_~z$w_buff0_used~0_115 (ite .cse0 0 v_~z$w_buff0_used~0_116)) (= v_~z$r_buff0_thd3~0_23 (ite .cse1 0 v_~z$r_buff0_thd3~0_24)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_111) v_~z$w_buff1_used~0_110) (= v_~z~0_67 (ite .cse0 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_42 v_~z~0_68))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_110 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)))) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_68} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_67} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-05 23:20:30,154 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] L789-->L779: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_456 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd2~0_99 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_98 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_457 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_421 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~z$w_buff0_used~0_457) v_~z$w_buff0_used~0_456) (= (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_421) v_~z$w_buff1_used~0_420) (= v_~z~0_381 (ite .cse0 v_~z$w_buff0~0_287 (ite .cse1 v_~z$w_buff1~0_253 1))) (= (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_420 256) 0))) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_97 256) 0)))) 0 v_~z$r_buff1_thd2~0_99) v_~z$r_buff1_thd2~0_98) (= v_~z$r_buff0_thd2~0_97 (ite .cse2 0 v_~z$r_buff0_thd2~0_98))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_457, ~z$w_buff0~0=v_~z$w_buff0~0_287, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_99, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_421, ~z$w_buff1~0=v_~z$w_buff1~0_253, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_98} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_456, ~z$w_buff0~0=v_~z$w_buff0~0_287, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_98, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_420, ~z$w_buff1~0=v_~z$w_buff1~0_253, ~z~0=v_~z~0_381, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_97} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0] and [337] L792-->L799: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd3~0_22 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~z$w_buff0_used~0_116 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_111 256) 0)) .cse3))) (and (= v_~z$w_buff0_used~0_115 (ite .cse0 0 v_~z$w_buff0_used~0_116)) (= v_~z$r_buff0_thd3~0_23 (ite .cse1 0 v_~z$r_buff0_thd3~0_24)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_111) v_~z$w_buff1_used~0_110) (= v_~z~0_67 (ite .cse0 v_~z$w_buff0~0_47 (ite .cse2 v_~z$w_buff1~0_42 v_~z~0_68))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_110 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd3~0_23 256) 0)))) 0 v_~z$r_buff1_thd3~0_22) v_~z$r_buff1_thd3~0_21)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_111, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_24, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_68} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_110, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_23, ~z$w_buff1~0=v_~z$w_buff1~0_42, ~z~0=v_~z~0_67} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-05 23:20:30,292 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-05 23:20:30,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1505 [2022-12-05 23:20:30,293 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 35 transitions, 386 flow [2022-12-05 23:20:30,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:30,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:30,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:30,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:20:30,293 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:30,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:30,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1843089988, now seen corresponding path program 1 times [2022-12-05 23:20:30,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:30,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780425635] [2022-12-05 23:20:30,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:30,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:31,104 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-05 23:20:31,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:31,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780425635] [2022-12-05 23:20:31,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780425635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:31,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:31,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:20:31,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457509178] [2022-12-05 23:20:31,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:31,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:20:31,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:31,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:20:31,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:20:31,106 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-05 23:20:31,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 35 transitions, 386 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-05 23:20:31,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:31,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-05 23:20:31,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:31,291 INFO L130 PetriNetUnfolder]: 151/289 cut-off events. [2022-12-05 23:20:31,291 INFO L131 PetriNetUnfolder]: For 1574/1577 co-relation queries the response was YES. [2022-12-05 23:20:31,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 289 events. 151/289 cut-off events. For 1574/1577 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1080 event pairs, 25 based on Foata normal form. 4/288 useless extension candidates. Maximal degree in co-relation 1566. Up to 154 conditions per place. [2022-12-05 23:20:31,294 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 30 selfloop transitions, 9 changer transitions 26/66 dead transitions. [2022-12-05 23:20:31,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 731 flow [2022-12-05 23:20:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:20:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:20:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-12-05 23:20:31,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37681159420289856 [2022-12-05 23:20:31,295 INFO L175 Difference]: Start difference. First operand has 65 places, 35 transitions, 386 flow. Second operand 6 states and 52 transitions. [2022-12-05 23:20:31,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 731 flow [2022-12-05 23:20:31,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 547 flow, removed 41 selfloop flow, removed 19 redundant places. [2022-12-05 23:20:31,300 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 256 flow [2022-12-05 23:20:31,300 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2022-12-05 23:20:31,301 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-05 23:20:31,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:31,301 INFO L89 Accepts]: Start accepts. Operand has 53 places, 33 transitions, 256 flow [2022-12-05 23:20:31,303 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:31,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:31,303 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 33 transitions, 256 flow [2022-12-05 23:20:31,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 33 transitions, 256 flow [2022-12-05 23:20:31,311 INFO L130 PetriNetUnfolder]: 19/62 cut-off events. [2022-12-05 23:20:31,311 INFO L131 PetriNetUnfolder]: For 103/108 co-relation queries the response was YES. [2022-12-05 23:20:31,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 62 events. 19/62 cut-off events. For 103/108 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 177 event pairs, 1 based on Foata normal form. 2/64 useless extension candidates. Maximal degree in co-relation 236. Up to 22 conditions per place. [2022-12-05 23:20:31,312 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 33 transitions, 256 flow [2022-12-05 23:20:31,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-05 23:20:31,440 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [443] $Ultimate##0-->L752: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_27| |v_P0Thread1of1ForFork2_~arg#1.offset_27|) (= v_~z$r_buff0_thd1~0_147 v_~z$r_buff1_thd1~0_113) (= v_~z$w_buff0~0_280 v_~z$w_buff1~0_247) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_27| |v_P0Thread1of1ForFork2_~arg#1.base_27|) (= v_~z$r_buff0_thd1~0_146 1) (= v_~z$w_buff0_used~0_444 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_29| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_29|) (= v_~x~0_105 1) (= v_~z$w_buff0_used~0_445 v_~z$w_buff1_used~0_410) (= (ite (not (and (not (= 0 (mod v_~z$w_buff1_used~0_410 256))) (not (= (mod v_~z$w_buff0_used~0_444 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_29|) (= v_~z$r_buff0_thd3~0_83 v_~z$r_buff1_thd3~0_90) (= v_~z$r_buff0_thd0~0_260 v_~z$r_buff1_thd0~0_244) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_29| 0)) (= v_~z$w_buff0~0_279 2) (= v_~z$r_buff0_thd2~0_95 v_~z$r_buff1_thd2~0_96)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_260, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_445, ~z$w_buff0~0=v_~z$w_buff0~0_280, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_27|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_83, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_27|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_147, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_95} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_444, ~z$w_buff0~0=v_~z$w_buff0~0_279, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_90, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_96, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_410, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_29|, ~z$w_buff1~0=v_~z$w_buff1~0_247, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_27|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_27|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_27|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_260, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_29|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_244, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_113, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_83, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_146, ~x~0=v_~x~0_105, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_95} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] and [420] $Ultimate##0-->L769: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x~0_56 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_56} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-05 23:20:31,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L769-->L772: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [378] $Ultimate##0-->L789: Formula: (and (= v_~y~0_41 2) (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~y~0] [2022-12-05 23:20:31,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L769-->L772: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [323] L752-->L759: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_29 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_98 256) 0)))) (.cse3 (and .cse5 .cse1)) (.cse4 (and (not (= (mod v_~z$w_buff1_used~0_93 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_92 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd1~0_28 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= (ite .cse2 0 v_~z$w_buff0_used~0_98) v_~z$w_buff0_used~0_97) (= v_~z$r_buff0_thd1~0_28 (ite .cse3 0 v_~z$r_buff0_thd1~0_29)) (= (ite .cse2 v_~z$w_buff0~0_39 (ite .cse4 v_~z$w_buff1~0_34 v_~z~0_52)) v_~z~0_51) (= (ite (or .cse3 .cse4) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_98, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_52, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_97, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~z~0=v_~z~0_51, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0] [2022-12-05 23:20:32,011 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 23:20:32,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 711 [2022-12-05 23:20:32,012 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 263 flow [2022-12-05 23:20:32,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-05 23:20:32,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:32,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:32,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:20:32,012 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:32,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:32,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1556701838, now seen corresponding path program 1 times [2022-12-05 23:20:32,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:32,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071550248] [2022-12-05 23:20:32,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:32,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:20:32,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:20:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:20:32,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:20:32,106 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:20:32,107 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:20:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 23:20:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 23:20:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 23:20:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 23:20:32,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 23:20:32,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:20:32,109 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:32,114 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:20:32,114 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:20:32,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:20:32 BasicIcfg [2022-12-05 23:20:32,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:20:32,156 INFO L158 Benchmark]: Toolchain (without parser) took 21705.47ms. Allocated memory was 190.8MB in the beginning and 726.7MB in the end (delta: 535.8MB). Free memory was 154.1MB in the beginning and 533.3MB in the end (delta: -379.2MB). Peak memory consumption was 157.1MB. Max. memory is 8.0GB. [2022-12-05 23:20:32,156 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory is still 168.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:20:32,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.68ms. Allocated memory is still 190.8MB. Free memory was 154.1MB in the beginning and 127.8MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 23:20:32,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.34ms. Allocated memory is still 190.8MB. Free memory was 127.8MB in the beginning and 125.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:20:32,156 INFO L158 Benchmark]: Boogie Preprocessor took 60.70ms. Allocated memory is still 190.8MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:20:32,157 INFO L158 Benchmark]: RCFGBuilder took 684.61ms. Allocated memory is still 190.8MB. Free memory was 123.2MB in the beginning and 88.6MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-05 23:20:32,157 INFO L158 Benchmark]: TraceAbstraction took 20382.72ms. Allocated memory was 190.8MB in the beginning and 726.7MB in the end (delta: 535.8MB). Free memory was 88.1MB in the beginning and 533.3MB in the end (delta: -445.3MB). Peak memory consumption was 91.1MB. Max. memory is 8.0GB. [2022-12-05 23:20:32,158 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory is still 168.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 497.68ms. Allocated memory is still 190.8MB. Free memory was 154.1MB in the beginning and 127.8MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.34ms. Allocated memory is still 190.8MB. Free memory was 127.8MB in the beginning and 125.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.70ms. Allocated memory is still 190.8MB. Free memory was 125.3MB in the beginning and 123.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 684.61ms. Allocated memory is still 190.8MB. Free memory was 123.2MB in the beginning and 88.6MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 20382.72ms. Allocated memory was 190.8MB in the beginning and 726.7MB in the end (delta: 535.8MB). Free memory was 88.1MB in the beginning and 533.3MB in the end (delta: -445.3MB). Peak memory consumption was 91.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 111 PlacesBefore, 38 PlacesAfterwards, 103 TransitionsBefore, 29 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1263, independent: 1211, independent conditional: 1211, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1263, independent: 1211, independent conditional: 0, independent unconditional: 1211, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1263, independent: 1211, independent conditional: 0, independent unconditional: 1211, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1263, independent: 1211, independent conditional: 0, independent unconditional: 1211, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1023, independent: 993, independent conditional: 0, independent unconditional: 993, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1023, independent: 978, independent conditional: 0, independent unconditional: 978, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 258, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1263, independent: 218, independent conditional: 0, independent unconditional: 218, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 1023, unknown conditional: 0, unknown unconditional: 1023] , Statistics on independence cache: Total cache size (in pairs): 1509, Positive cache size: 1479, Positive conditional cache size: 0, Positive unconditional cache size: 1479, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, 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.3s, 31 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 193, independent: 148, independent conditional: 148, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 193, independent: 148, independent conditional: 29, independent unconditional: 119, dependent: 45, dependent conditional: 8, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 193, independent: 148, independent conditional: 29, independent unconditional: 119, dependent: 45, dependent conditional: 8, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 193, independent: 148, independent conditional: 29, independent unconditional: 119, dependent: 45, dependent conditional: 8, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 105, independent: 82, independent conditional: 15, independent unconditional: 67, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 105, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 116, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 114, dependent conditional: 23, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 193, independent: 66, independent conditional: 14, independent unconditional: 52, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 105, unknown conditional: 19, unknown unconditional: 86] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 83, Positive conditional cache size: 15, Positive unconditional cache size: 68, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, 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, 34 PlacesBefore, 34 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 87, independent: 78, independent conditional: 30, independent unconditional: 48, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, independent: 78, independent conditional: 15, independent unconditional: 63, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87, independent: 78, independent conditional: 15, independent unconditional: 63, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 5, independent unconditional: 8, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, independent: 65, independent conditional: 10, independent unconditional: 55, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 15, unknown conditional: 7, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 96, Positive conditional cache size: 20, Positive unconditional cache size: 76, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 74, independent conditional: 32, independent unconditional: 42, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 74, independent conditional: 12, independent unconditional: 62, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 74, independent conditional: 12, independent unconditional: 62, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 69, independent conditional: 11, independent unconditional: 58, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 101, Positive conditional cache size: 21, Positive unconditional cache size: 80, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 137, independent: 122, independent conditional: 122, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 137, independent: 122, independent conditional: 70, independent unconditional: 52, dependent: 15, dependent conditional: 3, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 143, independent: 122, independent conditional: 38, independent unconditional: 84, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 143, independent: 122, independent conditional: 38, independent unconditional: 84, dependent: 21, dependent conditional: 9, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 2, independent unconditional: 7, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 143, independent: 113, independent conditional: 36, independent unconditional: 77, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 11, unknown conditional: 4, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 110, Positive conditional cache size: 23, Positive unconditional cache size: 87, Negative cache size: 29, Negative conditional cache size: 10, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 103, independent: 94, independent conditional: 58, independent unconditional: 36, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103, independent: 94, independent conditional: 33, independent unconditional: 61, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103, independent: 94, independent conditional: 33, independent unconditional: 61, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 103, independent: 92, independent conditional: 33, independent unconditional: 59, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 112, Positive conditional cache size: 23, Positive unconditional cache size: 89, Negative cache size: 29, Negative conditional cache size: 10, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 53, independent conditional: 37, independent unconditional: 16, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 53, independent conditional: 20, independent unconditional: 33, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 53, independent conditional: 20, independent unconditional: 33, dependent: 7, dependent conditional: 0, dependent unconditional: 7, 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: 60, independent: 53, independent conditional: 20, independent unconditional: 33, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 112, Positive conditional cache size: 23, Positive unconditional cache size: 89, Negative cache size: 29, Negative conditional cache size: 10, 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, 56 PlacesBefore, 56 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, independent: 99, independent conditional: 99, 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: 110, independent: 99, independent conditional: 47, independent unconditional: 52, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, independent: 99, independent conditional: 31, independent unconditional: 68, 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: 110, independent: 99, independent conditional: 31, independent unconditional: 68, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 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.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, independent: 98, independent conditional: 31, independent unconditional: 67, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 113, Positive conditional cache size: 23, Positive unconditional cache size: 90, Negative cache size: 29, Negative conditional cache size: 10, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 420 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 87, independent conditional: 87, 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: 99, independent: 87, independent conditional: 59, independent unconditional: 28, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 87, independent conditional: 35, independent unconditional: 52, 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: 99, independent: 87, independent conditional: 35, independent unconditional: 52, 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: 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: 99, independent: 87, independent conditional: 35, independent unconditional: 52, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 113, Positive conditional cache size: 23, Positive unconditional cache size: 90, Negative cache size: 29, Negative conditional cache size: 10, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 67 PlacesBefore, 68 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 503, independent: 449, independent conditional: 449, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 503, independent: 449, independent conditional: 288, independent unconditional: 161, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 503, independent: 449, independent conditional: 188, independent unconditional: 261, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 503, independent: 449, independent conditional: 188, independent unconditional: 261, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 503, independent: 446, independent conditional: 188, independent unconditional: 258, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 116, Positive conditional cache size: 23, Positive unconditional cache size: 93, Negative cache size: 29, Negative conditional cache size: 10, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 100, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 68 PlacesBefore, 68 PlacesAfterwards, 80 TransitionsBefore, 79 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 37, independent conditional: 37, 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: 37, independent: 37, independent conditional: 27, independent unconditional: 10, 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: 37, independent: 37, independent conditional: 16, independent unconditional: 21, 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: 37, independent: 37, independent conditional: 16, independent unconditional: 21, 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: 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: 37, independent: 32, independent conditional: 13, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 121, Positive conditional cache size: 26, Positive unconditional cache size: 95, Negative cache size: 29, Negative conditional cache size: 10, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 121, Positive conditional cache size: 26, Positive unconditional cache size: 95, Negative cache size: 29, Negative conditional cache size: 10, Negative unconditional cache size: 19, 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: 1.5s, 69 PlacesBefore, 65 PlacesAfterwards, 39 TransitionsBefore, 35 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 27, independent conditional: 24, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 27, independent conditional: 24, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 12, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 29, independent: 13, independent conditional: 12, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 14, unknown conditional: 12, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 174, Positive conditional cache size: 40, Positive unconditional cache size: 134, Negative cache size: 29, Negative conditional cache size: 10, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 51 PlacesBefore, 48 PlacesAfterwards, 33 TransitionsBefore, 31 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, independent: 14, independent conditional: 6, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 209, Positive conditional cache size: 47, Positive unconditional cache size: 162, Negative cache size: 30, Negative conditional cache size: 10, 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-1, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=0, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=1, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 [L768] 1 x = 2 VAL [__unbuffered_cnt=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 [L788] 2 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 [L774] 3 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 3 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 819]: 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: 817]: 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: 821]: 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, 133 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: 20.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 270 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 834 IncrementalHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 22 mSDtfsCounter, 834 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1112occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 1517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-05 23:20:32,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...