/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix020.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:09:26,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:09:26,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:09:26,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:09:26,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:09:26,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:09:26,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:09:26,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:09:26,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:09:26,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:09:26,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:09:26,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:09:26,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:09:26,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:09:26,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:09:26,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:09:26,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:09:26,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:09:26,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:09:26,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:09:26,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:09:26,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:09:26,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:09:26,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:09:26,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:09:26,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:09:26,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:09:26,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:09:26,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:09:26,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:09:26,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:09:26,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:09:26,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:09:26,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:09:26,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:09:26,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:09:26,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:09:26,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:09:26,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:09:26,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:09:26,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:09:26,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:09:26,476 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:09:26,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:09:26,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:09:26,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:09:26,479 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:09:26,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:09:26,480 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:09:26,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:09:26,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:09:26,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:09:26,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:09:26,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:09:26,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:09:26,481 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:09:26,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:09:26,482 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:09:26,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:09:26,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:09:26,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:09:26,482 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:09:26,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:09:26,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:09:26,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:09:26,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:09:26,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:09:26,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:09:26,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:09:26,484 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:09:26,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:09:26,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:09:26,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:09:26,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:09:26,851 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:09:26,851 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:09:26,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix020.oepc.i [2022-12-06 04:09:27,881 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:09:28,188 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:09:28,188 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix020.oepc.i [2022-12-06 04:09:28,212 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96318baed/09bae69c1224410da890bbcd9b5a8ccc/FLAG8122256af [2022-12-06 04:09:28,230 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96318baed/09bae69c1224410da890bbcd9b5a8ccc [2022-12-06 04:09:28,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:09:28,234 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:09:28,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:09:28,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:09:28,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:09:28,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:28" (1/1) ... [2022-12-06 04:09:28,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ab3b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28, skipping insertion in model container [2022-12-06 04:09:28,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:28" (1/1) ... [2022-12-06 04:09:28,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:09:28,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:09:28,456 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/mix020.oepc.i[945,958] [2022-12-06 04:09:28,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:09:28,683 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:09:28,693 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/mix020.oepc.i[945,958] [2022-12-06 04:09:28,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:28,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:28,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:09:28,793 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:09:28,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28 WrapperNode [2022-12-06 04:09:28,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:09:28,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:09:28,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:09:28,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:09:28,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28" (1/1) ... [2022-12-06 04:09:28,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28" (1/1) ... [2022-12-06 04:09:28,835 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-06 04:09:28,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:09:28,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:09:28,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:09:28,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:09:28,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28" (1/1) ... [2022-12-06 04:09:28,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28" (1/1) ... [2022-12-06 04:09:28,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28" (1/1) ... [2022-12-06 04:09:28,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28" (1/1) ... [2022-12-06 04:09:28,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28" (1/1) ... [2022-12-06 04:09:28,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28" (1/1) ... [2022-12-06 04:09:28,860 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28" (1/1) ... [2022-12-06 04:09:28,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28" (1/1) ... [2022-12-06 04:09:28,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:09:28,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:09:28,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:09:28,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:09:28,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28" (1/1) ... [2022-12-06 04:09:28,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:09:28,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:09:28,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:09:28,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:09:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:09:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:09:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:09:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:09:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:09:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:09:28,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:09:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:09:28,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:09:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:09:28,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:09:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:09:28,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:09:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:09:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:09:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:09:28,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:09:28,973 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:09:29,103 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:09:29,105 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:09:29,485 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:09:29,586 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:09:29,586 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:09:29,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:29 BoogieIcfgContainer [2022-12-06 04:09:29,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:09:29,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:09:29,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:09:29,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:09:29,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:09:28" (1/3) ... [2022-12-06 04:09:29,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f5d0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:09:29, skipping insertion in model container [2022-12-06 04:09:29,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:28" (2/3) ... [2022-12-06 04:09:29,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f5d0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:09:29, skipping insertion in model container [2022-12-06 04:09:29,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:29" (3/3) ... [2022-12-06 04:09:29,596 INFO L112 eAbstractionObserver]: Analyzing ICFG mix020.oepc.i [2022-12-06 04:09:29,611 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:09:29,611 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:09:29,611 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:09:29,670 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:09:29,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-06 04:09:29,799 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-06 04:09:29,799 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:29,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 04:09:29,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-06 04:09:29,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-06 04:09:29,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:29,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-06 04:09:29,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-06 04:09:29,864 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-06 04:09:29,864 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:29,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 04:09:29,871 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-06 04:09:29,871 INFO L188 LiptonReduction]: Number of co-enabled transitions 3164 [2022-12-06 04:09:34,685 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-06 04:09:34,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:09:34,703 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;@36f4858a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:09:34,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:09:34,705 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 04:09:34,705 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:34,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:34,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:09:34,706 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:34,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:34,710 INFO L85 PathProgramCache]: Analyzing trace with hash 545536, now seen corresponding path program 1 times [2022-12-06 04:09:34,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:34,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595357269] [2022-12-06 04:09:34,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:34,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:35,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:35,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595357269] [2022-12-06 04:09:35,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595357269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:35,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:35,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:09:35,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240339239] [2022-12-06 04:09:35,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:35,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:35,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:35,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:35,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:35,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 04:09:35,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:35,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:35,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 04:09:35,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:36,270 INFO L130 PetriNetUnfolder]: 6050/8806 cut-off events. [2022-12-06 04:09:36,270 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-06 04:09:36,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17205 conditions, 8806 events. 6050/8806 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 52879 event pairs, 1106 based on Foata normal form. 0/8049 useless extension candidates. Maximal degree in co-relation 17193. Up to 6574 conditions per place. [2022-12-06 04:09:36,322 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 2 changer transitions 10/57 dead transitions. [2022-12-06 04:09:36,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 241 flow [2022-12-06 04:09:36,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-06 04:09:36,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-06 04:09:36,334 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 70 transitions. [2022-12-06 04:09:36,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 241 flow [2022-12-06 04:09:36,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:09:36,341 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-06 04:09:36,342 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 04:09:36,347 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-06 04:09:36,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:36,348 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 68 flow [2022-12-06 04:09:36,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:36,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:36,350 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 68 flow [2022-12-06 04:09:36,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 04:09:36,357 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 04:09:36,357 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:36,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:09:36,358 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 04:09:36,358 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 04:09:36,461 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:36,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 04:09:36,464 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-06 04:09:36,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:36,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:36,464 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:36,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:09:36,468 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:36,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:36,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1368413395, now seen corresponding path program 1 times [2022-12-06 04:09:36,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:36,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045566658] [2022-12-06 04:09:36,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:36,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:36,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:36,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045566658] [2022-12-06 04:09:36,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045566658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:36,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:36,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:09:36,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285603253] [2022-12-06 04:09:36,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:36,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:36,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:36,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:36,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:36,676 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:09:36,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:36,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:36,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:09:36,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:38,757 INFO L130 PetriNetUnfolder]: 14423/19622 cut-off events. [2022-12-06 04:09:38,758 INFO L131 PetriNetUnfolder]: For 1011/1011 co-relation queries the response was YES. [2022-12-06 04:09:38,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40728 conditions, 19622 events. 14423/19622 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 101984 event pairs, 5141 based on Foata normal form. 458/20080 useless extension candidates. Maximal degree in co-relation 40718. Up to 13627 conditions per place. [2022-12-06 04:09:38,873 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2022-12-06 04:09:38,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 232 flow [2022-12-06 04:09:38,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 04:09:38,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-06 04:09:38,877 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 54 transitions. [2022-12-06 04:09:38,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 232 flow [2022-12-06 04:09:38,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:38,879 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2022-12-06 04:09:38,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-06 04:09:38,880 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2022-12-06 04:09:38,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:38,880 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 118 flow [2022-12-06 04:09:38,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:38,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:38,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 118 flow [2022-12-06 04:09:38,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 118 flow [2022-12-06 04:09:38,916 INFO L130 PetriNetUnfolder]: 152/414 cut-off events. [2022-12-06 04:09:38,916 INFO L131 PetriNetUnfolder]: For 40/48 co-relation queries the response was YES. [2022-12-06 04:09:38,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 414 events. 152/414 cut-off events. For 40/48 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2538 event pairs, 72 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 773. Up to 221 conditions per place. [2022-12-06 04:09:38,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 118 flow [2022-12-06 04:09:38,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-06 04:09:38,979 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:38,980 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-06 04:09:38,981 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2022-12-06 04:09:38,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:38,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:38,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:38,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:09:38,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:38,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:38,991 INFO L85 PathProgramCache]: Analyzing trace with hash 528858352, now seen corresponding path program 1 times [2022-12-06 04:09:38,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:38,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979308010] [2022-12-06 04:09:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:38,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:39,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:39,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979308010] [2022-12-06 04:09:39,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979308010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:39,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:39,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:09:39,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131934493] [2022-12-06 04:09:39,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:39,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:39,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:39,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:39,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:39,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:09:39,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 flow. Second operand has 4 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-06 04:09:39,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:39,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:09:39,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:40,734 INFO L130 PetriNetUnfolder]: 13341/18172 cut-off events. [2022-12-06 04:09:40,734 INFO L131 PetriNetUnfolder]: For 6423/6423 co-relation queries the response was YES. [2022-12-06 04:09:40,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44397 conditions, 18172 events. 13341/18172 cut-off events. For 6423/6423 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 90142 event pairs, 3866 based on Foata normal form. 230/18402 useless extension candidates. Maximal degree in co-relation 44385. Up to 9003 conditions per place. [2022-12-06 04:09:40,828 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 54 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2022-12-06 04:09:40,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 320 flow [2022-12-06 04:09:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:09:40,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2022-12-06 04:09:40,831 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:09:40,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 320 flow [2022-12-06 04:09:40,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:40,881 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 162 flow [2022-12-06 04:09:40,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-06 04:09:40,882 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-06 04:09:40,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:40,883 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 162 flow [2022-12-06 04:09:40,885 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:40,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:40,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 162 flow [2022-12-06 04:09:40,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 162 flow [2022-12-06 04:09:40,922 INFO L130 PetriNetUnfolder]: 122/331 cut-off events. [2022-12-06 04:09:40,923 INFO L131 PetriNetUnfolder]: For 144/166 co-relation queries the response was YES. [2022-12-06 04:09:40,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 331 events. 122/331 cut-off events. For 144/166 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1828 event pairs, 41 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 745. Up to 181 conditions per place. [2022-12-06 04:09:40,927 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 162 flow [2022-12-06 04:09:40,927 INFO L188 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-06 04:09:40,972 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:40,974 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 04:09:40,974 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 162 flow [2022-12-06 04:09:40,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-06 04:09:40,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:40,974 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:40,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:09:40,974 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:40,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:40,975 INFO L85 PathProgramCache]: Analyzing trace with hash -785935931, now seen corresponding path program 1 times [2022-12-06 04:09:40,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:40,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258684833] [2022-12-06 04:09:40,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:40,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:41,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:41,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258684833] [2022-12-06 04:09:41,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258684833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:41,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:41,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:09:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442075874] [2022-12-06 04:09:41,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:41,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:41,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:41,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:41,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:41,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:09:41,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 162 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:41,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:41,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:09:41,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:42,542 INFO L130 PetriNetUnfolder]: 13066/17797 cut-off events. [2022-12-06 04:09:42,543 INFO L131 PetriNetUnfolder]: For 10814/10814 co-relation queries the response was YES. [2022-12-06 04:09:42,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46038 conditions, 17797 events. 13066/17797 cut-off events. For 10814/10814 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 91117 event pairs, 1906 based on Foata normal form. 40/17837 useless extension candidates. Maximal degree in co-relation 46023. Up to 11755 conditions per place. [2022-12-06 04:09:42,647 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 60 selfloop transitions, 16 changer transitions 0/76 dead transitions. [2022-12-06 04:09:42,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 434 flow [2022-12-06 04:09:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 04:09:42,649 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 04:09:42,649 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 162 flow. Second operand 4 states and 68 transitions. [2022-12-06 04:09:42,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 76 transitions, 434 flow [2022-12-06 04:09:42,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 429 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:42,706 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 255 flow [2022-12-06 04:09:42,706 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-06 04:09:42,707 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2022-12-06 04:09:42,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:42,708 INFO L89 Accepts]: Start accepts. Operand has 49 places, 44 transitions, 255 flow [2022-12-06 04:09:42,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:42,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:42,709 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 44 transitions, 255 flow [2022-12-06 04:09:42,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 255 flow [2022-12-06 04:09:42,734 INFO L130 PetriNetUnfolder]: 106/295 cut-off events. [2022-12-06 04:09:42,734 INFO L131 PetriNetUnfolder]: For 306/357 co-relation queries the response was YES. [2022-12-06 04:09:42,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 295 events. 106/295 cut-off events. For 306/357 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1571 event pairs, 32 based on Foata normal form. 1/289 useless extension candidates. Maximal degree in co-relation 822. Up to 161 conditions per place. [2022-12-06 04:09:42,738 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 44 transitions, 255 flow [2022-12-06 04:09:42,738 INFO L188 LiptonReduction]: Number of co-enabled transitions 636 [2022-12-06 04:09:42,742 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:42,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 04:09:42,748 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 255 flow [2022-12-06 04:09:42,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:42,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:42,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:42,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:09:42,749 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:42,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1405898432, now seen corresponding path program 1 times [2022-12-06 04:09:42,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:42,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839739923] [2022-12-06 04:09:42,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:42,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:42,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:42,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:42,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839739923] [2022-12-06 04:09:42,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839739923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:42,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:42,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:09:42,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604262652] [2022-12-06 04:09:42,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:42,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:42,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:42,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:42,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:42,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 04:09:42,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:42,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:42,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 04:09:42,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:43,733 INFO L130 PetriNetUnfolder]: 6137/9116 cut-off events. [2022-12-06 04:09:43,733 INFO L131 PetriNetUnfolder]: For 6810/7340 co-relation queries the response was YES. [2022-12-06 04:09:43,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23444 conditions, 9116 events. 6137/9116 cut-off events. For 6810/7340 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 53010 event pairs, 1405 based on Foata normal form. 405/9309 useless extension candidates. Maximal degree in co-relation 23426. Up to 7532 conditions per place. [2022-12-06 04:09:43,792 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 47 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2022-12-06 04:09:43,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 447 flow [2022-12-06 04:09:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 04:09:43,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 04:09:43,794 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 255 flow. Second operand 3 states and 56 transitions. [2022-12-06 04:09:43,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 447 flow [2022-12-06 04:09:43,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 447 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:09:43,806 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 288 flow [2022-12-06 04:09:43,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2022-12-06 04:09:43,806 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2022-12-06 04:09:43,806 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:43,807 INFO L89 Accepts]: Start accepts. Operand has 52 places, 48 transitions, 288 flow [2022-12-06 04:09:43,807 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:43,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:43,808 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 48 transitions, 288 flow [2022-12-06 04:09:43,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 48 transitions, 288 flow [2022-12-06 04:09:43,879 INFO L130 PetriNetUnfolder]: 408/942 cut-off events. [2022-12-06 04:09:43,879 INFO L131 PetriNetUnfolder]: For 552/662 co-relation queries the response was YES. [2022-12-06 04:09:43,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2257 conditions, 942 events. 408/942 cut-off events. For 552/662 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6687 event pairs, 168 based on Foata normal form. 4/866 useless extension candidates. Maximal degree in co-relation 2239. Up to 497 conditions per place. [2022-12-06 04:09:43,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 48 transitions, 288 flow [2022-12-06 04:09:43,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 752 [2022-12-06 04:09:43,909 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:43,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 04:09:43,912 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 288 flow [2022-12-06 04:09:43,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:43,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:43,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:43,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:09:43,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:43,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:43,913 INFO L85 PathProgramCache]: Analyzing trace with hash 876578943, now seen corresponding path program 1 times [2022-12-06 04:09:43,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:43,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329701583] [2022-12-06 04:09:43,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:43,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:44,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:44,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329701583] [2022-12-06 04:09:44,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329701583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:44,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:44,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:44,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489779111] [2022-12-06 04:09:44,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:44,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:44,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:44,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:44,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:44,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 04:09:44,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:44,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:44,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 04:09:44,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:44,642 INFO L130 PetriNetUnfolder]: 3318/5230 cut-off events. [2022-12-06 04:09:44,643 INFO L131 PetriNetUnfolder]: For 4176/4459 co-relation queries the response was YES. [2022-12-06 04:09:44,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15651 conditions, 5230 events. 3318/5230 cut-off events. For 4176/4459 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 30239 event pairs, 767 based on Foata normal form. 454/5578 useless extension candidates. Maximal degree in co-relation 15630. Up to 2198 conditions per place. [2022-12-06 04:09:44,672 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 64 selfloop transitions, 9 changer transitions 0/88 dead transitions. [2022-12-06 04:09:44,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 604 flow [2022-12-06 04:09:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-06 04:09:44,674 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6875 [2022-12-06 04:09:44,674 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 288 flow. Second operand 4 states and 77 transitions. [2022-12-06 04:09:44,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 604 flow [2022-12-06 04:09:44,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 599 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:44,683 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 335 flow [2022-12-06 04:09:44,683 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=335, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2022-12-06 04:09:44,684 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2022-12-06 04:09:44,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:44,684 INFO L89 Accepts]: Start accepts. Operand has 55 places, 52 transitions, 335 flow [2022-12-06 04:09:44,685 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:44,685 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:44,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 52 transitions, 335 flow [2022-12-06 04:09:44,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 52 transitions, 335 flow [2022-12-06 04:09:44,739 INFO L130 PetriNetUnfolder]: 244/635 cut-off events. [2022-12-06 04:09:44,739 INFO L131 PetriNetUnfolder]: For 531/735 co-relation queries the response was YES. [2022-12-06 04:09:44,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 635 events. 244/635 cut-off events. For 531/735 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4126 event pairs, 50 based on Foata normal form. 29/626 useless extension candidates. Maximal degree in co-relation 1908. Up to 333 conditions per place. [2022-12-06 04:09:44,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 52 transitions, 335 flow [2022-12-06 04:09:44,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 868 [2022-12-06 04:09:44,752 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:44,753 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-06 04:09:44,753 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 335 flow [2022-12-06 04:09:44,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:44,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:44,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:44,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:09:44,753 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:44,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash -41402868, now seen corresponding path program 1 times [2022-12-06 04:09:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:44,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845191295] [2022-12-06 04:09:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:44,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:44,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:44,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845191295] [2022-12-06 04:09:44,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845191295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:44,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:44,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:09:44,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127954676] [2022-12-06 04:09:44,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:44,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:09:44,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:44,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:09:44,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:09:44,966 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 04:09:44,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:44,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:44,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 04:09:44,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:45,803 INFO L130 PetriNetUnfolder]: 5423/8342 cut-off events. [2022-12-06 04:09:45,803 INFO L131 PetriNetUnfolder]: For 12749/13023 co-relation queries the response was YES. [2022-12-06 04:09:45,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28163 conditions, 8342 events. 5423/8342 cut-off events. For 12749/13023 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 48705 event pairs, 1213 based on Foata normal form. 175/8425 useless extension candidates. Maximal degree in co-relation 28140. Up to 3889 conditions per place. [2022-12-06 04:09:45,836 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 72 selfloop transitions, 3 changer transitions 14/98 dead transitions. [2022-12-06 04:09:45,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 98 transitions, 767 flow [2022-12-06 04:09:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:09:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:09:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 04:09:45,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2022-12-06 04:09:45,839 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 335 flow. Second operand 4 states and 61 transitions. [2022-12-06 04:09:45,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 98 transitions, 767 flow [2022-12-06 04:09:45,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 98 transitions, 721 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:45,863 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 338 flow [2022-12-06 04:09:45,863 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=338, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2022-12-06 04:09:45,864 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2022-12-06 04:09:45,864 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:45,864 INFO L89 Accepts]: Start accepts. Operand has 58 places, 53 transitions, 338 flow [2022-12-06 04:09:45,865 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:45,865 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:45,866 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 53 transitions, 338 flow [2022-12-06 04:09:45,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 53 transitions, 338 flow [2022-12-06 04:09:45,960 INFO L130 PetriNetUnfolder]: 347/899 cut-off events. [2022-12-06 04:09:45,960 INFO L131 PetriNetUnfolder]: For 851/1087 co-relation queries the response was YES. [2022-12-06 04:09:45,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2522 conditions, 899 events. 347/899 cut-off events. For 851/1087 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6561 event pairs, 66 based on Foata normal form. 37/881 useless extension candidates. Maximal degree in co-relation 2501. Up to 459 conditions per place. [2022-12-06 04:09:45,971 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 53 transitions, 338 flow [2022-12-06 04:09:45,972 INFO L188 LiptonReduction]: Number of co-enabled transitions 884 [2022-12-06 04:09:46,016 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:46,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-06 04:09:46,017 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 341 flow [2022-12-06 04:09:46,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:46,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:46,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:46,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:09:46,018 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:46,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1771492085, now seen corresponding path program 1 times [2022-12-06 04:09:46,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:46,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199918501] [2022-12-06 04:09:46,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:46,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:46,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:46,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199918501] [2022-12-06 04:09:46,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199918501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:46,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:46,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:09:46,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454753488] [2022-12-06 04:09:46,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:46,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:09:46,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:46,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:09:46,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:09:46,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 04:09:46,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:46,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:46,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 04:09:46,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:47,239 INFO L130 PetriNetUnfolder]: 6502/10358 cut-off events. [2022-12-06 04:09:47,239 INFO L131 PetriNetUnfolder]: For 14155/14280 co-relation queries the response was YES. [2022-12-06 04:09:47,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32511 conditions, 10358 events. 6502/10358 cut-off events. For 14155/14280 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 67391 event pairs, 2427 based on Foata normal form. 95/10254 useless extension candidates. Maximal degree in co-relation 32487. Up to 5751 conditions per place. [2022-12-06 04:09:47,312 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 58 selfloop transitions, 7 changer transitions 4/78 dead transitions. [2022-12-06 04:09:47,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 580 flow [2022-12-06 04:09:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:09:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:09:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 04:09:47,314 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-06 04:09:47,314 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 341 flow. Second operand 3 states and 54 transitions. [2022-12-06 04:09:47,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 580 flow [2022-12-06 04:09:47,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 577 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:47,341 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 342 flow [2022-12-06 04:09:47,341 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2022-12-06 04:09:47,342 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 12 predicate places. [2022-12-06 04:09:47,342 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:47,342 INFO L89 Accepts]: Start accepts. Operand has 60 places, 51 transitions, 342 flow [2022-12-06 04:09:47,343 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:47,343 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:47,344 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 51 transitions, 342 flow [2022-12-06 04:09:47,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 51 transitions, 342 flow [2022-12-06 04:09:47,417 INFO L130 PetriNetUnfolder]: 402/1033 cut-off events. [2022-12-06 04:09:47,417 INFO L131 PetriNetUnfolder]: For 1209/1417 co-relation queries the response was YES. [2022-12-06 04:09:47,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2885 conditions, 1033 events. 402/1033 cut-off events. For 1209/1417 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 7834 event pairs, 97 based on Foata normal form. 40/1013 useless extension candidates. Maximal degree in co-relation 2863. Up to 587 conditions per place. [2022-12-06 04:09:47,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 51 transitions, 342 flow [2022-12-06 04:09:47,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 814 [2022-12-06 04:09:47,461 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:47,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 04:09:47,462 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 344 flow [2022-12-06 04:09:47,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:47,462 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:47,462 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:47,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:09:47,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:47,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:47,463 INFO L85 PathProgramCache]: Analyzing trace with hash -425012598, now seen corresponding path program 1 times [2022-12-06 04:09:47,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:47,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384002713] [2022-12-06 04:09:47,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:47,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:47,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:47,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384002713] [2022-12-06 04:09:47,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384002713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:47,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:47,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:47,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70957853] [2022-12-06 04:09:47,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:47,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:47,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:47,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:47,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:47,922 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 04:09:47,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:47,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:47,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 04:09:47,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:49,371 INFO L130 PetriNetUnfolder]: 9524/15449 cut-off events. [2022-12-06 04:09:49,371 INFO L131 PetriNetUnfolder]: For 19280/19543 co-relation queries the response was YES. [2022-12-06 04:09:49,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48512 conditions, 15449 events. 9524/15449 cut-off events. For 19280/19543 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 112805 event pairs, 2197 based on Foata normal form. 175/15467 useless extension candidates. Maximal degree in co-relation 48487. Up to 7416 conditions per place. [2022-12-06 04:09:49,453 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 97 selfloop transitions, 10 changer transitions 40/159 dead transitions. [2022-12-06 04:09:49,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 159 transitions, 1230 flow [2022-12-06 04:09:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:09:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:09:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2022-12-06 04:09:49,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5761904761904761 [2022-12-06 04:09:49,455 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 344 flow. Second operand 7 states and 121 transitions. [2022-12-06 04:09:49,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 159 transitions, 1230 flow [2022-12-06 04:09:49,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 159 transitions, 1203 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 04:09:49,483 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 400 flow [2022-12-06 04:09:49,483 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=400, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2022-12-06 04:09:49,483 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2022-12-06 04:09:49,483 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:49,484 INFO L89 Accepts]: Start accepts. Operand has 69 places, 59 transitions, 400 flow [2022-12-06 04:09:49,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:49,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:49,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 59 transitions, 400 flow [2022-12-06 04:09:49,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 59 transitions, 400 flow [2022-12-06 04:09:49,748 INFO L130 PetriNetUnfolder]: 1608/3666 cut-off events. [2022-12-06 04:09:49,748 INFO L131 PetriNetUnfolder]: For 3712/4448 co-relation queries the response was YES. [2022-12-06 04:09:49,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10448 conditions, 3666 events. 1608/3666 cut-off events. For 3712/4448 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 33542 event pairs, 359 based on Foata normal form. 134/3473 useless extension candidates. Maximal degree in co-relation 10421. Up to 1935 conditions per place. [2022-12-06 04:09:49,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 59 transitions, 400 flow [2022-12-06 04:09:49,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 1106 [2022-12-06 04:09:49,819 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:49,820 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 337 [2022-12-06 04:09:49,820 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 400 flow [2022-12-06 04:09:49,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:49,820 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:49,820 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:49,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:09:49,821 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1322420114, now seen corresponding path program 2 times [2022-12-06 04:09:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:49,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745099791] [2022-12-06 04:09:49,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:49,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:50,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:50,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745099791] [2022-12-06 04:09:50,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745099791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:50,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:50,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741426698] [2022-12-06 04:09:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:50,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:50,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:50,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:50,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:50,036 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 04:09:50,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 400 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:50,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:50,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 04:09:50,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:51,012 INFO L130 PetriNetUnfolder]: 5690/9337 cut-off events. [2022-12-06 04:09:51,012 INFO L131 PetriNetUnfolder]: For 15564/15945 co-relation queries the response was YES. [2022-12-06 04:09:51,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33232 conditions, 9337 events. 5690/9337 cut-off events. For 15564/15945 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 64698 event pairs, 854 based on Foata normal form. 780/9970 useless extension candidates. Maximal degree in co-relation 33202. Up to 3504 conditions per place. [2022-12-06 04:09:51,050 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 99 selfloop transitions, 13 changer transitions 7/130 dead transitions. [2022-12-06 04:09:51,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 130 transitions, 1037 flow [2022-12-06 04:09:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:09:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:09:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-06 04:09:51,052 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 04:09:51,052 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 400 flow. Second operand 5 states and 100 transitions. [2022-12-06 04:09:51,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 130 transitions, 1037 flow [2022-12-06 04:09:51,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 130 transitions, 1022 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:51,070 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 432 flow [2022-12-06 04:09:51,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=432, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2022-12-06 04:09:51,071 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2022-12-06 04:09:51,071 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:51,071 INFO L89 Accepts]: Start accepts. Operand has 70 places, 61 transitions, 432 flow [2022-12-06 04:09:51,073 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:51,073 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:51,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 61 transitions, 432 flow [2022-12-06 04:09:51,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 61 transitions, 432 flow [2022-12-06 04:09:51,223 INFO L130 PetriNetUnfolder]: 812/1933 cut-off events. [2022-12-06 04:09:51,223 INFO L131 PetriNetUnfolder]: For 2871/3473 co-relation queries the response was YES. [2022-12-06 04:09:51,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6694 conditions, 1933 events. 812/1933 cut-off events. For 2871/3473 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 15865 event pairs, 87 based on Foata normal form. 148/1903 useless extension candidates. Maximal degree in co-relation 6668. Up to 966 conditions per place. [2022-12-06 04:09:51,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 61 transitions, 432 flow [2022-12-06 04:09:51,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 982 [2022-12-06 04:09:51,371 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:51,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 301 [2022-12-06 04:09:51,372 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 438 flow [2022-12-06 04:09:51,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:51,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:51,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:51,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:09:51,373 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:51,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:51,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1260733023, now seen corresponding path program 1 times [2022-12-06 04:09:51,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:51,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962631949] [2022-12-06 04:09:51,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:51,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:51,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:51,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962631949] [2022-12-06 04:09:51,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962631949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:51,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:51,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:09:51,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114251682] [2022-12-06 04:09:51,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:51,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:09:51,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:51,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:09:51,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:09:51,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 04:09:51,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 438 flow. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:51,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:51,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 04:09:51,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:52,924 INFO L130 PetriNetUnfolder]: 9568/14819 cut-off events. [2022-12-06 04:09:52,925 INFO L131 PetriNetUnfolder]: For 41575/41575 co-relation queries the response was YES. [2022-12-06 04:09:52,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60895 conditions, 14819 events. 9568/14819 cut-off events. For 41575/41575 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 95889 event pairs, 1656 based on Foata normal form. 15/14834 useless extension candidates. Maximal degree in co-relation 60866. Up to 6769 conditions per place. [2022-12-06 04:09:52,996 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 111 selfloop transitions, 14 changer transitions 61/186 dead transitions. [2022-12-06 04:09:52,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 186 transitions, 1603 flow [2022-12-06 04:09:52,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 04:09:52,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5752688172043011 [2022-12-06 04:09:52,997 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 438 flow. Second operand 6 states and 107 transitions. [2022-12-06 04:09:52,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 186 transitions, 1603 flow [2022-12-06 04:09:53,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 186 transitions, 1481 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-06 04:09:53,310 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 432 flow [2022-12-06 04:09:53,310 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=432, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2022-12-06 04:09:53,310 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 24 predicate places. [2022-12-06 04:09:53,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:53,310 INFO L89 Accepts]: Start accepts. Operand has 72 places, 61 transitions, 432 flow [2022-12-06 04:09:53,313 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:53,313 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:53,313 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 61 transitions, 432 flow [2022-12-06 04:09:53,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 61 transitions, 432 flow [2022-12-06 04:09:53,553 INFO L130 PetriNetUnfolder]: 972/2376 cut-off events. [2022-12-06 04:09:53,553 INFO L131 PetriNetUnfolder]: For 2978/3451 co-relation queries the response was YES. [2022-12-06 04:09:53,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7084 conditions, 2376 events. 972/2376 cut-off events. For 2978/3451 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 20706 event pairs, 143 based on Foata normal form. 189/2359 useless extension candidates. Maximal degree in co-relation 7056. Up to 896 conditions per place. [2022-12-06 04:09:53,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 61 transitions, 432 flow [2022-12-06 04:09:53,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 948 [2022-12-06 04:09:53,579 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:09:53,579 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 269 [2022-12-06 04:09:53,579 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 432 flow [2022-12-06 04:09:53,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:53,580 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:53,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:53,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:09:53,580 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:53,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash -14959501, now seen corresponding path program 2 times [2022-12-06 04:09:53,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:53,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514895060] [2022-12-06 04:09:53,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:54,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:54,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514895060] [2022-12-06 04:09:54,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514895060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:54,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:54,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:09:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851142034] [2022-12-06 04:09:54,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:54,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:09:54,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:54,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:09:54,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:09:54,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 04:09:54,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 432 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:54,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:54,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 04:09:54,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:55,556 INFO L130 PetriNetUnfolder]: 7153/12102 cut-off events. [2022-12-06 04:09:55,556 INFO L131 PetriNetUnfolder]: For 25915/26407 co-relation queries the response was YES. [2022-12-06 04:09:55,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45142 conditions, 12102 events. 7153/12102 cut-off events. For 25915/26407 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 91385 event pairs, 1639 based on Foata normal form. 279/12211 useless extension candidates. Maximal degree in co-relation 45111. Up to 4785 conditions per place. [2022-12-06 04:09:55,611 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 98 selfloop transitions, 12 changer transitions 51/171 dead transitions. [2022-12-06 04:09:55,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 171 transitions, 1429 flow [2022-12-06 04:09:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:09:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:09:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-12-06 04:09:55,613 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5345622119815668 [2022-12-06 04:09:55,613 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 432 flow. Second operand 7 states and 116 transitions. [2022-12-06 04:09:55,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 171 transitions, 1429 flow [2022-12-06 04:09:55,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 171 transitions, 1384 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 04:09:55,901 INFO L231 Difference]: Finished difference. Result has 79 places, 66 transitions, 477 flow [2022-12-06 04:09:55,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=477, PETRI_PLACES=79, PETRI_TRANSITIONS=66} [2022-12-06 04:09:55,901 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2022-12-06 04:09:55,901 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:55,901 INFO L89 Accepts]: Start accepts. Operand has 79 places, 66 transitions, 477 flow [2022-12-06 04:09:55,903 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:55,903 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:55,903 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 66 transitions, 477 flow [2022-12-06 04:09:55,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 477 flow [2022-12-06 04:09:56,090 INFO L130 PetriNetUnfolder]: 1186/2772 cut-off events. [2022-12-06 04:09:56,090 INFO L131 PetriNetUnfolder]: For 4046/4718 co-relation queries the response was YES. [2022-12-06 04:09:56,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9002 conditions, 2772 events. 1186/2772 cut-off events. For 4046/4718 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 24272 event pairs, 138 based on Foata normal form. 237/2776 useless extension candidates. Maximal degree in co-relation 8970. Up to 1112 conditions per place. [2022-12-06 04:09:56,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 66 transitions, 477 flow [2022-12-06 04:09:56,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 1032 [2022-12-06 04:09:56,284 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:09:56,285 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 384 [2022-12-06 04:09:56,285 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 483 flow [2022-12-06 04:09:56,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:56,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:56,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:56,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:09:56,286 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:56,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:56,286 INFO L85 PathProgramCache]: Analyzing trace with hash 463095819, now seen corresponding path program 3 times [2022-12-06 04:09:56,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:56,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356872656] [2022-12-06 04:09:56,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:09:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:09:56,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:09:56,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356872656] [2022-12-06 04:09:56,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356872656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:09:56,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:09:56,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:09:56,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730723805] [2022-12-06 04:09:56,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:09:56,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:09:56,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:09:56,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:09:56,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:09:56,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-06 04:09:56,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 483 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:56,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:09:56,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-06 04:09:56,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:09:57,559 INFO L130 PetriNetUnfolder]: 6211/10248 cut-off events. [2022-12-06 04:09:57,559 INFO L131 PetriNetUnfolder]: For 29699/29878 co-relation queries the response was YES. [2022-12-06 04:09:57,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41361 conditions, 10248 events. 6211/10248 cut-off events. For 29699/29878 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 74237 event pairs, 984 based on Foata normal form. 286/10388 useless extension candidates. Maximal degree in co-relation 41331. Up to 3985 conditions per place. [2022-12-06 04:09:57,602 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 70 selfloop transitions, 17 changer transitions 44/135 dead transitions. [2022-12-06 04:09:57,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 135 transitions, 1189 flow [2022-12-06 04:09:57,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:09:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:09:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-06 04:09:57,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2022-12-06 04:09:57,603 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 483 flow. Second operand 6 states and 106 transitions. [2022-12-06 04:09:57,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 135 transitions, 1189 flow [2022-12-06 04:09:58,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 135 transitions, 1141 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 04:09:58,050 INFO L231 Difference]: Finished difference. Result has 79 places, 47 transitions, 330 flow [2022-12-06 04:09:58,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=79, PETRI_TRANSITIONS=47} [2022-12-06 04:09:58,051 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2022-12-06 04:09:58,051 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:09:58,051 INFO L89 Accepts]: Start accepts. Operand has 79 places, 47 transitions, 330 flow [2022-12-06 04:09:58,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:09:58,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:58,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 47 transitions, 330 flow [2022-12-06 04:09:58,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 47 transitions, 330 flow [2022-12-06 04:09:58,063 INFO L130 PetriNetUnfolder]: 48/137 cut-off events. [2022-12-06 04:09:58,063 INFO L131 PetriNetUnfolder]: For 209/223 co-relation queries the response was YES. [2022-12-06 04:09:58,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 137 events. 48/137 cut-off events. For 209/223 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 1 based on Foata normal form. 1/129 useless extension candidates. Maximal degree in co-relation 489. Up to 48 conditions per place. [2022-12-06 04:09:58,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 47 transitions, 330 flow [2022-12-06 04:09:58,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-06 04:09:59,001 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 04:09:59,002 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 951 [2022-12-06 04:09:59,002 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 41 transitions, 322 flow [2022-12-06 04:09:59,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:09:59,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:09:59,003 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:09:59,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:09:59,003 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:09:59,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:09:59,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1864182075, now seen corresponding path program 1 times [2022-12-06 04:09:59,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:09:59,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508707476] [2022-12-06 04:09:59,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:09:59,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:09:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:00,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:00,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508707476] [2022-12-06 04:10:00,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508707476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:00,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:00,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:10:00,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211735018] [2022-12-06 04:10:00,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:00,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:10:00,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:00,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:10:00,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:10:00,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 04:10:00,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 41 transitions, 322 flow. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:00,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:00,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 04:10:00,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:00,382 INFO L130 PetriNetUnfolder]: 514/832 cut-off events. [2022-12-06 04:10:00,382 INFO L131 PetriNetUnfolder]: For 2796/2796 co-relation queries the response was YES. [2022-12-06 04:10:00,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 832 events. 514/832 cut-off events. For 2796/2796 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3246 event pairs, 83 based on Foata normal form. 1/833 useless extension candidates. Maximal degree in co-relation 3645. Up to 396 conditions per place. [2022-12-06 04:10:00,387 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 48 selfloop transitions, 5 changer transitions 42/95 dead transitions. [2022-12-06 04:10:00,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 95 transitions, 867 flow [2022-12-06 04:10:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:10:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:10:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-06 04:10:00,389 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2022-12-06 04:10:00,389 INFO L175 Difference]: Start difference. First operand has 70 places, 41 transitions, 322 flow. Second operand 6 states and 61 transitions. [2022-12-06 04:10:00,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 95 transitions, 867 flow [2022-12-06 04:10:00,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 706 flow, removed 33 selfloop flow, removed 15 redundant places. [2022-12-06 04:10:00,396 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 283 flow [2022-12-06 04:10:00,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2022-12-06 04:10:00,396 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 14 predicate places. [2022-12-06 04:10:00,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:00,397 INFO L89 Accepts]: Start accepts. Operand has 62 places, 43 transitions, 283 flow [2022-12-06 04:10:00,397 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:00,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:00,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 43 transitions, 283 flow [2022-12-06 04:10:00,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 43 transitions, 283 flow [2022-12-06 04:10:00,410 INFO L130 PetriNetUnfolder]: 44/113 cut-off events. [2022-12-06 04:10:00,410 INFO L131 PetriNetUnfolder]: For 288/302 co-relation queries the response was YES. [2022-12-06 04:10:00,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 113 events. 44/113 cut-off events. For 288/302 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 405 event pairs, 0 based on Foata normal form. 7/113 useless extension candidates. Maximal degree in co-relation 354. Up to 38 conditions per place. [2022-12-06 04:10:00,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 43 transitions, 283 flow [2022-12-06 04:10:00,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-06 04:10:00,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [381] L766-->L773: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_111 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd1~0_27 256))))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_97 256) 0)) .cse3)) (.cse1 (and .cse5 .cse4))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_97) v_~a$w_buff1_used~0_96) (= v_~a~0_62 (ite .cse0 v_~a$w_buff0~0_32 (ite .cse2 v_~a$w_buff1~0_31 v_~a~0_63))) (= v_~a$r_buff0_thd1~0_26 (ite .cse1 0 v_~a$r_buff0_thd1~0_27)) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_96 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd1~0_26 256) 0)))) 0 v_~a$r_buff1_thd1~0_18) v_~a$r_buff1_thd1~0_17)))) InVars {~a~0=v_~a~0_63, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_97} OutVars{~a~0=v_~a~0_62, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_96} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [395] L806-->L813: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_119 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_120 256) 0)))) (.cse4 (and .cse3 .cse5)) (.cse1 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a~0_68 (ite .cse0 v_~a$w_buff0~0_36 (ite .cse1 v_~a$w_buff1~0_33 v_~a~0_69))) (= (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_102 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_18) v_~a$r_buff1_thd3~0_17) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite .cse0 0 v_~a$w_buff0_used~0_120) v_~a$w_buff0_used~0_119) (= v_~a$w_buff1_used~0_102 (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_103))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_120, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_68, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_119, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0] [2022-12-06 04:10:00,993 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [381] L766-->L773: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_111 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd1~0_27 256))))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_97 256) 0)) .cse3)) (.cse1 (and .cse5 .cse4))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_97) v_~a$w_buff1_used~0_96) (= v_~a~0_62 (ite .cse0 v_~a$w_buff0~0_32 (ite .cse2 v_~a$w_buff1~0_31 v_~a~0_63))) (= v_~a$r_buff0_thd1~0_26 (ite .cse1 0 v_~a$r_buff0_thd1~0_27)) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_96 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd1~0_26 256) 0)))) 0 v_~a$r_buff1_thd1~0_18) v_~a$r_buff1_thd1~0_17)))) InVars {~a~0=v_~a~0_63, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_97} OutVars{~a~0=v_~a~0_62, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_96} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [388] L786-->L793: Formula: (let ((.cse5 (not (= (mod v_~a$r_buff0_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_131 256) 0))) (.cse0 (not (= (mod v_~a$r_buff1_thd2~0_18 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_113 256) 0)) .cse0)) (.cse2 (and .cse5 .cse1)) (.cse4 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_132 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~a$w_buff1_used~0_112 256)))) (and (not (= (mod v_~a$r_buff0_thd2~0_19 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_18) v_~a$r_buff1_thd2~0_17) (= (ite (or .cse2 .cse3) 0 v_~a$w_buff1_used~0_113) v_~a$w_buff1_used~0_112) (= v_~a~0_76 (ite .cse4 v_~a$w_buff0~0_44 (ite .cse3 v_~a$w_buff1~0_39 v_~a~0_77))) (= v_~a$r_buff0_thd2~0_19 (ite .cse2 0 v_~a$r_buff0_thd2~0_20)) (= (ite .cse4 0 v_~a$w_buff0_used~0_132) v_~a$w_buff0_used~0_131)))) InVars {~a~0=v_~a~0_77, ~a$w_buff1~0=v_~a$w_buff1~0_39, ~a$w_buff0~0=v_~a$w_buff0~0_44, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_132, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_113} OutVars{~a~0=v_~a~0_76, ~a$w_buff1~0=v_~a$w_buff1~0_39, ~a$w_buff0~0=v_~a$w_buff0~0_44, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_131, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_112} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0] [2022-12-06 04:10:01,152 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [532] $Ultimate##0-->L766: Formula: (and (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_83| |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_83|) (= v_~a$r_buff0_thd2~0_156 v_~a$r_buff1_thd2~0_156) (not (= |v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_83| 0)) (= v_~a$w_buff0_used~0_592 v_~a$w_buff1_used~0_504) (= v_~x~0_48 v_~__unbuffered_p0_EAX~0_70) (= v_~a$r_buff0_thd4~0_262 v_~a$r_buff1_thd4~0_264) (= |v_P0Thread1of1ForFork0_#in~arg#1.offset_79| |v_P0Thread1of1ForFork0_~arg#1.offset_79|) (= v_~a$r_buff0_thd1~0_229 1) (= |v_P0Thread1of1ForFork0_~arg#1.base_79| |v_P0Thread1of1ForFork0_#in~arg#1.base_79|) (= v_~a$w_buff0~0_333 v_~a$w_buff1~0_273) (= v_~a$w_buff0~0_332 1) (= v_~a$r_buff0_thd1~0_230 v_~a$r_buff1_thd1~0_141) (= v_~a$w_buff0_used~0_591 1) (= v_~a$r_buff0_thd0~0_170 v_~a$r_buff1_thd0~0_176) (= (ite (not (and (not (= (mod v_~a$w_buff0_used~0_591 256) 0)) (not (= (mod v_~a$w_buff1_used~0_504 256) 0)))) 1 0) |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_83|) (= v_~a$r_buff0_thd3~0_197 v_~a$r_buff1_thd3~0_202)) InVars {P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_79|, ~a$w_buff0~0=v_~a$w_buff0~0_333, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_156, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_197, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_592, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_79|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_230, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_170, ~x~0=v_~x~0_48, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_262} OutVars{P0Thread1of1ForFork0_#in~arg#1.base=|v_P0Thread1of1ForFork0_#in~arg#1.base_79|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_264, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_141, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_202, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_156, P0Thread1of1ForFork0_~arg#1.base=|v_P0Thread1of1ForFork0_~arg#1.base_79|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_197, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_591, P0Thread1of1ForFork0_#in~arg#1.offset=|v_P0Thread1of1ForFork0_#in~arg#1.offset_79|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_229, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_170, P0Thread1of1ForFork0_~arg#1.offset=|v_P0Thread1of1ForFork0_~arg#1.offset_79|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_262, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ~a$w_buff1~0=v_~a$w_buff1~0_273, ~a$w_buff0~0=v_~a$w_buff0~0_332, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_83|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_176, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_504, ~x~0=v_~x~0_48, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork0___VERIFIER_assert_~expression#1_83|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork0_~arg#1.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression#1] and [538] $Ultimate##0-->L793: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_677 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd2~0_188 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_188 256) 0)))) (let ((.cse1 (and (not (= (mod v_~a$w_buff0_used~0_678 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_584 256) 0)))) (.cse0 (and .cse5 .cse4))) (and (= (ite .cse0 0 v_~a$r_buff0_thd2~0_188) v_~a$r_buff0_thd2~0_187) (= |v_P1Thread1of1ForFork2_#in~arg.offset_17| v_P1Thread1of1ForFork2_~arg.offset_17) (= (ite .cse1 0 v_~a$w_buff0_used~0_678) v_~a$w_buff0_used~0_677) (= v_~a~0_517 (ite .cse1 v_~a$w_buff0~0_380 (ite .cse2 v_~a$w_buff1~0_313 v_~a~0_518))) (= v_~y~0_98 1) (= v_~x~0_52 1) (= |v_P1Thread1of1ForFork2_#in~arg.base_17| v_P1Thread1of1ForFork2_~arg.base_17) (= (ite (or .cse2 .cse0) 0 v_~a$w_buff1_used~0_584) v_~a$w_buff1_used~0_583) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_583 256) 0))) (and (not (= (mod v_~a$r_buff0_thd2~0_187 256) 0)) .cse4)) 0 v_~a$r_buff1_thd2~0_188) v_~a$r_buff1_thd2~0_187)))) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, ~a~0=v_~a~0_518, ~a$w_buff1~0=v_~a$w_buff1~0_313, ~a$w_buff0~0=v_~a$w_buff0~0_380, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_188, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_188, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_678, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_584} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_17, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_187, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_187, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_677, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_17|, ~a~0=v_~a~0_517, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_17, ~a$w_buff1~0=v_~a$w_buff1~0_313, ~a$w_buff0~0=v_~a$w_buff0~0_380, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_17|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_583, ~y~0=v_~y~0_98, ~x~0=v_~x~0_52} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0, ~y~0, ~x~0] [2022-12-06 04:10:01,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [381] L766-->L773: Formula: (let ((.cse4 (not (= (mod v_~a$w_buff0_used~0_111 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd1~0_27 256))))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~a$w_buff1_used~0_97 256) 0)) .cse3)) (.cse1 (and .cse5 .cse4))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse1 .cse2) 0 v_~a$w_buff1_used~0_97) v_~a$w_buff1_used~0_96) (= v_~a~0_62 (ite .cse0 v_~a$w_buff0~0_32 (ite .cse2 v_~a$w_buff1~0_31 v_~a~0_63))) (= v_~a$r_buff0_thd1~0_26 (ite .cse1 0 v_~a$r_buff0_thd1~0_27)) (= (ite (or (and .cse3 (not (= (mod v_~a$w_buff1_used~0_96 256) 0))) (and .cse4 (not (= (mod v_~a$r_buff0_thd1~0_26 256) 0)))) 0 v_~a$r_buff1_thd1~0_18) v_~a$r_buff1_thd1~0_17)))) InVars {~a~0=v_~a~0_63, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_97} OutVars{~a~0=v_~a~0_62, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_96} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [395] L806-->L813: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_119 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_120 256) 0)))) (.cse4 (and .cse3 .cse5)) (.cse1 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a~0_68 (ite .cse0 v_~a$w_buff0~0_36 (ite .cse1 v_~a$w_buff1~0_33 v_~a~0_69))) (= (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_102 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_18) v_~a$r_buff1_thd3~0_17) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite .cse0 0 v_~a$w_buff0_used~0_120) v_~a$w_buff0_used~0_119) (= v_~a$w_buff1_used~0_102 (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_103))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_120, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_68, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_119, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0] [2022-12-06 04:10:01,551 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [542] L766-->L793: Formula: (let ((.cse14 (not (= (mod v_~a$r_buff0_thd1~0_271 256) 0)))) (let ((.cse11 (and (not (= (mod v_~a$w_buff0_used~0_749 256) 0)) .cse14))) (let ((.cse1 (ite .cse11 0 v_~a$w_buff0_used~0_749))) (let ((.cse9 (not (= (mod v_~a$r_buff1_thd1~0_168 256) 0))) (.cse7 (not (= (mod .cse1 256) 0)))) (let ((.cse10 (and .cse7 .cse14)) (.cse12 (and (not (= (mod v_~a$w_buff1_used~0_651 256) 0)) .cse9))) (let ((.cse4 (ite (or .cse10 .cse12) 0 v_~a$w_buff1_used~0_651))) (let ((.cse5 (not (= (mod v_~a$w_buff0_used~0_747 256) 0))) (.cse8 (not (= (mod .cse4 256) 0))) (.cse6 (not (= (mod v_~a$r_buff1_thd2~0_208 256) 0))) (.cse13 (not (= (mod v_~a$r_buff0_thd2~0_208 256) 0)))) (let ((.cse0 (and .cse13 .cse7)) (.cse3 (and .cse8 .cse6)) (.cse2 (and .cse13 .cse5))) (and (= (ite .cse0 0 .cse1) v_~a$w_buff0_used~0_747) (= (ite (or .cse2 .cse3) 0 .cse4) v_~a$w_buff1_used~0_649) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_207 256) 0)) .cse5) (and (not (= (mod v_~a$w_buff1_used~0_649 256) 0)) .cse6)) 0 v_~a$r_buff1_thd2~0_208) v_~a$r_buff1_thd2~0_207) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_270 256) 0)) .cse7) (and .cse8 .cse9)) 0 v_~a$r_buff1_thd1~0_168) v_~a$r_buff1_thd1~0_167) (= v_~a$r_buff0_thd1~0_270 (ite .cse10 0 v_~a$r_buff0_thd1~0_271)) (= (ite .cse0 v_~a$w_buff0~0_412 (ite .cse3 v_~a$w_buff1~0_339 (ite .cse11 v_~a$w_buff0~0_412 (ite .cse12 v_~a$w_buff1~0_339 v_~a~0_587)))) v_~a~0_585) (= v_~a$r_buff0_thd2~0_207 (ite .cse2 0 v_~a$r_buff0_thd2~0_208))))))))))) InVars {~a~0=v_~a~0_587, ~a$w_buff1~0=v_~a$w_buff1~0_339, ~a$w_buff0~0=v_~a$w_buff0~0_412, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_168, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_208, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_208, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_749, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_271, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_651} OutVars{~a~0=v_~a~0_585, ~a$w_buff1~0=v_~a$w_buff1~0_339, ~a$w_buff0~0=v_~a$w_buff0~0_412, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_167, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_207, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_207, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_747, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_270, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_649} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [395] L806-->L813: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_119 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_120 256) 0)))) (.cse4 (and .cse3 .cse5)) (.cse1 (and .cse2 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a~0_68 (ite .cse0 v_~a$w_buff0~0_36 (ite .cse1 v_~a$w_buff1~0_33 v_~a~0_69))) (= (ite (or (and .cse2 (not (= (mod v_~a$w_buff1_used~0_102 256) 0))) (and (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)) .cse3)) 0 v_~a$r_buff1_thd3~0_18) v_~a$r_buff1_thd3~0_17) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite .cse0 0 v_~a$w_buff0_used~0_120) v_~a$w_buff0_used~0_119) (= v_~a$w_buff1_used~0_102 (ite (or .cse4 .cse1) 0 v_~a$w_buff1_used~0_103))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_120, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_68, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_119, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0] [2022-12-06 04:10:01,826 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:10:01,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1430 [2022-12-06 04:10:01,827 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 307 flow [2022-12-06 04:10:01,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:01,827 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:01,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:01,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:10:01,828 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:01,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash 165549381, now seen corresponding path program 1 times [2022-12-06 04:10:01,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:01,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870222941] [2022-12-06 04:10:01,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:01,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:10:01,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:10:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:10:01,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:10:01,962 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:10:01,963 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:10:01,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:10:01,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:10:01,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:10:01,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:10:01,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:10:01,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:10:01,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:10:01,965 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:01,970 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:10:01,970 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:10:02,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:10:02 BasicIcfg [2022-12-06 04:10:02,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:10:02,056 INFO L158 Benchmark]: Toolchain (without parser) took 33821.78ms. Allocated memory was 184.5MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 159.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 599.6MB. Max. memory is 8.0GB. [2022-12-06 04:10:02,056 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:10:02,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.40ms. Allocated memory is still 184.5MB. Free memory was 159.6MB in the beginning and 131.4MB in the end (delta: 28.2MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:10:02,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.19ms. Allocated memory is still 184.5MB. Free memory was 131.4MB in the beginning and 128.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:10:02,056 INFO L158 Benchmark]: Boogie Preprocessor took 38.61ms. Allocated memory is still 184.5MB. Free memory was 128.8MB in the beginning and 162.6MB in the end (delta: -33.9MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. [2022-12-06 04:10:02,056 INFO L158 Benchmark]: RCFGBuilder took 702.67ms. Allocated memory is still 184.5MB. Free memory was 162.4MB in the beginning and 125.4MB in the end (delta: 37.0MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-06 04:10:02,057 INFO L158 Benchmark]: TraceAbstraction took 32464.35ms. Allocated memory was 184.5MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 124.9MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 563.3MB. Max. memory is 8.0GB. [2022-12-06 04:10:02,058 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 127.9MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 558.40ms. Allocated memory is still 184.5MB. Free memory was 159.6MB in the beginning and 131.4MB in the end (delta: 28.2MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.19ms. Allocated memory is still 184.5MB. Free memory was 131.4MB in the beginning and 128.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.61ms. Allocated memory is still 184.5MB. Free memory was 128.8MB in the beginning and 162.6MB in the end (delta: -33.9MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. * RCFGBuilder took 702.67ms. Allocated memory is still 184.5MB. Free memory was 162.4MB in the beginning and 125.4MB in the end (delta: 37.0MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 32464.35ms. Allocated memory was 184.5MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 124.9MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 563.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 138 PlacesBefore, 48 PlacesAfterwards, 127 TransitionsBefore, 36 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2105, independent: 2032, independent conditional: 2032, independent unconditional: 0, dependent: 73, dependent conditional: 73, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2105, independent: 2032, independent conditional: 0, independent unconditional: 2032, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2105, independent: 2032, independent conditional: 0, independent unconditional: 2032, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2105, independent: 2032, independent conditional: 0, independent unconditional: 2032, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1795, independent: 1748, independent conditional: 0, independent unconditional: 1748, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1795, independent: 1735, independent conditional: 0, independent unconditional: 1735, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 234, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2105, independent: 284, independent conditional: 0, independent unconditional: 284, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 1795, unknown conditional: 0, unknown unconditional: 1795] , Statistics on independence cache: Total cache size (in pairs): 2571, Positive cache size: 2524, Positive conditional cache size: 0, Positive unconditional cache size: 2524, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 149, independent conditional: 149, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 179, independent: 149, independent conditional: 20, independent unconditional: 129, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 179, independent: 149, independent conditional: 20, independent unconditional: 129, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 179, independent: 149, independent conditional: 20, independent unconditional: 129, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 168, independent: 143, independent conditional: 19, independent unconditional: 124, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 168, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 99, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 94, dependent conditional: 54, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 168, unknown conditional: 29, unknown unconditional: 139] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 143, Positive conditional cache size: 19, Positive unconditional cache size: 124, Negative cache size: 25, Negative conditional cache size: 10, Negative unconditional cache size: 15, 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.1s, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, independent: 113, independent conditional: 113, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 133, independent: 113, independent conditional: 13, independent unconditional: 100, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 133, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 133, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 133, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 158, Positive conditional cache size: 19, Positive unconditional cache size: 139, Negative cache size: 31, Negative conditional cache size: 10, Negative unconditional cache size: 21, 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, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, independent: 136, independent conditional: 136, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 162, independent: 136, independent conditional: 15, independent unconditional: 121, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 162, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 162, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 164, Positive conditional cache size: 19, Positive unconditional cache size: 145, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, 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, 49 PlacesBefore, 49 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 636 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 222, independent: 187, independent conditional: 187, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 222, independent: 187, independent conditional: 34, independent unconditional: 153, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 222, independent: 187, independent conditional: 0, independent unconditional: 187, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222, independent: 187, independent conditional: 0, independent unconditional: 187, dependent: 35, dependent conditional: 0, dependent unconditional: 35, 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: 222, independent: 187, independent conditional: 0, independent unconditional: 187, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 164, Positive conditional cache size: 19, Positive unconditional cache size: 145, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 143, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 143, independent: 110, independent conditional: 34, independent unconditional: 76, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 143, independent: 110, independent conditional: 6, independent unconditional: 104, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 143, independent: 110, independent conditional: 6, independent unconditional: 104, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 143, independent: 110, independent conditional: 6, independent unconditional: 104, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 164, Positive conditional cache size: 19, Positive unconditional cache size: 145, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 868 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 147, independent: 110, independent conditional: 35, independent unconditional: 75, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 147, independent: 110, independent conditional: 6, independent unconditional: 104, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 147, independent: 110, independent conditional: 6, independent unconditional: 104, dependent: 37, dependent conditional: 0, dependent unconditional: 37, 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: 147, independent: 110, independent conditional: 6, independent unconditional: 104, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 164, Positive conditional cache size: 19, Positive unconditional cache size: 145, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 884 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 236, independent: 168, independent conditional: 168, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 236, independent: 168, independent conditional: 34, independent unconditional: 134, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 236, independent: 168, independent conditional: 6, independent unconditional: 162, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 236, independent: 168, independent conditional: 6, independent unconditional: 162, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 236, independent: 162, independent conditional: 4, independent unconditional: 158, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 183, Positive conditional cache size: 22, Positive unconditional cache size: 161, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 814 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 181, independent: 129, independent conditional: 129, 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: 181, independent: 129, independent conditional: 29, independent unconditional: 100, 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: 181, independent: 129, independent conditional: 6, independent unconditional: 123, 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: 181, independent: 129, independent conditional: 6, independent unconditional: 123, 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: 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: 181, independent: 129, independent conditional: 6, independent unconditional: 123, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 196, Positive conditional cache size: 23, Positive unconditional cache size: 173, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 26, independent conditional: 26, 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: 34, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, 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: 12, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 206, Positive conditional cache size: 33, Positive unconditional cache size: 173, Negative cache size: 40, Negative conditional cache size: 12, Negative unconditional cache size: 28, 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.1s, 68 PlacesBefore, 68 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 982 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, independent: 71, independent conditional: 71, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 89, independent: 71, independent conditional: 63, independent unconditional: 8, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 89, independent: 71, independent conditional: 57, independent unconditional: 14, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 89, independent: 71, independent conditional: 57, independent unconditional: 14, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 89, independent: 65, independent conditional: 56, independent unconditional: 9, dependent: 18, dependent conditional: 10, dependent unconditional: 8, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 217, Positive conditional cache size: 34, Positive unconditional cache size: 183, Negative cache size: 40, Negative conditional cache size: 12, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 948 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 5, dependent conditional: 5, 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: 28, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 217, Positive conditional cache size: 34, Positive unconditional cache size: 183, Negative cache size: 40, Negative conditional cache size: 12, Negative unconditional cache size: 28, 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.2s, 77 PlacesBefore, 77 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 1032 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 73, independent: 63, independent conditional: 57, independent unconditional: 6, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, independent: 63, independent conditional: 51, independent unconditional: 12, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, independent: 63, independent conditional: 51, independent unconditional: 12, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 9, independent unconditional: 0, 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: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, independent: 54, independent conditional: 42, independent unconditional: 12, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 231, Positive conditional cache size: 43, Positive unconditional cache size: 188, Negative cache size: 42, Negative conditional cache size: 14, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 76 PlacesBefore, 70 PlacesAfterwards, 47 TransitionsBefore, 41 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 167, independent: 157, independent conditional: 157, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 167, independent: 157, independent conditional: 142, independent unconditional: 15, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 157, independent conditional: 127, independent unconditional: 30, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 157, independent conditional: 127, independent unconditional: 30, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 24, independent conditional: 14, independent unconditional: 10, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 187, independent: 133, independent conditional: 113, independent unconditional: 20, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 28, unknown conditional: 18, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 368, Positive cache size: 322, Positive conditional cache size: 67, Positive unconditional cache size: 255, Negative cache size: 46, Negative conditional cache size: 18, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 60 PlacesBefore, 58 PlacesAfterwards, 43 TransitionsBefore, 41 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 265, independent: 250, independent conditional: 250, 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: 265, independent: 250, independent conditional: 250, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 293, independent: 250, independent conditional: 226, independent unconditional: 24, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 293, independent: 250, independent conditional: 226, independent unconditional: 24, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, independent: 43, independent conditional: 40, independent unconditional: 3, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 161, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 293, independent: 207, independent conditional: 186, independent unconditional: 21, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 46, unknown conditional: 43, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 491, Positive cache size: 442, Positive conditional cache size: 117, Positive unconditional cache size: 325, Negative cache size: 49, Negative conditional cache size: 21, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t521; [L867] FCALL, FORK 0 pthread_create(&t521, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t521, ((void *)0), P0, ((void *)0))=-1, t521={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t522; [L869] FCALL, FORK 0 pthread_create(&t522, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t522, ((void *)0), P1, ((void *)0))=0, t521={5:0}, t522={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t523; [L871] FCALL, FORK 0 pthread_create(&t523, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t523, ((void *)0), P2, ((void *)0))=1, t521={5:0}, t522={6:0}, t523={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t524; [L873] FCALL, FORK 0 pthread_create(&t524, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t524, ((void *)0), P3, ((void *)0))=2, t521={5:0}, t522={6:0}, t523={7:0}, t524={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 [L765] 1 __unbuffered_p0_EAX = x [L782] 1 x = 1 [L785] 1 y = 1 [L788] 1 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 1 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 1 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L802] 3 y = 2 [L805] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=0] [L822] 4 z = 1 [L825] 4 __unbuffered_p3_EAX = z [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 873]: 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: 869]: 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: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 168 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 561 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 561 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1651 IncrementalHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 25 mSDtfsCounter, 1651 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=12, InterpolantAutomatonStates: 65, 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.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1847 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:10:02,099 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...