/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/mix032.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:13:08,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:13:08,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:13:08,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:13:08,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:13:08,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:13:08,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:13:08,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:13:08,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:13:08,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:13:08,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:13:08,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:13:08,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:13:08,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:13:08,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:13:08,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:13:08,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:13:08,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:13:08,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:13:08,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:13:08,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:13:08,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:13:08,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:13:08,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:13:08,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:13:08,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:13:08,476 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:13:08,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:13:08,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:13:08,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:13:08,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:13:08,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:13:08,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:13:08,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:13:08,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:13:08,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:13:08,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:13:08,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:13:08,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:13:08,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:13:08,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:13:08,491 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:13:08,528 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:13:08,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:13:08,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:13:08,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:13:08,538 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:13:08,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:13:08,539 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:13:08,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:13:08,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:13:08,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:13:08,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:13:08,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:13:08,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:13:08,540 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:13:08,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:13:08,541 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:13:08,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:13:08,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:13:08,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:13:08,541 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:13:08,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:13:08,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:13:08,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:13:08,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:13:08,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:13:08,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:13:08,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:13:08,542 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:13:08,542 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:13:08,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:13:08,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:13:08,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:13:08,876 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:13:08,876 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:13:08,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032.oepc.i [2022-12-06 04:13:09,879 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:13:10,130 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:13:10,131 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.oepc.i [2022-12-06 04:13:10,147 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/612e78f72/f25afc000710436d9865d3aef55ec549/FLAG2e1d8286e [2022-12-06 04:13:10,162 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/612e78f72/f25afc000710436d9865d3aef55ec549 [2022-12-06 04:13:10,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:13:10,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:13:10,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:13:10,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:13:10,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:13:10,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:13:10" (1/1) ... [2022-12-06 04:13:10,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdc37a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:10, skipping insertion in model container [2022-12-06 04:13:10,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:13:10" (1/1) ... [2022-12-06 04:13:10,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:13:10,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:13:10,376 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/mix032.oepc.i[945,958] [2022-12-06 04:13:10,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:13:10,576 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:13:10,585 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/mix032.oepc.i[945,958] [2022-12-06 04:13:10,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:13:10,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:13:10,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:13:10,658 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:13:10,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:10 WrapperNode [2022-12-06 04:13:10,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:13:10,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:13:10,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:13:10,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:13:10,664 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:13:10" (1/1) ... [2022-12-06 04:13:10,691 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:13:10" (1/1) ... [2022-12-06 04:13:10,710 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-12-06 04:13:10,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:13:10,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:13:10,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:13:10,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:13:10,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:10" (1/1) ... [2022-12-06 04:13:10,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:10" (1/1) ... [2022-12-06 04:13:10,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:10" (1/1) ... [2022-12-06 04:13:10,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:10" (1/1) ... [2022-12-06 04:13:10,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:10" (1/1) ... [2022-12-06 04:13:10,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:10" (1/1) ... [2022-12-06 04:13:10,737 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:10" (1/1) ... [2022-12-06 04:13:10,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:10" (1/1) ... [2022-12-06 04:13:10,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:13:10,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:13:10,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:13:10,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:13:10,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:10" (1/1) ... [2022-12-06 04:13:10,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:13:10,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:13:10,782 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:13:10,803 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:13:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:13:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:13:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:13:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:13:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:13:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:13:10,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:13:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:13:10,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:13:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:13:10,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:13:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:13:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:13:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:13:10,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:13:10,820 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:13:10,983 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:13:10,985 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:13:11,256 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:13:11,391 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:13:11,391 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:13:11,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:13:11 BoogieIcfgContainer [2022-12-06 04:13:11,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:13:11,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:13:11,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:13:11,398 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:13:11,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:13:10" (1/3) ... [2022-12-06 04:13:11,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7943f7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:13:11, skipping insertion in model container [2022-12-06 04:13:11,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:13:10" (2/3) ... [2022-12-06 04:13:11,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7943f7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:13:11, skipping insertion in model container [2022-12-06 04:13:11,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:13:11" (3/3) ... [2022-12-06 04:13:11,402 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.oepc.i [2022-12-06 04:13:11,416 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:13:11,416 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:13:11,416 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:13:11,456 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:13:11,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-12-06 04:13:11,540 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-12-06 04:13:11,540 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:11,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-06 04:13:11,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-12-06 04:13:11,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-12-06 04:13:11,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:11,568 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2022-12-06 04:13:11,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2022-12-06 04:13:11,598 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-12-06 04:13:11,598 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:11,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-06 04:13:11,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2022-12-06 04:13:11,602 INFO L188 LiptonReduction]: Number of co-enabled transitions 2308 [2022-12-06 04:13:15,929 INFO L203 LiptonReduction]: Total number of compositions: 89 [2022-12-06 04:13:15,941 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:13:15,945 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;@2d346ca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:13:15,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:13:15,948 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 04:13:15,948 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:15,948 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:15,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:13:15,949 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:13:15,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:15,952 INFO L85 PathProgramCache]: Analyzing trace with hash 495265, now seen corresponding path program 1 times [2022-12-06 04:13:15,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:15,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226743091] [2022-12-06 04:13:15,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:15,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:16,249 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:13:16,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:16,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226743091] [2022-12-06 04:13:16,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226743091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:16,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:16,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:13:16,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107765138] [2022-12-06 04:13:16,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:16,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:13:16,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:16,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:13:16,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:13:16,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 04:13:16,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 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:13:16,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:16,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 04:13:16,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:16,531 INFO L130 PetriNetUnfolder]: 1106/1689 cut-off events. [2022-12-06 04:13:16,531 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 04:13:16,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3383 conditions, 1689 events. 1106/1689 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8052 event pairs, 488 based on Foata normal form. 0/1498 useless extension candidates. Maximal degree in co-relation 3372. Up to 1336 conditions per place. [2022-12-06 04:13:16,562 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 31 selfloop transitions, 2 changer transitions 8/45 dead transitions. [2022-12-06 04:13:16,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 187 flow [2022-12-06 04:13:16,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:13:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:13:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-06 04:13:16,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2022-12-06 04:13:16,571 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 3 states and 58 transitions. [2022-12-06 04:13:16,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 187 flow [2022-12-06 04:13:16,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:13:16,574 INFO L231 Difference]: Finished difference. Result has 36 places, 23 transitions, 56 flow [2022-12-06 04:13:16,575 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2022-12-06 04:13:16,578 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2022-12-06 04:13:16,578 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:16,578 INFO L89 Accepts]: Start accepts. Operand has 36 places, 23 transitions, 56 flow [2022-12-06 04:13:16,580 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:16,580 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:16,581 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 56 flow [2022-12-06 04:13:16,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 56 flow [2022-12-06 04:13:16,585 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 04:13:16,585 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:16,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:13:16,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 56 flow [2022-12-06 04:13:16,586 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 04:13:16,683 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:13:16,685 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 04:13:16,685 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2022-12-06 04:13:16,685 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:13:16,685 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:16,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:16,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:13:16,688 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:13:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:16,688 INFO L85 PathProgramCache]: Analyzing trace with hash -959208235, now seen corresponding path program 1 times [2022-12-06 04:13:16,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:16,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201400650] [2022-12-06 04:13:16,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:16,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:16,915 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:13:16,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:16,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201400650] [2022-12-06 04:13:16,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201400650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:16,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:16,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:13:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776564494] [2022-12-06 04:13:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:16,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:13:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:16,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:13:16,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:13:16,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:13:16,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:16,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:16,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:13:16,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:17,176 INFO L130 PetriNetUnfolder]: 1679/2462 cut-off events. [2022-12-06 04:13:17,176 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-12-06 04:13:17,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5154 conditions, 2462 events. 1679/2462 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10329 event pairs, 759 based on Foata normal form. 8/2470 useless extension candidates. Maximal degree in co-relation 5144. Up to 2387 conditions per place. [2022-12-06 04:13:17,186 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-06 04:13:17,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 156 flow [2022-12-06 04:13:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:13:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:13:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-06 04:13:17,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2022-12-06 04:13:17,189 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 36 transitions. [2022-12-06 04:13:17,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 156 flow [2022-12-06 04:13:17,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:13:17,190 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 78 flow [2022-12-06 04:13:17,190 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-06 04:13:17,191 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -6 predicate places. [2022-12-06 04:13:17,191 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:17,191 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 78 flow [2022-12-06 04:13:17,191 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:17,191 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:17,191 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 78 flow [2022-12-06 04:13:17,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 78 flow [2022-12-06 04:13:17,199 INFO L130 PetriNetUnfolder]: 14/71 cut-off events. [2022-12-06 04:13:17,199 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:13:17,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 71 events. 14/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 237 event pairs, 6 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 104. Up to 29 conditions per place. [2022-12-06 04:13:17,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 78 flow [2022-12-06 04:13:17,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-06 04:13:17,239 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:13:17,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 04:13:17,240 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 78 flow [2022-12-06 04:13:17,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:17,241 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:17,241 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:17,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:13:17,241 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:13:17,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash 93749722, now seen corresponding path program 1 times [2022-12-06 04:13:17,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:17,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985367616] [2022-12-06 04:13:17,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:17,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:17,407 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:13:17,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:17,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985367616] [2022-12-06 04:13:17,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985367616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:17,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:17,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:13:17,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735373113] [2022-12-06 04:13:17,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:17,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:13:17,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:17,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:13:17,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:13:17,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:13:17,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 78 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:13:17,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:17,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:13:17,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:17,646 INFO L130 PetriNetUnfolder]: 1545/2276 cut-off events. [2022-12-06 04:13:17,647 INFO L131 PetriNetUnfolder]: For 370/370 co-relation queries the response was YES. [2022-12-06 04:13:17,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5151 conditions, 2276 events. 1545/2276 cut-off events. For 370/370 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9608 event pairs, 529 based on Foata normal form. 52/2328 useless extension candidates. Maximal degree in co-relation 5140. Up to 1707 conditions per place. [2022-12-06 04:13:17,660 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 36 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2022-12-06 04:13:17,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 188 flow [2022-12-06 04:13:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:13:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:13:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 04:13:17,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-06 04:13:17,662 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 78 flow. Second operand 3 states and 37 transitions. [2022-12-06 04:13:17,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 188 flow [2022-12-06 04:13:17,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:13:17,664 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 85 flow [2022-12-06 04:13:17,664 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-06 04:13:17,665 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2022-12-06 04:13:17,665 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:17,665 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 85 flow [2022-12-06 04:13:17,666 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:17,666 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:17,666 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 85 flow [2022-12-06 04:13:17,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 85 flow [2022-12-06 04:13:17,671 INFO L130 PetriNetUnfolder]: 9/54 cut-off events. [2022-12-06 04:13:17,671 INFO L131 PetriNetUnfolder]: For 7/13 co-relation queries the response was YES. [2022-12-06 04:13:17,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 54 events. 9/54 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 166 event pairs, 3 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 88. Up to 21 conditions per place. [2022-12-06 04:13:17,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 85 flow [2022-12-06 04:13:17,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-06 04:13:17,675 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:13:17,675 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 04:13:17,676 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 85 flow [2022-12-06 04:13:17,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:13:17,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:17,676 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:17,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:13:17,676 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:13:17,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash -931978367, now seen corresponding path program 1 times [2022-12-06 04:13:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:17,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460553415] [2022-12-06 04:13:17,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:17,829 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:13:17,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:17,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460553415] [2022-12-06 04:13:17,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460553415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:17,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:17,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:13:17,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326754296] [2022-12-06 04:13:17,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:17,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:13:17,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:17,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:13:17,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:13:17,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 04:13:17,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 85 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:13:17,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:17,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 04:13:17,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:18,057 INFO L130 PetriNetUnfolder]: 1443/2134 cut-off events. [2022-12-06 04:13:18,057 INFO L131 PetriNetUnfolder]: For 709/709 co-relation queries the response was YES. [2022-12-06 04:13:18,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5035 conditions, 2134 events. 1443/2134 cut-off events. For 709/709 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8611 event pairs, 459 based on Foata normal form. 40/2174 useless extension candidates. Maximal degree in co-relation 5022. Up to 1453 conditions per place. [2022-12-06 04:13:18,066 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 34 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-06 04:13:18,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 188 flow [2022-12-06 04:13:18,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:13:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:13:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 04:13:18,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2022-12-06 04:13:18,068 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 85 flow. Second operand 3 states and 35 transitions. [2022-12-06 04:13:18,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 188 flow [2022-12-06 04:13:18,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:13:18,070 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 90 flow [2022-12-06 04:13:18,071 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-06 04:13:18,072 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2022-12-06 04:13:18,072 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:18,072 INFO L89 Accepts]: Start accepts. Operand has 36 places, 26 transitions, 90 flow [2022-12-06 04:13:18,074 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:18,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:18,074 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 90 flow [2022-12-06 04:13:18,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 90 flow [2022-12-06 04:13:18,078 INFO L130 PetriNetUnfolder]: 6/46 cut-off events. [2022-12-06 04:13:18,078 INFO L131 PetriNetUnfolder]: For 8/16 co-relation queries the response was YES. [2022-12-06 04:13:18,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 46 events. 6/46 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 128 event pairs, 1 based on Foata normal form. 1/46 useless extension candidates. Maximal degree in co-relation 79. Up to 16 conditions per place. [2022-12-06 04:13:18,079 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 90 flow [2022-12-06 04:13:18,079 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-06 04:13:18,081 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:13:18,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 04:13:18,085 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 90 flow [2022-12-06 04:13:18,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:13:18,086 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:18,086 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:18,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:13:18,086 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:13:18,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:18,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1213889256, now seen corresponding path program 1 times [2022-12-06 04:13:18,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:18,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025900936] [2022-12-06 04:13:18,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:18,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:18,242 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:13:18,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:18,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025900936] [2022-12-06 04:13:18,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025900936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:18,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:18,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:13:18,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383033047] [2022-12-06 04:13:18,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:18,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:13:18,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:18,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:13:18,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:13:18,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-06 04:13:18,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:13:18,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:18,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-06 04:13:18,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:18,444 INFO L130 PetriNetUnfolder]: 602/1049 cut-off events. [2022-12-06 04:13:18,444 INFO L131 PetriNetUnfolder]: For 129/143 co-relation queries the response was YES. [2022-12-06 04:13:18,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2294 conditions, 1049 events. 602/1049 cut-off events. For 129/143 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5385 event pairs, 181 based on Foata normal form. 108/1120 useless extension candidates. Maximal degree in co-relation 2280. Up to 384 conditions per place. [2022-12-06 04:13:18,448 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 39 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2022-12-06 04:13:18,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 51 transitions, 232 flow [2022-12-06 04:13:18,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:13:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:13:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 04:13:18,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2022-12-06 04:13:18,450 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 90 flow. Second operand 4 states and 62 transitions. [2022-12-06 04:13:18,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 51 transitions, 232 flow [2022-12-06 04:13:18,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 51 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:13:18,453 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 122 flow [2022-12-06 04:13:18,453 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2022-12-06 04:13:18,455 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2022-12-06 04:13:18,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:18,455 INFO L89 Accepts]: Start accepts. Operand has 39 places, 30 transitions, 122 flow [2022-12-06 04:13:18,455 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:18,455 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:18,456 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 122 flow [2022-12-06 04:13:18,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 122 flow [2022-12-06 04:13:18,465 INFO L130 PetriNetUnfolder]: 35/122 cut-off events. [2022-12-06 04:13:18,465 INFO L131 PetriNetUnfolder]: For 50/64 co-relation queries the response was YES. [2022-12-06 04:13:18,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 122 events. 35/122 cut-off events. For 50/64 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 554 event pairs, 10 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 283. Up to 68 conditions per place. [2022-12-06 04:13:18,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 122 flow [2022-12-06 04:13:18,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-06 04:13:18,639 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:13:18,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 04:13:18,640 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 124 flow [2022-12-06 04:13:18,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:13:18,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:18,641 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:18,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:13:18,641 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:13:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1213442698, now seen corresponding path program 1 times [2022-12-06 04:13:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:18,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644677773] [2022-12-06 04:13:18,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:18,784 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:13:18,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:18,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644677773] [2022-12-06 04:13:18,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644677773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:18,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:18,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:13:18,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477189992] [2022-12-06 04:13:18,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:18,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:13:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:18,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:13:18,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:13:18,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2022-12-06 04:13:18,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:13:18,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:18,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2022-12-06 04:13:18,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:18,929 INFO L130 PetriNetUnfolder]: 297/578 cut-off events. [2022-12-06 04:13:18,929 INFO L131 PetriNetUnfolder]: For 217/218 co-relation queries the response was YES. [2022-12-06 04:13:18,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 578 events. 297/578 cut-off events. For 217/218 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2685 event pairs, 82 based on Foata normal form. 58/619 useless extension candidates. Maximal degree in co-relation 1575. Up to 238 conditions per place. [2022-12-06 04:13:18,934 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 48 selfloop transitions, 8 changer transitions 0/63 dead transitions. [2022-12-06 04:13:18,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 63 transitions, 319 flow [2022-12-06 04:13:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:13:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:13:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-06 04:13:18,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-06 04:13:18,937 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 124 flow. Second operand 5 states and 78 transitions. [2022-12-06 04:13:18,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 63 transitions, 319 flow [2022-12-06 04:13:18,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 63 transitions, 309 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:13:18,941 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 163 flow [2022-12-06 04:13:18,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-06 04:13:18,943 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2022-12-06 04:13:18,943 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:18,944 INFO L89 Accepts]: Start accepts. Operand has 43 places, 33 transitions, 163 flow [2022-12-06 04:13:18,944 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:18,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:18,944 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 163 flow [2022-12-06 04:13:18,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 163 flow [2022-12-06 04:13:18,952 INFO L130 PetriNetUnfolder]: 23/93 cut-off events. [2022-12-06 04:13:18,952 INFO L131 PetriNetUnfolder]: For 99/108 co-relation queries the response was YES. [2022-12-06 04:13:18,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 93 events. 23/93 cut-off events. For 99/108 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 361 event pairs, 2 based on Foata normal form. 4/93 useless extension candidates. Maximal degree in co-relation 262. Up to 43 conditions per place. [2022-12-06 04:13:18,953 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 163 flow [2022-12-06 04:13:18,953 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-06 04:13:19,168 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:13:19,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 226 [2022-12-06 04:13:19,169 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 167 flow [2022-12-06 04:13:19,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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:13:19,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:19,169 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:13:19,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:13:19,169 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:13:19,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:19,170 INFO L85 PathProgramCache]: Analyzing trace with hash -343457173, now seen corresponding path program 1 times [2022-12-06 04:13:19,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:19,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110051418] [2022-12-06 04:13:19,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:19,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:19,332 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:13:19,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:19,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110051418] [2022-12-06 04:13:19,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110051418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:19,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:19,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:13:19,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708426746] [2022-12-06 04:13:19,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:19,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:13:19,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:19,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:13:19,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:13:19,334 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2022-12-06 04:13:19,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:19,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:19,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2022-12-06 04:13:19,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:19,436 INFO L130 PetriNetUnfolder]: 202/405 cut-off events. [2022-12-06 04:13:19,437 INFO L131 PetriNetUnfolder]: For 357/357 co-relation queries the response was YES. [2022-12-06 04:13:19,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 405 events. 202/405 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1791 event pairs, 82 based on Foata normal form. 13/402 useless extension candidates. Maximal degree in co-relation 1179. Up to 155 conditions per place. [2022-12-06 04:13:19,439 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 35 selfloop transitions, 11 changer transitions 0/53 dead transitions. [2022-12-06 04:13:19,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 302 flow [2022-12-06 04:13:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:13:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:13:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-12-06 04:13:19,440 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:13:19,440 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 167 flow. Second operand 6 states and 72 transitions. [2022-12-06 04:13:19,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 302 flow [2022-12-06 04:13:19,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 265 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-06 04:13:19,442 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 165 flow [2022-12-06 04:13:19,443 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-06 04:13:19,443 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2022-12-06 04:13:19,443 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:19,443 INFO L89 Accepts]: Start accepts. Operand has 44 places, 33 transitions, 165 flow [2022-12-06 04:13:19,444 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:19,444 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:19,444 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 165 flow [2022-12-06 04:13:19,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 165 flow [2022-12-06 04:13:19,450 INFO L130 PetriNetUnfolder]: 14/65 cut-off events. [2022-12-06 04:13:19,450 INFO L131 PetriNetUnfolder]: For 77/79 co-relation queries the response was YES. [2022-12-06 04:13:19,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 65 events. 14/65 cut-off events. For 77/79 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 171 event pairs, 1 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 165. Up to 18 conditions per place. [2022-12-06 04:13:19,451 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 165 flow [2022-12-06 04:13:19,451 INFO L188 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-06 04:13:20,017 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [418] L838-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [478] L860-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~b$r_buff1_thd0~0_228 256) 0))) (.cse4 (not (= (mod v_~b$w_buff0_used~0_529 256) 0))) (.cse5 (not (= 0 (mod v_~b$r_buff0_thd0~0_225 256))))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_530 256) 0)))) (.cse2 (and (not (= (mod v_~b$w_buff1_used~0_481 256) 0)) .cse3))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87| (mod v_~main$tmp_guard0~0_128 256)) (= v_~main$tmp_guard0~0_128 (ite (= (ite (= v_~__unbuffered_cnt~0_195 3) 1 0) 0) 0 1)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_80 1) (= v_~__unbuffered_p0_EAX~0_86 0) (= v_~__unbuffered_p1_EBX~0_92 0) (= v_~__unbuffered_p1_EAX~0_82 1) (= v_~__unbuffered_p2_EBX~0_114 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_88) (= (ite .cse0 0 v_~b$r_buff0_thd0~0_225) v_~b$r_buff0_thd0~0_224) (= (ite .cse1 0 v_~b$w_buff0_used~0_530) v_~b$w_buff0_used~0_529) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|) (= (ite (or .cse0 .cse2) 0 v_~b$w_buff1_used~0_481) v_~b$w_buff1_used~0_480) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= v_~b~0_404 (ite .cse1 v_~b$w_buff0~0_301 (ite .cse2 v_~b$w_buff1~0_258 v_~b~0_405))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= v_~b$r_buff1_thd0~0_227 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_480 256) 0)) .cse3) (and (not (= (mod v_~b$r_buff0_thd0~0_224 256) 0)) .cse4)) 0 v_~b$r_buff1_thd0~0_228)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| 0)) (= (mod v_~main$tmp_guard1~0_88 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|)))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_114, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_228, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_530, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_481, ~b~0=v_~b~0_405, ~b$w_buff1~0=v_~b$w_buff1~0_258, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~b$w_buff0~0=v_~b$w_buff0~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_225} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_114, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_227, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_71|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_529, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_480, ~b~0=v_~b~0_404, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_91|, ~b$w_buff1~0=v_~b$w_buff1~0_258, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~b$w_buff0~0=v_~b$w_buff0~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_224, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~b$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~b$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~b$w_buff1_used~0, ~b~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~b$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:13:20,203 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [433] L799-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P1Thread1of1ForFork2_#res.base_15| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_15|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_15|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [478] L860-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~b$r_buff1_thd0~0_228 256) 0))) (.cse4 (not (= (mod v_~b$w_buff0_used~0_529 256) 0))) (.cse5 (not (= 0 (mod v_~b$r_buff0_thd0~0_225 256))))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_530 256) 0)))) (.cse2 (and (not (= (mod v_~b$w_buff1_used~0_481 256) 0)) .cse3))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87| (mod v_~main$tmp_guard0~0_128 256)) (= v_~main$tmp_guard0~0_128 (ite (= (ite (= v_~__unbuffered_cnt~0_195 3) 1 0) 0) 0 1)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_80 1) (= v_~__unbuffered_p0_EAX~0_86 0) (= v_~__unbuffered_p1_EBX~0_92 0) (= v_~__unbuffered_p1_EAX~0_82 1) (= v_~__unbuffered_p2_EBX~0_114 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_88) (= (ite .cse0 0 v_~b$r_buff0_thd0~0_225) v_~b$r_buff0_thd0~0_224) (= (ite .cse1 0 v_~b$w_buff0_used~0_530) v_~b$w_buff0_used~0_529) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|) (= (ite (or .cse0 .cse2) 0 v_~b$w_buff1_used~0_481) v_~b$w_buff1_used~0_480) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= v_~b~0_404 (ite .cse1 v_~b$w_buff0~0_301 (ite .cse2 v_~b$w_buff1~0_258 v_~b~0_405))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= v_~b$r_buff1_thd0~0_227 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_480 256) 0)) .cse3) (and (not (= (mod v_~b$r_buff0_thd0~0_224 256) 0)) .cse4)) 0 v_~b$r_buff1_thd0~0_228)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| 0)) (= (mod v_~main$tmp_guard1~0_88 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|)))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_114, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_228, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_530, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_481, ~b~0=v_~b~0_405, ~b$w_buff1~0=v_~b$w_buff1~0_258, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~b$w_buff0~0=v_~b$w_buff0~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_225} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_114, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_227, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_71|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_529, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_480, ~b~0=v_~b~0_404, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_91|, ~b$w_buff1~0=v_~b$w_buff1~0_258, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~b$w_buff0~0=v_~b$w_buff0~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_224, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~b$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~b$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~b$w_buff1_used~0, ~b~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~b$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:13:20,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [457] L773-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res#1.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_92 1) v_~__unbuffered_cnt~0_91) (= |v_P0Thread1of1ForFork1_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92} OutVars{P0Thread1of1ForFork1_#res#1.offset=|v_P0Thread1of1ForFork1_#res#1.offset_7|, P0Thread1of1ForFork1_#res#1.base=|v_P0Thread1of1ForFork1_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res#1.offset, P0Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0] and [478] L860-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~b$r_buff1_thd0~0_228 256) 0))) (.cse4 (not (= (mod v_~b$w_buff0_used~0_529 256) 0))) (.cse5 (not (= 0 (mod v_~b$r_buff0_thd0~0_225 256))))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_530 256) 0)))) (.cse2 (and (not (= (mod v_~b$w_buff1_used~0_481 256) 0)) .cse3))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87| (mod v_~main$tmp_guard0~0_128 256)) (= v_~main$tmp_guard0~0_128 (ite (= (ite (= v_~__unbuffered_cnt~0_195 3) 1 0) 0) 0 1)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_80 1) (= v_~__unbuffered_p0_EAX~0_86 0) (= v_~__unbuffered_p1_EBX~0_92 0) (= v_~__unbuffered_p1_EAX~0_82 1) (= v_~__unbuffered_p2_EBX~0_114 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_88) (= (ite .cse0 0 v_~b$r_buff0_thd0~0_225) v_~b$r_buff0_thd0~0_224) (= (ite .cse1 0 v_~b$w_buff0_used~0_530) v_~b$w_buff0_used~0_529) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|) (= (ite (or .cse0 .cse2) 0 v_~b$w_buff1_used~0_481) v_~b$w_buff1_used~0_480) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= v_~b~0_404 (ite .cse1 v_~b$w_buff0~0_301 (ite .cse2 v_~b$w_buff1~0_258 v_~b~0_405))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= v_~b$r_buff1_thd0~0_227 (ite (or (and (not (= (mod v_~b$w_buff1_used~0_480 256) 0)) .cse3) (and (not (= (mod v_~b$r_buff0_thd0~0_224 256) 0)) .cse4)) 0 v_~b$r_buff1_thd0~0_228)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| 0)) (= (mod v_~main$tmp_guard1~0_88 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|)))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_114, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_228, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_530, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_481, ~b~0=v_~b~0_405, ~b$w_buff1~0=v_~b$w_buff1~0_258, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~b$w_buff0~0=v_~b$w_buff0~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_225} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_92, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_114, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_227, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_61|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_71|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_529, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_82, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_480, ~b~0=v_~b~0_404, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_91|, ~b$w_buff1~0=v_~b$w_buff1~0_258, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~b$w_buff0~0=v_~b$w_buff0~0_301, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_195, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_224, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_87|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~b$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~b$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~b$w_buff1_used~0, ~b~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~b$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 04:13:20,609 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:13:20,609 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1166 [2022-12-06 04:13:20,609 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 165 flow [2022-12-06 04:13:20,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:20,610 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:20,610 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:13:20,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:13:20,610 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:13:20,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:20,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1952622688, now seen corresponding path program 1 times [2022-12-06 04:13:20,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:20,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944986078] [2022-12-06 04:13:20,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:20,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:20,789 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:13:20,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:20,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944986078] [2022-12-06 04:13:20,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944986078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:20,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:20,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:13:20,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010217549] [2022-12-06 04:13:20,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:20,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:13:20,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:20,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:13:20,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:13:20,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 04:13:20,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 165 flow. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:13:20,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:20,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 04:13:20,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:20,953 INFO L130 PetriNetUnfolder]: 464/789 cut-off events. [2022-12-06 04:13:20,953 INFO L131 PetriNetUnfolder]: For 837/837 co-relation queries the response was YES. [2022-12-06 04:13:20,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2336 conditions, 789 events. 464/789 cut-off events. For 837/837 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3215 event pairs, 32 based on Foata normal form. 3/792 useless extension candidates. Maximal degree in co-relation 2319. Up to 362 conditions per place. [2022-12-06 04:13:20,956 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 38 selfloop transitions, 4 changer transitions 22/64 dead transitions. [2022-12-06 04:13:20,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 428 flow [2022-12-06 04:13:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:13:20,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:13:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-06 04:13:20,959 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2022-12-06 04:13:20,959 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 165 flow. Second operand 6 states and 59 transitions. [2022-12-06 04:13:20,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 428 flow [2022-12-06 04:13:20,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 64 transitions, 334 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-12-06 04:13:20,964 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 113 flow [2022-12-06 04:13:20,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=113, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-06 04:13:20,965 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2022-12-06 04:13:20,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:20,966 INFO L89 Accepts]: Start accepts. Operand has 40 places, 28 transitions, 113 flow [2022-12-06 04:13:20,967 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:20,967 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:20,968 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 113 flow [2022-12-06 04:13:20,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 113 flow [2022-12-06 04:13:20,974 INFO L130 PetriNetUnfolder]: 11/57 cut-off events. [2022-12-06 04:13:20,975 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 04:13:20,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 57 events. 11/57 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 163 event pairs, 1 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 102. Up to 13 conditions per place. [2022-12-06 04:13:20,975 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 113 flow [2022-12-06 04:13:20,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 04:13:21,000 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:13:21,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 04:13:21,001 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 111 flow [2022-12-06 04:13:21,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:13:21,002 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:21,002 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:13:21,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:13:21,002 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:13:21,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:21,002 INFO L85 PathProgramCache]: Analyzing trace with hash 210925738, now seen corresponding path program 1 times [2022-12-06 04:13:21,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:21,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025494713] [2022-12-06 04:13:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:21,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:21,220 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:13:21,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:21,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025494713] [2022-12-06 04:13:21,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025494713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:21,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:21,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:13:21,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903153934] [2022-12-06 04:13:21,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:21,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:13:21,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:21,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:13:21,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:13:21,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 04:13:21,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 111 flow. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:21,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:21,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 04:13:21,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:21,379 INFO L130 PetriNetUnfolder]: 395/704 cut-off events. [2022-12-06 04:13:21,379 INFO L131 PetriNetUnfolder]: For 357/357 co-relation queries the response was YES. [2022-12-06 04:13:21,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1899 conditions, 704 events. 395/704 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3145 event pairs, 53 based on Foata normal form. 3/707 useless extension candidates. Maximal degree in co-relation 1884. Up to 369 conditions per place. [2022-12-06 04:13:21,381 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 30 selfloop transitions, 3 changer transitions 29/62 dead transitions. [2022-12-06 04:13:21,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 353 flow [2022-12-06 04:13:21,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:13:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:13:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-06 04:13:21,382 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2022-12-06 04:13:21,382 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 111 flow. Second operand 6 states and 57 transitions. [2022-12-06 04:13:21,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 353 flow [2022-12-06 04:13:21,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 343 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 04:13:21,385 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 105 flow [2022-12-06 04:13:21,385 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2022-12-06 04:13:21,386 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2022-12-06 04:13:21,386 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:21,386 INFO L89 Accepts]: Start accepts. Operand has 41 places, 25 transitions, 105 flow [2022-12-06 04:13:21,388 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:21,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:21,388 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 25 transitions, 105 flow [2022-12-06 04:13:21,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 25 transitions, 105 flow [2022-12-06 04:13:21,394 INFO L130 PetriNetUnfolder]: 7/36 cut-off events. [2022-12-06 04:13:21,394 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-06 04:13:21,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 36 events. 7/36 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 69. Up to 8 conditions per place. [2022-12-06 04:13:21,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 105 flow [2022-12-06 04:13:21,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-06 04:13:21,850 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:13:21,851 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 465 [2022-12-06 04:13:21,851 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 97 flow [2022-12-06 04:13:21,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:13:21,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:21,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:21,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:13:21,851 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:13:21,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:21,852 INFO L85 PathProgramCache]: Analyzing trace with hash -676564349, now seen corresponding path program 1 times [2022-12-06 04:13:21,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:21,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197864263] [2022-12-06 04:13:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:21,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:13:22,444 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:13:22,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:13:22,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197864263] [2022-12-06 04:13:22,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197864263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:13:22,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:13:22,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:13:22,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072762112] [2022-12-06 04:13:22,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:13:22,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:13:22,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:13:22,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:13:22,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:13:22,446 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 04:13:22,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 97 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:13:22,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:13:22,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 04:13:22,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:13:22,607 INFO L130 PetriNetUnfolder]: 104/211 cut-off events. [2022-12-06 04:13:22,607 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2022-12-06 04:13:22,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 211 events. 104/211 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 773 event pairs, 12 based on Foata normal form. 3/214 useless extension candidates. Maximal degree in co-relation 600. Up to 76 conditions per place. [2022-12-06 04:13:22,608 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 24 selfloop transitions, 3 changer transitions 25/52 dead transitions. [2022-12-06 04:13:22,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 312 flow [2022-12-06 04:13:22,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:13:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:13:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-12-06 04:13:22,609 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 04:13:22,609 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 97 flow. Second operand 7 states and 45 transitions. [2022-12-06 04:13:22,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 312 flow [2022-12-06 04:13:22,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 52 transitions, 302 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 04:13:22,611 INFO L231 Difference]: Finished difference. Result has 41 places, 21 transitions, 105 flow [2022-12-06 04:13:22,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=105, PETRI_PLACES=41, PETRI_TRANSITIONS=21} [2022-12-06 04:13:22,611 INFO L294 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2022-12-06 04:13:22,611 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:13:22,611 INFO L89 Accepts]: Start accepts. Operand has 41 places, 21 transitions, 105 flow [2022-12-06 04:13:22,612 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:13:22,612 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:13:22,612 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 21 transitions, 105 flow [2022-12-06 04:13:22,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 21 transitions, 105 flow [2022-12-06 04:13:22,616 INFO L130 PetriNetUnfolder]: 6/31 cut-off events. [2022-12-06 04:13:22,617 INFO L131 PetriNetUnfolder]: For 27/29 co-relation queries the response was YES. [2022-12-06 04:13:22,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 31 events. 6/31 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 71. Up to 8 conditions per place. [2022-12-06 04:13:22,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 21 transitions, 105 flow [2022-12-06 04:13:22,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 04:13:22,617 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:13:22,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:13:22,618 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 105 flow [2022-12-06 04:13:22,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:13:22,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:13:22,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:22,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:13:22,619 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:13:22,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:13:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1924730292, now seen corresponding path program 1 times [2022-12-06 04:13:22,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:13:22,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598224] [2022-12-06 04:13:22,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:13:22,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:13:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:13:22,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:13:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:13:22,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:13:22,694 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:13:22,695 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:13:22,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:13:22,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:13:22,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:13:22,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:13:22,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:13:22,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:13:22,713 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:13:22,717 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:13:22,717 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:13:22,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:13:22 BasicIcfg [2022-12-06 04:13:22,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:13:22,774 INFO L158 Benchmark]: Toolchain (without parser) took 12608.78ms. Allocated memory was 180.4MB in the beginning and 421.5MB in the end (delta: 241.2MB). Free memory was 155.0MB in the beginning and 203.1MB in the end (delta: -48.1MB). Peak memory consumption was 194.3MB. Max. memory is 8.0GB. [2022-12-06 04:13:22,774 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:13:22,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.97ms. Allocated memory is still 180.4MB. Free memory was 155.0MB in the beginning and 127.6MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:13:22,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.60ms. Allocated memory is still 180.4MB. Free memory was 127.6MB in the beginning and 125.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:13:22,774 INFO L158 Benchmark]: Boogie Preprocessor took 29.39ms. Allocated memory is still 180.4MB. Free memory was 124.9MB in the beginning and 123.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 04:13:22,775 INFO L158 Benchmark]: RCFGBuilder took 652.71ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 123.2MB in the beginning and 183.0MB in the end (delta: -59.8MB). Peak memory consumption was 30.8MB. Max. memory is 8.0GB. [2022-12-06 04:13:22,775 INFO L158 Benchmark]: TraceAbstraction took 11378.72ms. Allocated memory was 217.1MB in the beginning and 421.5MB in the end (delta: 204.5MB). Free memory was 182.5MB in the beginning and 203.1MB in the end (delta: -20.6MB). Peak memory consumption was 184.4MB. Max. memory is 8.0GB. [2022-12-06 04:13:22,776 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.11ms. Allocated memory is still 180.4MB. Free memory is still 158.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 492.97ms. Allocated memory is still 180.4MB. Free memory was 155.0MB in the beginning and 127.6MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.60ms. Allocated memory is still 180.4MB. Free memory was 127.6MB in the beginning and 125.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.39ms. Allocated memory is still 180.4MB. Free memory was 124.9MB in the beginning and 123.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 652.71ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 123.2MB in the beginning and 183.0MB in the end (delta: -59.8MB). Peak memory consumption was 30.8MB. Max. memory is 8.0GB. * TraceAbstraction took 11378.72ms. Allocated memory was 217.1MB in the beginning and 421.5MB in the end (delta: 204.5MB). Free memory was 182.5MB in the beginning and 203.1MB in the end (delta: -20.6MB). Peak memory consumption was 184.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 122 PlacesBefore, 39 PlacesAfterwards, 114 TransitionsBefore, 30 TransitionsAfterwards, 2308 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 44 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1665, independent: 1602, independent conditional: 1602, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1665, independent: 1602, independent conditional: 0, independent unconditional: 1602, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1665, independent: 1602, independent conditional: 0, independent unconditional: 1602, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1665, independent: 1602, independent conditional: 0, independent unconditional: 1602, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1357, independent: 1311, independent conditional: 0, independent unconditional: 1311, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1357, independent: 1294, independent conditional: 0, independent unconditional: 1294, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 266, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 248, dependent conditional: 0, dependent unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1665, independent: 291, independent conditional: 0, independent unconditional: 291, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1357, unknown conditional: 0, unknown unconditional: 1357] , Statistics on independence cache: Total cache size (in pairs): 2001, Positive cache size: 1955, Positive conditional cache size: 0, Positive unconditional cache size: 1955, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, 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, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 118, independent conditional: 118, 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: 144, independent: 118, independent conditional: 22, independent unconditional: 96, dependent: 26, dependent conditional: 5, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 144, independent: 118, independent conditional: 22, independent unconditional: 96, dependent: 26, dependent conditional: 5, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 144, independent: 118, independent conditional: 22, independent unconditional: 96, dependent: 26, dependent conditional: 5, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 126, independent: 104, independent conditional: 19, independent unconditional: 85, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 126, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 90, dependent conditional: 16, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, independent: 14, independent conditional: 3, independent unconditional: 11, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 126, unknown conditional: 23, unknown unconditional: 103] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 104, Positive conditional cache size: 19, Positive unconditional cache size: 85, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 136, independent: 115, independent conditional: 10, independent unconditional: 105, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 136, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 136, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 136, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 27, unknown conditional: 0, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 124, Positive conditional cache size: 19, Positive unconditional cache size: 105, Negative cache size: 29, Negative conditional cache size: 4, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 120, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 120, independent: 99, independent conditional: 15, independent unconditional: 84, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 127, Positive conditional cache size: 19, Positive unconditional cache size: 108, Negative cache size: 29, Negative conditional cache size: 4, Negative unconditional cache size: 25, 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, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 122, independent: 100, independent conditional: 100, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 122, independent: 100, independent conditional: 10, independent unconditional: 90, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 122, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 122, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 122, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 128, Positive conditional cache size: 19, Positive unconditional cache size: 109, Negative cache size: 29, Negative conditional cache size: 4, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 238, independent: 196, independent conditional: 196, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 238, independent: 196, independent conditional: 53, independent unconditional: 143, dependent: 42, dependent conditional: 8, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 238, independent: 196, independent conditional: 6, independent unconditional: 190, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 238, independent: 196, independent conditional: 6, independent unconditional: 190, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 238, independent: 189, independent conditional: 6, independent unconditional: 183, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 139, Positive conditional cache size: 19, Positive unconditional cache size: 120, Negative cache size: 33, Negative conditional cache size: 4, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 55, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 43 PlacesBefore, 43 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191, independent: 143, independent conditional: 143, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 191, independent: 143, independent conditional: 77, independent unconditional: 66, dependent: 48, dependent conditional: 35, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 195, independent: 143, independent conditional: 4, independent unconditional: 139, 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: 195, independent: 143, independent conditional: 4, independent unconditional: 139, 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: 25, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 195, independent: 129, independent conditional: 4, independent unconditional: 125, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 158, Positive conditional cache size: 19, Positive unconditional cache size: 139, Negative cache size: 44, Negative conditional cache size: 4, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 112, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 44 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 30 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 217, independent: 173, independent conditional: 173, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 217, independent: 173, independent conditional: 33, independent unconditional: 140, dependent: 44, dependent conditional: 4, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 217, independent: 173, independent conditional: 6, independent unconditional: 167, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 217, independent: 173, independent conditional: 6, independent unconditional: 167, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 217, independent: 173, independent conditional: 6, independent unconditional: 167, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 164, Positive conditional cache size: 19, Positive unconditional cache size: 145, Negative cache size: 48, Negative conditional cache size: 4, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 119, independent conditional: 119, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 155, independent: 119, independent conditional: 8, independent unconditional: 111, dependent: 36, dependent conditional: 4, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 119, independent conditional: 4, independent unconditional: 115, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 119, independent conditional: 4, independent unconditional: 115, dependent: 40, dependent conditional: 0, dependent unconditional: 40, 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: 159, independent: 119, independent conditional: 4, independent unconditional: 115, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 176, Positive conditional cache size: 21, Positive unconditional cache size: 155, Negative cache size: 48, Negative conditional cache size: 4, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 39 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 21 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 85, independent conditional: 85, 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: 111, independent: 85, independent conditional: 32, independent unconditional: 53, 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: 111, independent: 85, independent conditional: 32, independent unconditional: 53, 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: 111, independent: 85, independent conditional: 32, independent unconditional: 53, 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: 20, independent: 16, independent conditional: 10, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, independent: 69, independent conditional: 22, independent unconditional: 47, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 20, unknown conditional: 10, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 238, Positive conditional cache size: 37, Positive unconditional cache size: 201, Negative cache size: 52, Negative conditional cache size: 4, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 240, Positive conditional cache size: 39, Positive unconditional cache size: 201, Negative cache size: 52, Negative conditional cache size: 4, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool b$flush_delayed; [L725] 0 int b$mem_tmp; [L726] 0 _Bool b$r_buff0_thd0; [L727] 0 _Bool b$r_buff0_thd1; [L728] 0 _Bool b$r_buff0_thd2; [L729] 0 _Bool b$r_buff0_thd3; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$read_delayed; [L735] 0 int *b$read_delayed_var; [L736] 0 int b$w_buff0; [L737] 0 _Bool b$w_buff0_used; [L738] 0 int b$w_buff1; [L739] 0 _Bool b$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t849; [L856] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t849, ((void *)0), P0, ((void *)0))=-1, t849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t850; [L858] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t850, ((void *)0), P1, ((void *)0))=0, t849={5:0}, t850={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t851; [L860] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t851, ((void *)0), P2, ((void *)0))=1, t849={5:0}, t850={6:0}, t851={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 b$w_buff1 = b$w_buff0 [L754] 1 b$w_buff0 = 1 [L755] 1 b$w_buff1_used = b$w_buff0_used [L756] 1 b$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L758] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L759] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L760] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L761] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L762] 1 b$r_buff0_thd1 = (_Bool)1 [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 [L785] 2 y = 1 [L788] 2 __unbuffered_p1_EAX = y [L791] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L795] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L796] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L797] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L798] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L808] 3 z = 1 [L811] 3 a = 1 [L814] 3 __unbuffered_p2_EAX = a [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 b$flush_delayed = weak$$choice2 [L820] 3 b$mem_tmp = b [L821] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L822] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L823] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L824] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L825] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L827] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = b [L829] 3 b = b$flush_delayed ? b$mem_tmp : b [L830] 3 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L833] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L834] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L835] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L836] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L837] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L862] 1 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 1 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 1 !(!cond) [L864] RET 1 assume_abort_if_not(main$tmp_guard0) [L866] 1 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L867] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L868] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L869] 1 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L870] 1 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L873] 1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] CALL 1 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 1 !expression [L18] 1 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, 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: 860]: 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: 856]: 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: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 693 IncrementalHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 25 mSDtfsCounter, 693 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=6, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:13:22,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...