/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:57:27,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:57:27,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:57:27,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:57:27,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:57:27,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:57:27,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:57:27,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:57:27,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:57:27,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:57:27,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:57:27,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:57:27,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:57:27,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:57:27,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:57:27,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:57:27,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:57:27,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:57:27,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:57:27,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:57:27,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:57:27,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:57:27,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:57:27,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:57:27,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:57:27,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:57:27,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:57:27,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:57:27,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:57:27,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:57:27,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:57:27,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:57:27,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:57:27,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:57:27,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:57:27,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:57:27,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:57:27,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:57:27,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:57:27,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:57:27,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:57:27,497 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:57:27,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:57:27,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:57:27,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:57:27,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:57:27,519 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:57:27,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:57:27,519 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:57:27,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:57:27,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:57:27,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:57:27,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:57:27,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:57:27,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:57:27,520 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:57:27,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:57:27,521 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:57:27,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:57:27,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:57:27,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:57:27,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:57:27,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:57:27,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:57:27,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:57:27,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:57:27,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:57:27,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:57:27,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:57:27,522 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:57:27,522 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-13 11:57:27,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:57:27,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:57:27,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:57:27,930 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:57:27,930 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:57:27,931 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 11:57:28,978 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:57:29,214 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:57:29,215 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 11:57:29,230 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3f396736/a18c411115724ecba3ec4926ef349b72/FLAGbc73d8c48 [2022-12-13 11:57:29,245 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3f396736/a18c411115724ecba3ec4926ef349b72 [2022-12-13 11:57:29,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:57:29,247 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:57:29,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:57:29,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:57:29,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:57:29,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:57:29" (1/1) ... [2022-12-13 11:57:29,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@860d25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29, skipping insertion in model container [2022-12-13 11:57:29,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:57:29" (1/1) ... [2022-12-13 11:57:29,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:57:29,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:57:29,428 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-13 11:57:29,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:57:29,607 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:57:29,616 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-13 11:57:29,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:57:29,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:57:29,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:57:29,693 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:57:29,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29 WrapperNode [2022-12-13 11:57:29,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:57:29,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:57:29,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:57:29,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:57:29,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29" (1/1) ... [2022-12-13 11:57:29,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29" (1/1) ... [2022-12-13 11:57:29,728 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2022-12-13 11:57:29,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:57:29,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:57:29,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:57:29,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:57:29,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29" (1/1) ... [2022-12-13 11:57:29,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29" (1/1) ... [2022-12-13 11:57:29,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29" (1/1) ... [2022-12-13 11:57:29,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29" (1/1) ... [2022-12-13 11:57:29,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29" (1/1) ... [2022-12-13 11:57:29,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29" (1/1) ... [2022-12-13 11:57:29,745 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29" (1/1) ... [2022-12-13 11:57:29,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29" (1/1) ... [2022-12-13 11:57:29,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:57:29,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:57:29,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:57:29,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:57:29,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29" (1/1) ... [2022-12-13 11:57:29,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:57:29,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:57:29,807 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-13 11:57:29,809 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-13 11:57:29,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:57:29,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:57:29,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:57:29,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:57:29,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:57:29,842 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:57:29,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:57:29,843 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:57:29,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:57:29,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:57:29,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:57:29,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:57:29,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:57:29,844 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:57:29,991 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:57:29,992 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:57:30,201 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:57:30,278 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:57:30,278 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:57:30,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:57:30 BoogieIcfgContainer [2022-12-13 11:57:30,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:57:30,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:57:30,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:57:30,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:57:30,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:57:29" (1/3) ... [2022-12-13 11:57:30,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33251b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:57:30, skipping insertion in model container [2022-12-13 11:57:30,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:57:29" (2/3) ... [2022-12-13 11:57:30,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33251b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:57:30, skipping insertion in model container [2022-12-13 11:57:30,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:57:30" (3/3) ... [2022-12-13 11:57:30,287 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 11:57:30,299 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:57:30,299 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:57:30,299 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:57:30,337 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:57:30,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-13 11:57:30,414 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-13 11:57:30,415 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:30,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-13 11:57:30,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-13 11:57:30,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-13 11:57:30,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:30,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-13 11:57:30,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-13 11:57:30,469 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-13 11:57:30,469 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:30,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-13 11:57:30,472 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-13 11:57:30,472 INFO L226 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-13 11:57:36,255 INFO L241 LiptonReduction]: Total number of compositions: 73 [2022-12-13 11:57:36,266 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:57:36,271 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;@2d3e5c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:57:36,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 11:57:36,274 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 11:57:36,275 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:36,275 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:36,275 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 11:57:36,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash 407338180, now seen corresponding path program 1 times [2022-12-13 11:57:36,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:36,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366297899] [2022-12-13 11:57:36,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:36,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:36,607 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-13 11:57:36,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:36,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366297899] [2022-12-13 11:57:36,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366297899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:36,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:36,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:57:36,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930868164] [2022-12-13 11:57:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:36,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:57:36,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:36,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:57:36,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:57:36,638 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 48 [2022-12-13 11:57:36,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:36,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:36,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 48 [2022-12-13 11:57:36,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:37,044 INFO L130 PetriNetUnfolder]: 1366/2468 cut-off events. [2022-12-13 11:57:37,044 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 11:57:37,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4701 conditions, 2468 events. 1366/2468 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 16461 event pairs, 100 based on Foata normal form. 0/1357 useless extension candidates. Maximal degree in co-relation 4691. Up to 1987 conditions per place. [2022-12-13 11:57:37,052 INFO L137 encePairwiseOnDemand]: 41/48 looper letters, 21 selfloop transitions, 3 changer transitions 40/71 dead transitions. [2022-12-13 11:57:37,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 276 flow [2022-12-13 11:57:37,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:57:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-12-13 11:57:37,060 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-13 11:57:37,061 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 102 flow. Second operand 3 states and 92 transitions. [2022-12-13 11:57:37,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 276 flow [2022-12-13 11:57:37,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:37,064 INFO L231 Difference]: Finished difference. Result has 51 places, 24 transitions, 58 flow [2022-12-13 11:57:37,065 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=51, PETRI_TRANSITIONS=24} [2022-12-13 11:57:37,067 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2022-12-13 11:57:37,068 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:37,068 INFO L89 Accepts]: Start accepts. Operand has 51 places, 24 transitions, 58 flow [2022-12-13 11:57:37,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:37,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:37,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 24 transitions, 58 flow [2022-12-13 11:57:37,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 58 flow [2022-12-13 11:57:37,073 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 11:57:37,074 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:37,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:57:37,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 58 flow [2022-12-13 11:57:37,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 11:57:37,273 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:57:37,274 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 206 [2022-12-13 11:57:37,274 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 56 flow [2022-12-13 11:57:37,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:37,275 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:37,275 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:37,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:57:37,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:37,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:37,276 INFO L85 PathProgramCache]: Analyzing trace with hash 610016744, now seen corresponding path program 1 times [2022-12-13 11:57:37,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:37,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577831312] [2022-12-13 11:57:37,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:37,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:37,511 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-13 11:57:37,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:37,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577831312] [2022-12-13 11:57:37,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577831312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:37,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:37,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:57:37,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285391030] [2022-12-13 11:57:37,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:37,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:57:37,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:37,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:57:37,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:57:37,515 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 23 [2022-12-13 11:57:37,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:37,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:37,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 23 [2022-12-13 11:57:37,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:37,571 INFO L130 PetriNetUnfolder]: 157/319 cut-off events. [2022-12-13 11:57:37,572 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 11:57:37,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 319 events. 157/319 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1410 event pairs, 53 based on Foata normal form. 10/269 useless extension candidates. Maximal degree in co-relation 633. Up to 200 conditions per place. [2022-12-13 11:57:37,575 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 19 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2022-12-13 11:57:37,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 112 flow [2022-12-13 11:57:37,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:57:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 11:57:37,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2022-12-13 11:57:37,576 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 56 flow. Second operand 3 states and 44 transitions. [2022-12-13 11:57:37,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 112 flow [2022-12-13 11:57:37,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:37,578 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 56 flow [2022-12-13 11:57:37,578 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2022-12-13 11:57:37,579 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -23 predicate places. [2022-12-13 11:57:37,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:37,579 INFO L89 Accepts]: Start accepts. Operand has 31 places, 22 transitions, 56 flow [2022-12-13 11:57:37,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:37,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:37,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 56 flow [2022-12-13 11:57:37,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 56 flow [2022-12-13 11:57:37,583 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-13 11:57:37,583 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:57:37,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:57:37,584 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 56 flow [2022-12-13 11:57:37,584 INFO L226 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-13 11:57:37,630 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:37,631 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 11:57:37,632 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 56 flow [2022-12-13 11:57:37,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:37,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:37,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:37,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:57:37,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:37,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:37,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1730651251, now seen corresponding path program 1 times [2022-12-13 11:57:37,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:37,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527052825] [2022-12-13 11:57:37,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:37,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:38,113 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-13 11:57:38,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:38,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527052825] [2022-12-13 11:57:38,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527052825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:38,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:38,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:38,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413443177] [2022-12-13 11:57:38,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:38,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:57:38,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:38,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:57:38,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:57:38,115 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 11:57:38,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-13 11:57:38,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:38,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 11:57:38,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:38,219 INFO L130 PetriNetUnfolder]: 162/333 cut-off events. [2022-12-13 11:57:38,219 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 11:57:38,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 333 events. 162/333 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1422 event pairs, 68 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 686. Up to 260 conditions per place. [2022-12-13 11:57:38,221 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 23 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2022-12-13 11:57:38,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 141 flow [2022-12-13 11:57:38,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:57:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:57:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 11:57:38,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2022-12-13 11:57:38,226 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 56 flow. Second operand 4 states and 53 transitions. [2022-12-13 11:57:38,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 141 flow [2022-12-13 11:57:38,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 135 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:38,228 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 85 flow [2022-12-13 11:57:38,228 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-13 11:57:38,230 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -21 predicate places. [2022-12-13 11:57:38,230 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:38,230 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 85 flow [2022-12-13 11:57:38,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:38,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:38,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 85 flow [2022-12-13 11:57:38,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 85 flow [2022-12-13 11:57:38,236 INFO L130 PetriNetUnfolder]: 3/36 cut-off events. [2022-12-13 11:57:38,236 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-13 11:57:38,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 36 events. 3/36 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 108 event pairs, 1 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 56. Up to 8 conditions per place. [2022-12-13 11:57:38,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 85 flow [2022-12-13 11:57:38,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-13 11:57:38,244 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:38,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 11:57:38,245 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 85 flow [2022-12-13 11:57:38,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-13 11:57:38,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:38,245 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:38,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:57:38,246 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:38,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:38,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1432178002, now seen corresponding path program 1 times [2022-12-13 11:57:38,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:38,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408141992] [2022-12-13 11:57:38,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:38,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:38,542 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-13 11:57:38,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:38,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408141992] [2022-12-13 11:57:38,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408141992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:38,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:38,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:38,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770887990] [2022-12-13 11:57:38,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:38,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:57:38,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:38,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:57:38,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:57:38,545 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2022-12-13 11:57:38,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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-13 11:57:38,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:38,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2022-12-13 11:57:38,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:38,649 INFO L130 PetriNetUnfolder]: 168/341 cut-off events. [2022-12-13 11:57:38,649 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2022-12-13 11:57:38,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 341 events. 168/341 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1445 event pairs, 31 based on Foata normal form. 1/297 useless extension candidates. Maximal degree in co-relation 793. Up to 242 conditions per place. [2022-12-13 11:57:38,651 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 26 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2022-12-13 11:57:38,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 196 flow [2022-12-13 11:57:38,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:57:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:57:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-13 11:57:38,652 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2022-12-13 11:57:38,653 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 85 flow. Second operand 5 states and 64 transitions. [2022-12-13 11:57:38,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 196 flow [2022-12-13 11:57:38,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:57:38,654 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 142 flow [2022-12-13 11:57:38,654 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2022-12-13 11:57:38,655 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2022-12-13 11:57:38,655 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:38,655 INFO L89 Accepts]: Start accepts. Operand has 39 places, 32 transitions, 142 flow [2022-12-13 11:57:38,655 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:38,655 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:38,655 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 142 flow [2022-12-13 11:57:38,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 142 flow [2022-12-13 11:57:38,662 INFO L130 PetriNetUnfolder]: 20/79 cut-off events. [2022-12-13 11:57:38,663 INFO L131 PetriNetUnfolder]: For 46/52 co-relation queries the response was YES. [2022-12-13 11:57:38,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 79 events. 20/79 cut-off events. For 46/52 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 4 based on Foata normal form. 2/63 useless extension candidates. Maximal degree in co-relation 183. Up to 30 conditions per place. [2022-12-13 11:57:38,663 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 142 flow [2022-12-13 11:57:38,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-13 11:57:38,741 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L741-->L744: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [411] $Ultimate##0-->L775: Formula: (and (= v_~z~0_26 1) (= v_~y$r_buff0_thd2~0_111 v_~y$r_buff1_thd2~0_90) (= v_~y$w_buff0_used~0_383 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_18| |v_P1Thread1of1ForFork1_~arg#1.offset_18|) (= 2 v_~y$w_buff0~0_271) (= v_~y$r_buff0_thd2~0_110 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_28| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_383 256) 0)) (not (= (mod v_~y$w_buff1_used~0_335 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_384 v_~y$w_buff1_used~0_335) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_28| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_28|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_18| |v_P1Thread1of1ForFork1_~arg#1.base_18|) (= v_~y$r_buff0_thd0~0_265 v_~y$r_buff1_thd0~0_271) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_28| 0)) (= v_~z~0_26 v_~__unbuffered_p1_EAX~0_91) (= v_~y$r_buff0_thd1~0_81 v_~y$r_buff1_thd1~0_85) (= v_~y$w_buff1~0_238 v_~y$w_buff0~0_272)) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_18|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_384, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_265, ~y$w_buff0~0=v_~y$w_buff0~0_272, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_111, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_81, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_18|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_18|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_18|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_383, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_28|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_18|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_90, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_18|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_91, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_28|, ~y$w_buff1~0=v_~y$w_buff1~0_238, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_265, ~y$w_buff0~0=v_~y$w_buff0~0_271, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_110, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_81, ~z~0=v_~z~0_26, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_271, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_335} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 11:57:38,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L741-->L744: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [196] L810-->L816: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_36 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd0~0_36 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_74 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_66 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_35 (ite .cse2 v_~y$w_buff0~0_20 (ite .cse0 v_~y$w_buff1~0_15 v_~y~0_36))) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_35 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_66 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_36) v_~y$r_buff1_thd0~0_35) (= (ite .cse1 0 v_~y$r_buff0_thd0~0_36) v_~y$r_buff0_thd0~0_35) (= v_~y$w_buff0_used~0_73 (ite .cse2 0 v_~y$w_buff0_used~0_74))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_74, ~y$w_buff1~0=v_~y$w_buff1~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_36, ~y$w_buff0~0=v_~y$w_buff0~0_20, ~y~0=v_~y~0_36, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_73, ~y$w_buff1~0=v_~y$w_buff1~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_20, ~y~0=v_~y~0_35, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 11:57:38,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L741-->L775: Formula: (and (= v_~y$r_buff0_thd2~0_140 1) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_37| 0)) (= v_~z~0_35 v_~__unbuffered_p1_EAX~0_112) (= v_~y$r_buff0_thd2~0_141 v_~y$r_buff1_thd2~0_111) (= v_~y$r_buff0_thd0~0_316 v_~y$r_buff1_thd0~0_320) (= v_~y$w_buff1~0_286 v_~y$w_buff0~0_323) (= v_~y$w_buff0_used~0_461 v_~y$w_buff1_used~0_405) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_460 256) 0)) (not (= (mod v_~y$w_buff1_used~0_405 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_37|) (= v_~y$r_buff0_thd1~0_105 v_~y$r_buff1_thd1~0_111) (= v_~y$w_buff0_used~0_460 1) (= 2 v_~y$w_buff0~0_322) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_27| |v_P1Thread1of1ForFork1_~arg#1.offset_27|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_27| |v_P1Thread1of1ForFork1_~arg#1.base_27|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_37| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_37|) (= v_~z~0_35 1) (= v_~y~0_363 1)) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_461, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_316, ~y$w_buff0~0=v_~y$w_buff0~0_323, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_141, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_105, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_27|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_27|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_460, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_37|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_111, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_27|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_111, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_112, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_37|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_316, ~y$w_buff0~0=v_~y$w_buff0~0_322, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_105, ~z~0=v_~z~0_35, ~y~0=v_~y~0_363, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_320, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_405} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [284] L744-->L751: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_71 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd1~0_22) v_~y$r_buff0_thd1~0_21) (= v_~y$w_buff1_used~0_70 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_71)) (= (ite .cse2 v_~y$w_buff0~0_22 (ite .cse1 v_~y$w_buff1~0_17 v_~y~0_40)) v_~y~0_39) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_70 256) 0)) .cse3) (and (not (= 0 (mod v_~y$r_buff0_thd1~0_21 256))) .cse4)) 0 v_~y$r_buff1_thd1~0_20) v_~y$r_buff1_thd1~0_19) (= (ite .cse2 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_17, ~y$w_buff0~0=v_~y$w_buff0~0_22, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_22, ~y~0=v_~y~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_17, ~y$w_buff0~0=v_~y$w_buff0~0_22, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_21, ~y~0=v_~y~0_39, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_70} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 11:57:39,142 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:57:39,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 488 [2022-12-13 11:57:39,143 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 157 flow [2022-12-13 11:57:39,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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-13 11:57:39,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:39,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:39,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:57:39,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:39,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -461636452, now seen corresponding path program 1 times [2022-12-13 11:57:39,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:39,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077361708] [2022-12-13 11:57:39,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:39,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:39,531 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-13 11:57:39,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:39,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077361708] [2022-12-13 11:57:39,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077361708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:39,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:39,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:39,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787554257] [2022-12-13 11:57:39,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:39,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:57:39,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:39,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:57:39,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:57:39,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 11:57:39,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:39,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:39,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 11:57:39,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:39,657 INFO L130 PetriNetUnfolder]: 175/351 cut-off events. [2022-12-13 11:57:39,657 INFO L131 PetriNetUnfolder]: For 418/418 co-relation queries the response was YES. [2022-12-13 11:57:39,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 351 events. 175/351 cut-off events. For 418/418 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1575 event pairs, 57 based on Foata normal form. 4/304 useless extension candidates. Maximal degree in co-relation 1030. Up to 219 conditions per place. [2022-12-13 11:57:39,660 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 29 selfloop transitions, 9 changer transitions 0/44 dead transitions. [2022-12-13 11:57:39,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 279 flow [2022-12-13 11:57:39,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:57:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:57:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-13 11:57:39,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5673076923076923 [2022-12-13 11:57:39,661 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 157 flow. Second operand 4 states and 59 transitions. [2022-12-13 11:57:39,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 279 flow [2022-12-13 11:57:39,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 267 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 11:57:39,663 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 188 flow [2022-12-13 11:57:39,663 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-13 11:57:39,664 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2022-12-13 11:57:39,664 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:39,664 INFO L89 Accepts]: Start accepts. Operand has 41 places, 33 transitions, 188 flow [2022-12-13 11:57:39,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:39,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:39,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 188 flow [2022-12-13 11:57:39,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 188 flow [2022-12-13 11:57:39,674 INFO L130 PetriNetUnfolder]: 19/84 cut-off events. [2022-12-13 11:57:39,674 INFO L131 PetriNetUnfolder]: For 146/153 co-relation queries the response was YES. [2022-12-13 11:57:39,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 84 events. 19/84 cut-off events. For 146/153 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 381 event pairs, 5 based on Foata normal form. 3/64 useless extension candidates. Maximal degree in co-relation 228. Up to 30 conditions per place. [2022-12-13 11:57:39,675 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 188 flow [2022-12-13 11:57:39,676 INFO L226 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-13 11:57:39,677 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:39,678 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 11:57:39,678 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 188 flow [2022-12-13 11:57:39,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:39,678 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:39,678 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:39,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:57:39,678 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:39,679 INFO L85 PathProgramCache]: Analyzing trace with hash -461837239, now seen corresponding path program 1 times [2022-12-13 11:57:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:39,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161681224] [2022-12-13 11:57:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:40,317 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-13 11:57:40,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:40,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161681224] [2022-12-13 11:57:40,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161681224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:40,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:40,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:57:40,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427833201] [2022-12-13 11:57:40,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:40,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:57:40,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:40,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:57:40,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:40,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-13 11:57:40,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:40,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:40,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-13 11:57:40,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:40,453 INFO L130 PetriNetUnfolder]: 233/439 cut-off events. [2022-12-13 11:57:40,453 INFO L131 PetriNetUnfolder]: For 748/748 co-relation queries the response was YES. [2022-12-13 11:57:40,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 439 events. 233/439 cut-off events. For 748/748 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1944 event pairs, 36 based on Foata normal form. 3/384 useless extension candidates. Maximal degree in co-relation 1357. Up to 348 conditions per place. [2022-12-13 11:57:40,456 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 35 selfloop transitions, 14 changer transitions 0/54 dead transitions. [2022-12-13 11:57:40,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 391 flow [2022-12-13 11:57:40,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:57:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:57:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-13 11:57:40,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5153846153846153 [2022-12-13 11:57:40,457 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 188 flow. Second operand 5 states and 67 transitions. [2022-12-13 11:57:40,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 391 flow [2022-12-13 11:57:40,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 364 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 11:57:40,462 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 282 flow [2022-12-13 11:57:40,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2022-12-13 11:57:40,464 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2022-12-13 11:57:40,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:40,464 INFO L89 Accepts]: Start accepts. Operand has 44 places, 41 transitions, 282 flow [2022-12-13 11:57:40,465 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:40,466 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:40,466 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 41 transitions, 282 flow [2022-12-13 11:57:40,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 282 flow [2022-12-13 11:57:40,475 INFO L130 PetriNetUnfolder]: 28/102 cut-off events. [2022-12-13 11:57:40,476 INFO L131 PetriNetUnfolder]: For 177/182 co-relation queries the response was YES. [2022-12-13 11:57:40,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 102 events. 28/102 cut-off events. For 177/182 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 462 event pairs, 2 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 309. Up to 38 conditions per place. [2022-12-13 11:57:40,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 41 transitions, 282 flow [2022-12-13 11:57:40,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-13 11:57:40,480 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:40,480 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 11:57:40,480 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 282 flow [2022-12-13 11:57:40,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:40,480 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:40,480 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:40,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:57:40,481 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:40,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:40,485 INFO L85 PathProgramCache]: Analyzing trace with hash -461633569, now seen corresponding path program 2 times [2022-12-13 11:57:40,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:40,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713092167] [2022-12-13 11:57:40,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:40,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:40,802 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-13 11:57:40,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:40,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713092167] [2022-12-13 11:57:40,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713092167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:40,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:40,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:40,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105608514] [2022-12-13 11:57:40,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:40,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:57:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:57:40,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:57:40,803 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 11:57:40,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:40,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:40,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 11:57:40,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:40,914 INFO L130 PetriNetUnfolder]: 212/418 cut-off events. [2022-12-13 11:57:40,914 INFO L131 PetriNetUnfolder]: For 1026/1026 co-relation queries the response was YES. [2022-12-13 11:57:40,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 418 events. 212/418 cut-off events. For 1026/1026 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1959 event pairs, 41 based on Foata normal form. 6/363 useless extension candidates. Maximal degree in co-relation 1446. Up to 239 conditions per place. [2022-12-13 11:57:40,916 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 33 selfloop transitions, 13 changer transitions 0/53 dead transitions. [2022-12-13 11:57:40,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 424 flow [2022-12-13 11:57:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:57:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:57:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-13 11:57:40,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5673076923076923 [2022-12-13 11:57:40,918 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 282 flow. Second operand 4 states and 59 transitions. [2022-12-13 11:57:40,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 424 flow [2022-12-13 11:57:40,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 401 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 11:57:40,920 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 307 flow [2022-12-13 11:57:40,920 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-12-13 11:57:40,921 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2022-12-13 11:57:40,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:40,921 INFO L89 Accepts]: Start accepts. Operand has 47 places, 42 transitions, 307 flow [2022-12-13 11:57:40,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:40,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:40,921 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 307 flow [2022-12-13 11:57:40,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 307 flow [2022-12-13 11:57:40,931 INFO L130 PetriNetUnfolder]: 29/107 cut-off events. [2022-12-13 11:57:40,931 INFO L131 PetriNetUnfolder]: For 295/300 co-relation queries the response was YES. [2022-12-13 11:57:40,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 107 events. 29/107 cut-off events. For 295/300 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 506 event pairs, 5 based on Foata normal form. 4/84 useless extension candidates. Maximal degree in co-relation 350. Up to 41 conditions per place. [2022-12-13 11:57:40,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 307 flow [2022-12-13 11:57:40,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 296 [2022-12-13 11:57:40,933 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:40,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 11:57:40,933 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 307 flow [2022-12-13 11:57:40,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:40,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:40,934 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:40,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:57:40,934 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:40,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1425830690, now seen corresponding path program 1 times [2022-12-13 11:57:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:40,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843644693] [2022-12-13 11:57:40,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:40,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:41,475 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-13 11:57:41,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:41,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843644693] [2022-12-13 11:57:41,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843644693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:41,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:41,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:41,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553486461] [2022-12-13 11:57:41,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:41,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:57:41,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:41,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:57:41,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:57:41,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-13 11:57:41,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-13 11:57:41,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:41,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-13 11:57:41,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:41,588 INFO L130 PetriNetUnfolder]: 253/477 cut-off events. [2022-12-13 11:57:41,588 INFO L131 PetriNetUnfolder]: For 1434/1434 co-relation queries the response was YES. [2022-12-13 11:57:41,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 477 events. 253/477 cut-off events. For 1434/1434 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2202 event pairs, 98 based on Foata normal form. 6/419 useless extension candidates. Maximal degree in co-relation 1720. Up to 370 conditions per place. [2022-12-13 11:57:41,591 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 36 selfloop transitions, 15 changer transitions 0/56 dead transitions. [2022-12-13 11:57:41,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 488 flow [2022-12-13 11:57:41,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:57:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:57:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-13 11:57:41,592 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46923076923076923 [2022-12-13 11:57:41,592 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 307 flow. Second operand 5 states and 61 transitions. [2022-12-13 11:57:41,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 488 flow [2022-12-13 11:57:41,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 463 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:41,595 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 380 flow [2022-12-13 11:57:41,595 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2022-12-13 11:57:41,595 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2022-12-13 11:57:41,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:41,595 INFO L89 Accepts]: Start accepts. Operand has 51 places, 46 transitions, 380 flow [2022-12-13 11:57:41,596 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:41,596 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:41,596 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 46 transitions, 380 flow [2022-12-13 11:57:41,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 380 flow [2022-12-13 11:57:41,606 INFO L130 PetriNetUnfolder]: 30/114 cut-off events. [2022-12-13 11:57:41,606 INFO L131 PetriNetUnfolder]: For 375/379 co-relation queries the response was YES. [2022-12-13 11:57:41,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 114 events. 30/114 cut-off events. For 375/379 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 567 event pairs, 5 based on Foata normal form. 3/88 useless extension candidates. Maximal degree in co-relation 402. Up to 43 conditions per place. [2022-12-13 11:57:41,607 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 46 transitions, 380 flow [2022-12-13 11:57:41,607 INFO L226 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-13 11:57:41,608 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:41,608 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 11:57:41,608 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 380 flow [2022-12-13 11:57:41,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-13 11:57:41,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:41,609 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:41,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:57:41,609 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1425564493, now seen corresponding path program 1 times [2022-12-13 11:57:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:41,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346128050] [2022-12-13 11:57:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:41,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:41,997 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-13 11:57:41,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:41,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346128050] [2022-12-13 11:57:41,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346128050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:41,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:41,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:57:41,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820767001] [2022-12-13 11:57:41,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:41,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:57:41,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:41,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:57:41,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:57:42,000 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 11:57:42,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:42,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:42,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 11:57:42,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:42,180 INFO L130 PetriNetUnfolder]: 204/411 cut-off events. [2022-12-13 11:57:42,180 INFO L131 PetriNetUnfolder]: For 1717/1717 co-relation queries the response was YES. [2022-12-13 11:57:42,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 411 events. 204/411 cut-off events. For 1717/1717 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1956 event pairs, 27 based on Foata normal form. 6/353 useless extension candidates. Maximal degree in co-relation 1575. Up to 209 conditions per place. [2022-12-13 11:57:42,183 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 33 selfloop transitions, 19 changer transitions 0/59 dead transitions. [2022-12-13 11:57:42,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 528 flow [2022-12-13 11:57:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:57:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:57:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-13 11:57:42,184 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5307692307692308 [2022-12-13 11:57:42,184 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 380 flow. Second operand 5 states and 69 transitions. [2022-12-13 11:57:42,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 528 flow [2022-12-13 11:57:42,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 507 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:42,189 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 418 flow [2022-12-13 11:57:42,189 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=418, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-13 11:57:42,190 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2022-12-13 11:57:42,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:42,190 INFO L89 Accepts]: Start accepts. Operand has 54 places, 46 transitions, 418 flow [2022-12-13 11:57:42,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:42,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:42,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 418 flow [2022-12-13 11:57:42,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 418 flow [2022-12-13 11:57:42,202 INFO L130 PetriNetUnfolder]: 27/109 cut-off events. [2022-12-13 11:57:42,203 INFO L131 PetriNetUnfolder]: For 479/483 co-relation queries the response was YES. [2022-12-13 11:57:42,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 109 events. 27/109 cut-off events. For 479/483 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 535 event pairs, 4 based on Foata normal form. 3/84 useless extension candidates. Maximal degree in co-relation 396. Up to 38 conditions per place. [2022-12-13 11:57:42,204 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 46 transitions, 418 flow [2022-12-13 11:57:42,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-13 11:57:42,206 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:42,206 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 11:57:42,207 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 418 flow [2022-12-13 11:57:42,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:42,207 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:42,207 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:42,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:57:42,207 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:42,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:42,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1198383966, now seen corresponding path program 1 times [2022-12-13 11:57:42,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:42,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587144888] [2022-12-13 11:57:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:42,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:42,381 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-13 11:57:42,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:42,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587144888] [2022-12-13 11:57:42,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587144888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:42,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:42,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:57:42,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508960866] [2022-12-13 11:57:42,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:42,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:57:42,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:42,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:57:42,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:57:42,384 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-13 11:57:42,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:42,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:42,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-13 11:57:42,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:42,453 INFO L130 PetriNetUnfolder]: 246/464 cut-off events. [2022-12-13 11:57:42,454 INFO L131 PetriNetUnfolder]: For 2174/2176 co-relation queries the response was YES. [2022-12-13 11:57:42,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 464 events. 246/464 cut-off events. For 2174/2176 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2201 event pairs, 139 based on Foata normal form. 3/342 useless extension candidates. Maximal degree in co-relation 1822. Up to 418 conditions per place. [2022-12-13 11:57:42,456 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 30 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2022-12-13 11:57:42,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 409 flow [2022-12-13 11:57:42,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:57:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-13 11:57:42,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2022-12-13 11:57:42,458 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 418 flow. Second operand 3 states and 43 transitions. [2022-12-13 11:57:42,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 409 flow [2022-12-13 11:57:42,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 344 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-12-13 11:57:42,462 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 294 flow [2022-12-13 11:57:42,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2022-12-13 11:57:42,462 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2022-12-13 11:57:42,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:42,463 INFO L89 Accepts]: Start accepts. Operand has 48 places, 42 transitions, 294 flow [2022-12-13 11:57:42,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:42,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:42,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 42 transitions, 294 flow [2022-12-13 11:57:42,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 42 transitions, 294 flow [2022-12-13 11:57:42,480 INFO L130 PetriNetUnfolder]: 59/210 cut-off events. [2022-12-13 11:57:42,480 INFO L131 PetriNetUnfolder]: For 413/416 co-relation queries the response was YES. [2022-12-13 11:57:42,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 210 events. 59/210 cut-off events. For 413/416 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1314 event pairs, 21 based on Foata normal form. 3/154 useless extension candidates. Maximal degree in co-relation 623. Up to 76 conditions per place. [2022-12-13 11:57:42,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 42 transitions, 294 flow [2022-12-13 11:57:42,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 272 [2022-12-13 11:57:42,483 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [413] L741-->L751: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_464 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_108 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd1~0_114 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_408 256) 0)) .cse0)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_465 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~y$r_buff1_thd1~0_113 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_407 256) 0))) (and .cse1 (not (= 0 (mod v_~y$r_buff0_thd1~0_107 256))))) 0 v_~y$r_buff1_thd1~0_114)) (= v_~y~0_365 (ite .cse2 v_~y$w_buff0~0_326 (ite .cse3 v_~y$w_buff1~0_288 1))) (= v_~y$w_buff1_used~0_407 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_408)) (= v_~y$w_buff0_used~0_464 (ite .cse2 0 v_~y$w_buff0_used~0_465)) (= v_~y$r_buff0_thd1~0_107 (ite .cse4 0 v_~y$r_buff0_thd1~0_108))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_114, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_465, ~y$w_buff1~0=v_~y$w_buff1~0_288, ~y$w_buff0~0=v_~y$w_buff0~0_326, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_108, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_408} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_113, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_464, ~y$w_buff1~0=v_~y$w_buff1~0_288, ~y$w_buff0~0=v_~y$w_buff0~0_326, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_107, ~y~0=v_~y~0_365, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] and [411] $Ultimate##0-->L775: Formula: (and (= v_~z~0_26 1) (= v_~y$r_buff0_thd2~0_111 v_~y$r_buff1_thd2~0_90) (= v_~y$w_buff0_used~0_383 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_18| |v_P1Thread1of1ForFork1_~arg#1.offset_18|) (= 2 v_~y$w_buff0~0_271) (= v_~y$r_buff0_thd2~0_110 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_28| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_383 256) 0)) (not (= (mod v_~y$w_buff1_used~0_335 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_384 v_~y$w_buff1_used~0_335) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_28| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_28|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_18| |v_P1Thread1of1ForFork1_~arg#1.base_18|) (= v_~y$r_buff0_thd0~0_265 v_~y$r_buff1_thd0~0_271) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_28| 0)) (= v_~z~0_26 v_~__unbuffered_p1_EAX~0_91) (= v_~y$r_buff0_thd1~0_81 v_~y$r_buff1_thd1~0_85) (= v_~y$w_buff1~0_238 v_~y$w_buff0~0_272)) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_18|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_384, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_265, ~y$w_buff0~0=v_~y$w_buff0~0_272, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_111, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_81, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_18|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_18|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_18|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_383, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_28|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_18|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_90, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_18|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_91, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_28|, ~y$w_buff1~0=v_~y$w_buff1~0_238, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_265, ~y$w_buff0~0=v_~y$w_buff0~0_271, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_110, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_81, ~z~0=v_~z~0_26, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_271, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_335} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 11:57:42,640 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:57:42,641 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-13 11:57:42,641 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 298 flow [2022-12-13 11:57:42,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:42,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:42,641 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:42,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:57:42,642 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:42,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1547692896, now seen corresponding path program 2 times [2022-12-13 11:57:42,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:42,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490831118] [2022-12-13 11:57:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:42,860 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-13 11:57:42,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:42,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490831118] [2022-12-13 11:57:42,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490831118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:42,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:42,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:57:42,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581240245] [2022-12-13 11:57:42,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:42,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:57:42,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:42,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:57:42,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:57:42,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-13 11:57:42,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:42,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:42,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-13 11:57:42,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:42,982 INFO L130 PetriNetUnfolder]: 161/339 cut-off events. [2022-12-13 11:57:42,982 INFO L131 PetriNetUnfolder]: For 897/897 co-relation queries the response was YES. [2022-12-13 11:57:42,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 339 events. 161/339 cut-off events. For 897/897 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1572 event pairs, 26 based on Foata normal form. 11/274 useless extension candidates. Maximal degree in co-relation 1314. Up to 289 conditions per place. [2022-12-13 11:57:42,984 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 34 selfloop transitions, 17 changer transitions 0/56 dead transitions. [2022-12-13 11:57:42,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 446 flow [2022-12-13 11:57:42,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:57:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:57:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-13 11:57:42,986 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4846153846153846 [2022-12-13 11:57:42,986 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 298 flow. Second operand 5 states and 63 transitions. [2022-12-13 11:57:42,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 446 flow [2022-12-13 11:57:42,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 422 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 11:57:42,988 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 328 flow [2022-12-13 11:57:42,988 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2022-12-13 11:57:42,988 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2022-12-13 11:57:42,988 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:42,988 INFO L89 Accepts]: Start accepts. Operand has 52 places, 44 transitions, 328 flow [2022-12-13 11:57:42,989 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:42,989 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:42,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 44 transitions, 328 flow [2022-12-13 11:57:42,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 328 flow [2022-12-13 11:57:43,004 INFO L130 PetriNetUnfolder]: 71/207 cut-off events. [2022-12-13 11:57:43,004 INFO L131 PetriNetUnfolder]: For 423/426 co-relation queries the response was YES. [2022-12-13 11:57:43,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 207 events. 71/207 cut-off events. For 423/426 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1192 event pairs, 15 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 727. Up to 97 conditions per place. [2022-12-13 11:57:43,006 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 44 transitions, 328 flow [2022-12-13 11:57:43,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-13 11:57:43,148 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:57:43,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 11:57:43,149 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 334 flow [2022-12-13 11:57:43,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:43,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:43,149 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:43,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:57:43,149 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:43,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:43,150 INFO L85 PathProgramCache]: Analyzing trace with hash 731046365, now seen corresponding path program 1 times [2022-12-13 11:57:43,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:43,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547806624] [2022-12-13 11:57:43,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:43,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:43,239 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-13 11:57:43,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:43,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547806624] [2022-12-13 11:57:43,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547806624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:43,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:43,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:43,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551917843] [2022-12-13 11:57:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:43,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:57:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:43,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:57:43,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:43,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2022-12-13 11:57:43,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-13 11:57:43,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:43,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2022-12-13 11:57:43,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:43,302 INFO L130 PetriNetUnfolder]: 44/144 cut-off events. [2022-12-13 11:57:43,303 INFO L131 PetriNetUnfolder]: For 502/502 co-relation queries the response was YES. [2022-12-13 11:57:43,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 144 events. 44/144 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 598 event pairs, 6 based on Foata normal form. 30/138 useless extension candidates. Maximal degree in co-relation 655. Up to 61 conditions per place. [2022-12-13 11:57:43,304 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 27 selfloop transitions, 16 changer transitions 1/50 dead transitions. [2022-12-13 11:57:43,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 454 flow [2022-12-13 11:57:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:57:43,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:57:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-13 11:57:43,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2022-12-13 11:57:43,305 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 334 flow. Second operand 4 states and 55 transitions. [2022-12-13 11:57:43,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 454 flow [2022-12-13 11:57:43,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 402 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-13 11:57:43,307 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 320 flow [2022-12-13 11:57:43,307 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=320, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-13 11:57:43,307 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2022-12-13 11:57:43,307 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:43,307 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 320 flow [2022-12-13 11:57:43,308 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:43,308 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:43,308 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 320 flow [2022-12-13 11:57:43,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 320 flow [2022-12-13 11:57:43,316 INFO L130 PetriNetUnfolder]: 17/95 cut-off events. [2022-12-13 11:57:43,316 INFO L131 PetriNetUnfolder]: For 180/186 co-relation queries the response was YES. [2022-12-13 11:57:43,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 95 events. 17/95 cut-off events. For 180/186 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 425 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 325. Up to 49 conditions per place. [2022-12-13 11:57:43,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 320 flow [2022-12-13 11:57:43,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-13 11:57:45,103 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [415] L741-->L751: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_472 256) 0))) (.cse0 (not (= (mod v_~y$r_buff0_thd1~0_112 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_474 256) 0))) (let ((.cse1 (and .cse0 (not .cse3))) (.cse2 (and .cse4 .cse0))) (and (= 2 v_~y$w_buff0~0_330) (= v_~y$r_buff0_thd2~0_144 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_29| |v_P1Thread1of1ForFork1_~arg#1.offset_29|) (= v_~y$w_buff0_used~0_472 (ite .cse0 0 1)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|) (= v_~y~0_373 (ite .cse0 v_~y$w_buff0~0_330 (ite .cse1 v_~y$w_buff1~0_292 1))) (= v_~z~0_37 v_~__unbuffered_p1_EAX~0_114) (= v_~y$r_buff0_thd1~0_111 (ite .cse2 0 v_~y$r_buff0_thd1~0_112)) (= (ite .cse3 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|) (= v_~y$w_buff1_used~0_415 (ite (or .cse1 .cse2) 0 v_~y$w_buff0_used~0_474)) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_29| |v_P1Thread1of1ForFork1_~arg#1.base_29|) (= v_~z~0_37 1) (= v_~y$w_buff1~0_292 v_~y$w_buff0~0_331) (= v_~y$r_buff1_thd1~0_117 (ite (or (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_111 256) 0))) (and (not (= 0 (mod v_~y$w_buff1_used~0_415 256))) .cse0)) 0 v_~y$r_buff0_thd1~0_112)) (= v_~y$r_buff0_thd2~0_145 v_~y$r_buff1_thd2~0_113) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39| 0)) (= v_~y$r_buff0_thd0~0_322 v_~y$r_buff1_thd0~0_326)))) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_29|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_474, ~y$w_buff0~0=v_~y$w_buff0~0_331, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_322, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_112, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_145, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_29|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_29|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_29|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_472, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_39|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_29|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_292, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_114, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_39|, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_322, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_111, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_144, ~z~0=v_~z~0_37, ~y~0=v_~y~0_373, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_326, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_415} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff0_thd2~0, ~z~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [293] L775-->L778: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{~x~0=v_~x~0_2, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0] [2022-12-13 11:57:45,807 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 11:57:45,808 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2501 [2022-12-13 11:57:45,808 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 300 flow [2022-12-13 11:57:45,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-13 11:57:45,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:45,808 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:45,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:57:45,808 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:45,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:45,808 INFO L85 PathProgramCache]: Analyzing trace with hash -460921242, now seen corresponding path program 1 times [2022-12-13 11:57:45,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:45,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224343288] [2022-12-13 11:57:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:45,890 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-13 11:57:45,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:45,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224343288] [2022-12-13 11:57:45,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224343288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:45,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:45,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:45,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266432706] [2022-12-13 11:57:45,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:45,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:57:45,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:45,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:57:45,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:45,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2022-12-13 11:57:45,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 300 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-13 11:57:45,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:45,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2022-12-13 11:57:45,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:45,951 INFO L130 PetriNetUnfolder]: 57/163 cut-off events. [2022-12-13 11:57:45,952 INFO L131 PetriNetUnfolder]: For 397/403 co-relation queries the response was YES. [2022-12-13 11:57:45,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 163 events. 57/163 cut-off events. For 397/403 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 728 event pairs, 2 based on Foata normal form. 12/145 useless extension candidates. Maximal degree in co-relation 738. Up to 94 conditions per place. [2022-12-13 11:57:45,952 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 23 selfloop transitions, 1 changer transitions 26/57 dead transitions. [2022-12-13 11:57:45,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 550 flow [2022-12-13 11:57:45,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:57:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:57:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-13 11:57:45,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-13 11:57:45,953 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 300 flow. Second operand 4 states and 52 transitions. [2022-12-13 11:57:45,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 550 flow [2022-12-13 11:57:45,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 444 flow, removed 34 selfloop flow, removed 6 redundant places. [2022-12-13 11:57:45,955 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 162 flow [2022-12-13 11:57:45,955 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-13 11:57:45,956 INFO L295 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2022-12-13 11:57:45,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:45,956 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 162 flow [2022-12-13 11:57:45,956 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:45,956 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:45,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 162 flow [2022-12-13 11:57:45,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 28 transitions, 162 flow [2022-12-13 11:57:45,963 INFO L130 PetriNetUnfolder]: 11/60 cut-off events. [2022-12-13 11:57:45,963 INFO L131 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2022-12-13 11:57:45,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 60 events. 11/60 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 218 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 198. Up to 29 conditions per place. [2022-12-13 11:57:45,963 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 162 flow [2022-12-13 11:57:45,963 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 11:57:46,242 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [424] $Ultimate##0-->L778: Formula: (and (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_51| 0)) (= 2 v_~y$w_buff0~0_364) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_51| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_51|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_41| |v_P1Thread1of1ForFork1_~arg#1.base_41|) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_41| |v_P1Thread1of1ForFork1_~arg#1.offset_41|) (= v_~x~0_54 v_~__unbuffered_p1_EBX~0_125) (= v_~y$r_buff0_thd2~0_173 v_~y$r_buff1_thd2~0_129) (= v_~y$r_buff0_thd2~0_172 1) (= v_~y$w_buff0_used~0_519 v_~y$w_buff1_used~0_451) (= v_~y$r_buff0_thd1~0_131 v_~y$r_buff1_thd1~0_135) (= v_~y$w_buff1~0_316 v_~y$w_buff0~0_365) (= v_~y$r_buff0_thd0~0_348 v_~y$r_buff1_thd0~0_352) (= v_~y$w_buff0_used~0_518 1) (= v_~z~0_49 1) (= v_~z~0_49 v_~__unbuffered_p1_EAX~0_130) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_518 256) 0)) (not (= (mod v_~y$w_buff1_used~0_451 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_51|)) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_41|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_519, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, ~y$w_buff0~0=v_~y$w_buff0~0_365, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_173, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_131, ~x~0=v_~x~0_54, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_41|} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_125, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_41|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_41|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_518, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_51|, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_41|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_129, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_41|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_135, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_130, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_51|, ~y$w_buff1~0=v_~y$w_buff1~0_316, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, ~y$w_buff0~0=v_~y$w_buff0~0_364, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_172, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_131, ~z~0=v_~z~0_49, ~x~0=v_~x~0_54, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_352, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_451} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [426] $Ultimate##0-->L744: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= v_~y~0_409 1) (= v_~x~0_58 1) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, ~y~0=v_~y~0_409, ~x~0=v_~x~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~y~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 11:57:46,349 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [428] $Ultimate##0-->L744: Formula: (and (= v_~y$w_buff0_used~0_528 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_45| |v_P1Thread1of1ForFork1_~arg#1.base_45|) (= v_~y$r_buff0_thd2~0_183 v_~y$r_buff1_thd2~0_135) (= v_~y$r_buff0_thd1~0_135 v_~y$r_buff1_thd1~0_139) (= v_~x~0_63 v_~__unbuffered_p1_EBX~0_129) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| 0)) (= v_~z~0_53 v_~__unbuffered_p1_EAX~0_134) (= v_~x~0_62 1) (= 2 v_~y$w_buff0~0_372) (= v_~z~0_53 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_45| |v_P1Thread1of1ForFork1_~arg#1.offset_45|) (= v_~y$r_buff0_thd0~0_352 v_~y$r_buff1_thd0~0_356) (= v_~y$r_buff0_thd2~0_182 1) (= v_~y$w_buff0_used~0_529 v_~y$w_buff1_used~0_457) (= v_~y$w_buff1~0_320 v_~y$w_buff0~0_373) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (= v_P0Thread1of1ForFork0_~arg.base_17 |v_P0Thread1of1ForFork0_#in~arg.base_17|) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_457 256) 0)) (not (= (mod v_~y$w_buff0_used~0_528 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (= v_P0Thread1of1ForFork0_~arg.offset_17 |v_P0Thread1of1ForFork0_#in~arg.offset_17|) (= v_~y~0_413 1)) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_45|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_17|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_529, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_352, ~y$w_buff0~0=v_~y$w_buff0~0_373, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_183, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_135, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_17|, ~x~0=v_~x~0_63, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_45|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_45|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_528, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_17, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_45|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_45|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_139, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_134, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff0~0=v_~y$w_buff0~0_372, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_135, ~y~0=v_~y~0_413, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_129, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_45|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_17|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_320, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_352, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_182, ~z~0=v_~z~0_53, ~x~0=v_~x~0_62, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_356, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_457} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y~0, ~x~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] and [294] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_91 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= v_~y~0_59 (ite .cse0 v_~y$w_buff0~0_36 (ite .cse1 v_~y$w_buff1~0_29 v_~y~0_60))) (= v_~y$w_buff1_used~0_90 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_91)) (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_90 256) 0)))) 0 v_~y$r_buff1_thd2~0_22) v_~y$r_buff1_thd2~0_21) (= v_~y$r_buff0_thd2~0_28 (ite .cse2 0 v_~y$r_buff0_thd2~0_29))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 11:57:46,752 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [430] $Ultimate##0-->L751: Formula: (let ((.cse0 (= (mod v_~y$w_buff0_used~0_540 256) 0)) (.cse1 (not (= 0 (mod v_~y$w_buff0_used~0_538 256)))) (.cse2 (not (= (mod v_~y$r_buff0_thd1~0_140 256) 0)))) (let ((.cse3 (and .cse1 .cse2)) (.cse4 (and (not .cse0) .cse2))) (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_59| (ite .cse0 1 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_59| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_59|) (= v_~z~0_57 1) (= v_~x~0_70 1) (= v_~y$r_buff1_thd1~0_143 (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd1~0_139 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_463 256) 0)) .cse2)) 0 v_~y$r_buff0_thd1~0_140)) (= (ite .cse3 0 v_~y$r_buff0_thd1~0_140) v_~y$r_buff0_thd1~0_139) (= (ite .cse2 0 1) v_~y$w_buff0_used~0_538) (= v_~x~0_71 v_~__unbuffered_p1_EBX~0_133) (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_~y$r_buff0_thd2~0_193 v_~y$r_buff1_thd2~0_141) (= 2 v_~y$w_buff0~0_380) (= v_~y$r_buff0_thd2~0_192 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_49| |v_P1Thread1of1ForFork1_~arg#1.base_49|) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff0_used~0_540) v_~y$w_buff1_used~0_463) (= v_~y~0_419 (ite .cse2 v_~y$w_buff0~0_380 (ite .cse4 v_~y$w_buff1~0_324 1))) (= v_~y$r_buff0_thd0~0_356 v_~y$r_buff1_thd0~0_360) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_49| |v_P1Thread1of1ForFork1_~arg#1.offset_49|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_59| 0)) (= v_~y$w_buff1~0_324 v_~y$w_buff0~0_381) (= v_~z~0_57 v_~__unbuffered_p1_EAX~0_138)))) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_540, ~y$w_buff0~0=v_~y$w_buff0~0_381, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_356, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_140, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~x~0=v_~x~0_71, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_49|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_538, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_49|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_49|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_143, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_138, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_59|, ~y$w_buff0~0=v_~y$w_buff0~0_380, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_139, ~y~0=v_~y~0_419, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_133, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_49|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_141, ~y$w_buff1~0=v_~y$w_buff1~0_324, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_356, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_192, ~z~0=v_~z~0_57, ~x~0=v_~x~0_70, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_360, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_463} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff0_thd2~0, ~z~0, ~y~0, ~x~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] and [294] L778-->L785: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_101 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_22 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_91 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_102 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= v_~y~0_59 (ite .cse0 v_~y$w_buff0~0_36 (ite .cse1 v_~y$w_buff1~0_29 v_~y~0_60))) (= v_~y$w_buff1_used~0_90 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_91)) (= v_~y$w_buff0_used~0_101 (ite .cse0 0 v_~y$w_buff0_used~0_102)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_90 256) 0)))) 0 v_~y$r_buff1_thd2~0_22) v_~y$r_buff1_thd2~0_21) (= v_~y$r_buff0_thd2~0_28 (ite .cse2 0 v_~y$r_buff0_thd2~0_29))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_102, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 11:57:47,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [429] $Ultimate##0-->L785: Formula: (let ((.cse0 (not (= (mod v_~y$r_buff0_thd2~0_188 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_532 256) 0))) (.cse1 (= 0 (mod v_~y$w_buff0_used~0_534 256)))) (and (= v_~y$w_buff0_used~0_532 0) (= v_~x~0_66 1) (= v_~y$w_buff1_used~0_459 (ite (or (and .cse0 (not .cse1)) .cse2) 0 v_~y$w_buff0_used~0_534)) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= v_~y~0_415 v_~y$w_buff0~0_376) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|) (= v_~y$w_buff1~0_322 v_~y$w_buff0~0_377) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| 0)) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd2~0_186 256) 0))) (and .cse0 (not (= (mod v_~y$w_buff1_used~0_459 256) 0)))) 0 v_~y$r_buff0_thd2~0_188) v_~y$r_buff1_thd2~0_137) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_47| |v_P1Thread1of1ForFork1_~arg#1.base_47|) (= v_~y$r_buff0_thd2~0_186 (ite .cse2 0 1)) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_47| |v_P1Thread1of1ForFork1_~arg#1.offset_47|) (= v_~y$r_buff0_thd1~0_137 v_~y$r_buff1_thd1~0_141) (= 2 v_~y$w_buff0~0_376) (= v_~y$r_buff0_thd0~0_354 v_~y$r_buff1_thd0~0_358) (= (ite .cse1 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= v_~z~0_55 v_~__unbuffered_p1_EAX~0_136) (= v_~z~0_55 1) (= v_~x~0_67 v_~__unbuffered_p1_EBX~0_131) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|))) InVars {P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_47|, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_534, ~y$w_buff0~0=v_~y$w_buff0~0_377, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_354, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_188, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_137, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~x~0=v_~x~0_67, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_47|} OutVars{P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_47|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_532, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_47|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_47|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_141, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|, ~y$w_buff0~0=v_~y$w_buff0~0_376, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_137, ~y~0=v_~y~0_415, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_47|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_137, ~y$w_buff1~0=v_~y$w_buff1~0_322, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_354, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_186, ~z~0=v_~z~0_55, ~x~0=v_~x~0_66, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_358, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_459} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg#1.base, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_~arg#1.offset, ~y$w_buff0_used~0, P0Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y~0, ~x~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] and [284] L744-->L751: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_22 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_71 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd1~0_22) v_~y$r_buff0_thd1~0_21) (= v_~y$w_buff1_used~0_70 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_71)) (= (ite .cse2 v_~y$w_buff0~0_22 (ite .cse1 v_~y$w_buff1~0_17 v_~y~0_40)) v_~y~0_39) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_70 256) 0)) .cse3) (and (not (= 0 (mod v_~y$r_buff0_thd1~0_21 256))) .cse4)) 0 v_~y$r_buff1_thd1~0_20) v_~y$r_buff1_thd1~0_19) (= (ite .cse2 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_17, ~y$w_buff0~0=v_~y$w_buff0~0_22, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_22, ~y~0=v_~y~0_40, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_17, ~y$w_buff0~0=v_~y$w_buff0~0_22, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_21, ~y~0=v_~y~0_39, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_70} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 11:57:47,408 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 11:57:47,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1453 [2022-12-13 11:57:47,409 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 168 flow [2022-12-13 11:57:47,409 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-13 11:57:47,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:47,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:47,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:57:47,409 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 11:57:47,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:47,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1731805700, now seen corresponding path program 1 times [2022-12-13 11:57:47,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:47,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398882474] [2022-12-13 11:57:47,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:47,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:57:47,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:57:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:57:47,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:57:47,488 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:57:47,489 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 11:57:47,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 11:57:47,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 11:57:47,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 11:57:47,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 11:57:47,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:57:47,490 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:47,494 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:57:47,494 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:57:47,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:57:47 BasicIcfg [2022-12-13 11:57:47,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:57:47,541 INFO L158 Benchmark]: Toolchain (without parser) took 18293.99ms. Allocated memory was 213.9MB in the beginning and 710.9MB in the end (delta: 497.0MB). Free memory was 188.1MB in the beginning and 613.8MB in the end (delta: -425.6MB). Peak memory consumption was 71.9MB. Max. memory is 8.0GB. [2022-12-13 11:57:47,541 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 213.9MB. Free memory is still 190.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:57:47,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.41ms. Allocated memory is still 213.9MB. Free memory was 187.9MB in the beginning and 162.5MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 11:57:47,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.65ms. Allocated memory is still 213.9MB. Free memory was 162.5MB in the beginning and 159.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:57:47,542 INFO L158 Benchmark]: Boogie Preprocessor took 19.64ms. Allocated memory is still 213.9MB. Free memory was 159.8MB in the beginning and 158.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 11:57:47,542 INFO L158 Benchmark]: RCFGBuilder took 531.13ms. Allocated memory is still 213.9MB. Free memory was 158.3MB in the beginning and 126.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-13 11:57:47,542 INFO L158 Benchmark]: TraceAbstraction took 17259.54ms. Allocated memory was 213.9MB in the beginning and 710.9MB in the end (delta: 497.0MB). Free memory was 125.8MB in the beginning and 613.8MB in the end (delta: -488.0MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-12-13 11:57:47,543 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.09ms. Allocated memory is still 213.9MB. Free memory is still 190.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 444.41ms. Allocated memory is still 213.9MB. Free memory was 187.9MB in the beginning and 162.5MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.65ms. Allocated memory is still 213.9MB. Free memory was 162.5MB in the beginning and 159.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.64ms. Allocated memory is still 213.9MB. Free memory was 159.8MB in the beginning and 158.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 531.13ms. Allocated memory is still 213.9MB. Free memory was 158.3MB in the beginning and 126.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 17259.54ms. Allocated memory was 213.9MB in the beginning and 710.9MB in the end (delta: 497.0MB). Free memory was 125.8MB in the beginning and 613.8MB in the end (delta: -488.0MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 94 PlacesBefore, 54 PlacesAfterwards, 89 TransitionsBefore, 48 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 33 ConcurrentYvCompositions, 2 ChoiceCompositions, 73 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1953, independent: 1854, independent conditional: 1854, independent unconditional: 0, dependent: 99, dependent conditional: 99, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1953, independent: 1854, independent conditional: 0, independent unconditional: 1854, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1953, independent: 1854, independent conditional: 0, independent unconditional: 1854, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1953, independent: 1854, independent conditional: 0, independent unconditional: 1854, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1085, independent: 1046, independent conditional: 0, independent unconditional: 1046, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1085, independent: 1030, independent conditional: 0, independent unconditional: 1030, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 251, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1953, independent: 808, independent conditional: 0, independent unconditional: 808, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 1085, unknown conditional: 0, unknown unconditional: 1085] , Statistics on independence cache: Total cache size (in pairs): 1927, Positive cache size: 1888, Positive conditional cache size: 0, Positive unconditional cache size: 1888, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, 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.2s, 31 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 228, independent: 179, independent conditional: 179, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 228, independent: 179, independent conditional: 13, independent unconditional: 166, dependent: 49, dependent conditional: 2, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 228, independent: 179, independent conditional: 13, independent unconditional: 166, dependent: 49, dependent conditional: 2, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 228, independent: 179, independent conditional: 13, independent unconditional: 166, dependent: 49, dependent conditional: 2, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 111, independent: 92, independent conditional: 8, independent unconditional: 84, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 111, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 29, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 90, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 77, dependent conditional: 9, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 228, independent: 87, independent conditional: 5, independent unconditional: 82, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 111, unknown conditional: 10, unknown unconditional: 101] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 92, Positive conditional cache size: 8, Positive unconditional cache size: 84, Negative cache size: 19, Negative conditional cache size: 2, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 78, independent conditional: 78, 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: 100, independent: 78, independent conditional: 7, independent unconditional: 71, dependent: 22, dependent conditional: 4, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 78, independent conditional: 0, independent unconditional: 78, 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: 100, independent: 78, independent conditional: 0, independent unconditional: 78, 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: 39, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 39, unknown conditional: 0, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 125, Positive conditional cache size: 8, Positive unconditional cache size: 117, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 77, independent conditional: 6, independent unconditional: 71, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 77, independent conditional: 4, independent unconditional: 73, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 77, independent conditional: 4, independent unconditional: 73, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 73, independent conditional: 4, independent unconditional: 69, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 129, Positive conditional cache size: 8, Positive unconditional cache size: 121, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 39 PlacesBefore, 38 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 198, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 198, independent: 169, independent conditional: 54, independent unconditional: 115, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 198, independent: 169, independent conditional: 39, independent unconditional: 130, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198, independent: 169, independent conditional: 39, independent unconditional: 130, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 1, independent unconditional: 6, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 198, independent: 162, independent conditional: 38, independent unconditional: 124, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 151, Positive conditional cache size: 9, Positive unconditional cache size: 142, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 71, independent: 57, independent conditional: 12, independent unconditional: 45, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, independent: 57, independent conditional: 12, independent unconditional: 45, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, independent: 57, independent conditional: 12, independent unconditional: 45, dependent: 14, dependent conditional: 0, dependent unconditional: 14, 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: 71, independent: 57, independent conditional: 12, independent unconditional: 45, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 151, Positive conditional cache size: 9, Positive unconditional cache size: 142, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 138, independent: 123, independent conditional: 24, independent unconditional: 99, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 138, independent: 123, independent conditional: 24, independent unconditional: 99, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 123, independent conditional: 24, independent unconditional: 99, dependent: 15, dependent conditional: 0, dependent unconditional: 15, 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: 138, independent: 123, independent conditional: 24, independent unconditional: 99, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 151, Positive conditional cache size: 9, Positive unconditional cache size: 142, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, independent: 125, independent conditional: 125, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 141, independent: 125, independent conditional: 21, independent unconditional: 104, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 141, independent: 125, independent conditional: 21, independent unconditional: 104, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 141, independent: 125, independent conditional: 21, independent unconditional: 104, dependent: 16, dependent conditional: 0, dependent unconditional: 16, 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: 141, independent: 125, independent conditional: 21, independent unconditional: 104, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 151, Positive conditional cache size: 9, Positive unconditional cache size: 142, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, independent: 125, independent conditional: 125, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 141, independent: 125, independent conditional: 21, independent unconditional: 104, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 141, independent: 125, independent conditional: 21, independent unconditional: 104, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 141, independent: 125, independent conditional: 21, independent unconditional: 104, dependent: 16, dependent conditional: 0, dependent unconditional: 16, 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: 141, independent: 125, independent conditional: 21, independent unconditional: 104, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 151, Positive conditional cache size: 9, Positive unconditional cache size: 142, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, independent: 125, independent conditional: 125, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 141, independent: 125, independent conditional: 21, independent unconditional: 104, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 141, independent: 125, independent conditional: 21, independent unconditional: 104, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 141, independent: 125, independent conditional: 21, independent unconditional: 104, dependent: 16, dependent conditional: 0, dependent unconditional: 16, 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: 141, independent: 125, independent conditional: 21, independent unconditional: 104, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 151, Positive conditional cache size: 9, Positive unconditional cache size: 142, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 48 PlacesBefore, 48 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, independent: 117, independent conditional: 117, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 134, independent: 117, independent conditional: 19, independent unconditional: 98, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 134, independent: 117, independent conditional: 19, independent unconditional: 98, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 134, independent: 117, independent conditional: 19, independent unconditional: 98, dependent: 17, dependent conditional: 0, dependent unconditional: 17, 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: 134, independent: 115, independent conditional: 17, independent unconditional: 98, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 154, Positive conditional cache size: 11, Positive unconditional cache size: 143, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 52 PlacesBefore, 52 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 142, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 142, independent: 130, independent conditional: 51, independent unconditional: 79, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 142, independent: 130, independent conditional: 38, independent unconditional: 92, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 142, independent: 130, independent conditional: 38, independent unconditional: 92, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 142, independent: 130, independent conditional: 38, independent unconditional: 92, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 161, Positive conditional cache size: 11, Positive unconditional cache size: 150, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 50 PlacesBefore, 45 PlacesAfterwards, 42 TransitionsBefore, 37 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 241, independent: 211, independent conditional: 211, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 241, independent: 211, independent conditional: 139, independent unconditional: 72, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 241, independent: 211, independent conditional: 119, independent unconditional: 92, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 241, independent: 211, independent conditional: 119, independent unconditional: 92, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 241, independent: 206, independent conditional: 115, independent unconditional: 91, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 175, Positive conditional cache size: 15, Positive unconditional cache size: 160, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 41 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 22 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 5 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 22, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 31, independent conditional: 22, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 22, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 31, independent: 19, independent conditional: 12, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 10, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 231, Positive conditional cache size: 25, Positive unconditional cache size: 206, Negative cache size: 27, Negative conditional cache size: 4, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1603; [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1603, ((void *)0), P0, ((void *)0))=-1, t1603={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1604; [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1604, ((void *)0), P1, ((void *)0))=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 z = 1 [L774] 2 __unbuffered_p1_EAX = z [L777] 2 __unbuffered_p1_EBX = x [L740] 2 x = 1 [L743] 2 y = 1 [L746] 2 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 2 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 2 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 805]: 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: 803]: 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 5 procedures, 111 locations, 5 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: 17.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 758 IncrementalHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 14 mSDtfsCounter, 758 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 975 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:57:47,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...