/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/safe007_power.opt-thin001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:59:47,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:59:47,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:59:47,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:59:47,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:59:47,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:59:47,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:59:47,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:59:47,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:59:47,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:59:47,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:59:47,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:59:47,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:59:47,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:59:47,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:59:47,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:59:47,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:59:47,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:59:47,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:59:47,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:59:47,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:59:47,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:59:47,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:59:47,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:59:47,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:59:47,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:59:47,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:59:47,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:59:47,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:59:47,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:59:47,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:59:47,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:59:47,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:59:47,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:59:47,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:59:47,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:59:47,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:59:47,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:59:47,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:59:47,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:59:47,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:59:47,457 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:59:47,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:59:47,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:59:47,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:59:47,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:59:47,486 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:59:47,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:59:47,487 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:59:47,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:59:47,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:59:47,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:59:47,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:59:47,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:59:47,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:59:47,488 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:59:47,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:59:47,488 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:59:47,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:59:47,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:59:47,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:59:47,489 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:59:47,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:59:47,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:59:47,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:59:47,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:59:47,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:59:47,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:59:47,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:59:47,489 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:59:47,489 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:59:47,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:59:47,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:59:47,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:59:47,857 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:59:47,858 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:59:47,859 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2022-12-13 11:59:49,032 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:59:49,264 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:59:49,264 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.opt-thin001_power.opt.i [2022-12-13 11:59:49,273 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83663dd8/3756eca667784a439560771f847b22df/FLAG3f1b82943 [2022-12-13 11:59:49,284 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83663dd8/3756eca667784a439560771f847b22df [2022-12-13 11:59:49,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:59:49,289 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:59:49,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:59:49,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:59:49,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:59:49,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:59:49" (1/1) ... [2022-12-13 11:59:49,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638ab9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:49, skipping insertion in model container [2022-12-13 11:59:49,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:59:49" (1/1) ... [2022-12-13 11:59:49,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:59:49,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:59:49,615 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/safe007_power.opt-thin001_power.opt.i[969,982] [2022-12-13 11:59:49,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:59:49,797 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:59:49,808 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/safe007_power.opt-thin001_power.opt.i[969,982] [2022-12-13 11:59:49,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:59:49,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:59:49,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:59:49,893 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:59:49,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:49 WrapperNode [2022-12-13 11:59:49,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:59:49,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:59:49,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:59:49,896 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:59:49,901 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:59:49" (1/1) ... [2022-12-13 11:59:49,934 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:59:49" (1/1) ... [2022-12-13 11:59:49,966 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2022-12-13 11:59:49,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:59:49,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:59:49,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:59:49,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:59:49,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:49" (1/1) ... [2022-12-13 11:59:49,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:49" (1/1) ... [2022-12-13 11:59:49,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:49" (1/1) ... [2022-12-13 11:59:49,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:49" (1/1) ... [2022-12-13 11:59:49,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:49" (1/1) ... [2022-12-13 11:59:49,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:49" (1/1) ... [2022-12-13 11:59:50,000 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:49" (1/1) ... [2022-12-13 11:59:50,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:49" (1/1) ... [2022-12-13 11:59:50,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:59:50,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:59:50,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:59:50,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:59:50,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:49" (1/1) ... [2022-12-13 11:59:50,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:59:50,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:59:50,066 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:59:50,084 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:59:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:59:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:59:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:59:50,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:59:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:59:50,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:59:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:59:50,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:59:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:59:50,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:59:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:59:50,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:59:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:59:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:59:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:59:50,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:59:50,099 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:59:50,266 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:59:50,268 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:59:50,527 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:59:50,750 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:59:50,750 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:59:50,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:59:50 BoogieIcfgContainer [2022-12-13 11:59:50,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:59:50,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:59:50,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:59:50,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:59:50,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:59:49" (1/3) ... [2022-12-13 11:59:50,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63231fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:59:50, skipping insertion in model container [2022-12-13 11:59:50,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:59:49" (2/3) ... [2022-12-13 11:59:50,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63231fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:59:50, skipping insertion in model container [2022-12-13 11:59:50,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:59:50" (3/3) ... [2022-12-13 11:59:50,762 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.opt-thin001_power.opt.i [2022-12-13 11:59:50,776 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:59:50,777 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:59:50,777 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:59:50,861 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:59:50,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-12-13 11:59:50,944 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 11:59:50,945 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:59:50,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 11:59:50,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2022-12-13 11:59:50,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2022-12-13 11:59:50,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:59:51,021 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-13 11:59:51,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2022-12-13 11:59:51,098 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 11:59:51,098 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:59:51,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 11:59:51,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-13 11:59:51,102 INFO L226 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-13 12:00:02,493 INFO L241 LiptonReduction]: Total number of compositions: 105 [2022-12-13 12:00:02,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:00:02,518 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;@7e7ee448, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:00:02,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 12:00:02,523 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 12:00:02,523 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:00:02,523 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:02,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:00:02,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:00:02,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:02,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1956991359, now seen corresponding path program 1 times [2022-12-13 12:00:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:02,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187665939] [2022-12-13 12:00:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:02,871 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 12:00:02,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:02,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187665939] [2022-12-13 12:00:02,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187665939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:02,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:02,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:00:02,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647799055] [2022-12-13 12:00:02,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:02,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:00:02,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:02,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:00:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:00:02,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 59 [2022-12-13 12:00:02,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 12:00:02,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:02,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 59 [2022-12-13 12:00:02,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:04,384 INFO L130 PetriNetUnfolder]: 7551/11413 cut-off events. [2022-12-13 12:00:04,385 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 12:00:04,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22300 conditions, 11413 events. 7551/11413 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 80804 event pairs, 2159 based on Foata normal form. 0/6626 useless extension candidates. Maximal degree in co-relation 22289. Up to 7569 conditions per place. [2022-12-13 12:00:04,418 INFO L137 encePairwiseOnDemand]: 55/59 looper letters, 31 selfloop transitions, 2 changer transitions 52/95 dead transitions. [2022-12-13 12:00:04,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 372 flow [2022-12-13 12:00:04,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:00:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:00:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-12-13 12:00:04,427 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 12:00:04,428 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 127 flow. Second operand 3 states and 118 transitions. [2022-12-13 12:00:04,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 372 flow [2022-12-13 12:00:04,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 95 transitions, 368 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:00:04,432 INFO L231 Difference]: Finished difference. Result has 66 places, 31 transitions, 72 flow [2022-12-13 12:00:04,434 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=66, PETRI_TRANSITIONS=31} [2022-12-13 12:00:04,436 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2022-12-13 12:00:04,436 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:04,437 INFO L89 Accepts]: Start accepts. Operand has 66 places, 31 transitions, 72 flow [2022-12-13 12:00:04,439 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:04,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:04,439 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 31 transitions, 72 flow [2022-12-13 12:00:04,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 72 flow [2022-12-13 12:00:04,444 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 12:00:04,445 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:00:04,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 77 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 12:00:04,447 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 72 flow [2022-12-13 12:00:04,447 INFO L226 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-13 12:00:04,614 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:00:04,615 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-13 12:00:04,615 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 72 flow [2022-12-13 12:00:04,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 12:00:04,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:04,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:04,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:00:04,616 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:00:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:04,617 INFO L85 PathProgramCache]: Analyzing trace with hash 896401592, now seen corresponding path program 1 times [2022-12-13 12:00:04,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:04,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462530418] [2022-12-13 12:00:04,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:04,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:04,825 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 12:00:04,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:04,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462530418] [2022-12-13 12:00:04,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462530418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:04,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:04,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:00:04,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654201652] [2022-12-13 12:00:04,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:04,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:00:04,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:00:04,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:00:04,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2022-12-13 12:00:04,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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 12:00:04,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:04,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2022-12-13 12:00:04,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:05,027 INFO L130 PetriNetUnfolder]: 1028/1764 cut-off events. [2022-12-13 12:00:05,028 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-13 12:00:05,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3444 conditions, 1764 events. 1028/1764 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10122 event pairs, 188 based on Foata normal form. 30/1483 useless extension candidates. Maximal degree in co-relation 3434. Up to 1303 conditions per place. [2022-12-13 12:00:05,036 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 34 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2022-12-13 12:00:05,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 180 flow [2022-12-13 12:00:05,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:00:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:00:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 12:00:05,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7204301075268817 [2022-12-13 12:00:05,039 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 72 flow. Second operand 3 states and 67 transitions. [2022-12-13 12:00:05,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 180 flow [2022-12-13 12:00:05,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:00:05,042 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 76 flow [2022-12-13 12:00:05,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-12-13 12:00:05,042 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -28 predicate places. [2022-12-13 12:00:05,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:05,043 INFO L89 Accepts]: Start accepts. Operand has 41 places, 31 transitions, 76 flow [2022-12-13 12:00:05,043 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:05,043 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:05,043 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 76 flow [2022-12-13 12:00:05,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 76 flow [2022-12-13 12:00:05,078 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 12:00:05,079 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:00:05,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 77 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:00:05,079 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 76 flow [2022-12-13 12:00:05,079 INFO L226 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-13 12:00:05,141 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:00:05,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 12:00:05,143 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 76 flow [2022-12-13 12:00:05,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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 12:00:05,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:05,143 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:05,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:00:05,143 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:00:05,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:05,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2018644239, now seen corresponding path program 1 times [2022-12-13 12:00:05,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:05,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768148172] [2022-12-13 12:00:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:05,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:05,260 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 12:00:05,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:05,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768148172] [2022-12-13 12:00:05,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768148172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:05,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:05,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:00:05,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881042766] [2022-12-13 12:00:05,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:05,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:00:05,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:05,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:00:05,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:00:05,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 12:00:05,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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 12:00:05,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:05,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 12:00:05,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:05,576 INFO L130 PetriNetUnfolder]: 1559/2605 cut-off events. [2022-12-13 12:00:05,576 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2022-12-13 12:00:05,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5320 conditions, 2605 events. 1559/2605 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15289 event pairs, 383 based on Foata normal form. 108/2222 useless extension candidates. Maximal degree in co-relation 5309. Up to 937 conditions per place. [2022-12-13 12:00:05,585 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 36 selfloop transitions, 3 changer transitions 6/53 dead transitions. [2022-12-13 12:00:05,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 211 flow [2022-12-13 12:00:05,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:00:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:00:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-13 12:00:05,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2022-12-13 12:00:05,589 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 76 flow. Second operand 4 states and 82 transitions. [2022-12-13 12:00:05,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 211 flow [2022-12-13 12:00:05,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:00:05,591 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 84 flow [2022-12-13 12:00:05,591 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-12-13 12:00:05,592 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -25 predicate places. [2022-12-13 12:00:05,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:05,592 INFO L89 Accepts]: Start accepts. Operand has 44 places, 30 transitions, 84 flow [2022-12-13 12:00:05,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:05,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:05,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 30 transitions, 84 flow [2022-12-13 12:00:05,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 30 transitions, 84 flow [2022-12-13 12:00:05,599 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-12-13 12:00:05,599 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:00:05,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 30 events. 0/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 66 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:00:05,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 30 transitions, 84 flow [2022-12-13 12:00:05,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 422 [2022-12-13 12:00:06,915 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:00:06,916 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1324 [2022-12-13 12:00:06,916 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 82 flow [2022-12-13 12:00:06,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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 12:00:06,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:06,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:06,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:00:06,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:00:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1831407462, now seen corresponding path program 1 times [2022-12-13 12:00:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:06,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379071359] [2022-12-13 12:00:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:06,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:00:07,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:07,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379071359] [2022-12-13 12:00:07,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379071359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:07,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:07,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:00:07,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822480718] [2022-12-13 12:00:07,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:07,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:00:07,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:07,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:00:07,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:00:07,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 12:00:07,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 12:00:07,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:07,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 12:00:07,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:07,568 INFO L130 PetriNetUnfolder]: 747/1173 cut-off events. [2022-12-13 12:00:07,568 INFO L131 PetriNetUnfolder]: For 537/537 co-relation queries the response was YES. [2022-12-13 12:00:07,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2756 conditions, 1173 events. 747/1173 cut-off events. For 537/537 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5720 event pairs, 243 based on Foata normal form. 12/938 useless extension candidates. Maximal degree in co-relation 2743. Up to 1014 conditions per place. [2022-12-13 12:00:07,575 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 30 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-12-13 12:00:07,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 178 flow [2022-12-13 12:00:07,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:00:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:00:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 12:00:07,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2022-12-13 12:00:07,576 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 82 flow. Second operand 3 states and 57 transitions. [2022-12-13 12:00:07,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 178 flow [2022-12-13 12:00:07,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 161 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 12:00:07,580 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 78 flow [2022-12-13 12:00:07,582 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-12-13 12:00:07,583 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -28 predicate places. [2022-12-13 12:00:07,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:07,583 INFO L89 Accepts]: Start accepts. Operand has 41 places, 29 transitions, 78 flow [2022-12-13 12:00:07,585 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:07,585 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:07,585 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 78 flow [2022-12-13 12:00:07,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 78 flow [2022-12-13 12:00:07,590 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 12:00:07,590 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 12:00:07,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 29 events. 0/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 78 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:00:07,590 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 78 flow [2022-12-13 12:00:07,590 INFO L226 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-13 12:00:07,619 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:00:07,624 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 12:00:07,624 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 78 flow [2022-12-13 12:00:07,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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 12:00:07,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:07,625 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:07,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:00:07,625 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:00:07,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:07,625 INFO L85 PathProgramCache]: Analyzing trace with hash -939000182, now seen corresponding path program 1 times [2022-12-13 12:00:07,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:07,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642192560] [2022-12-13 12:00:07,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:07,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:07,827 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 12:00:07,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:07,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642192560] [2022-12-13 12:00:07,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642192560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:07,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:07,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:00:07,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949193767] [2022-12-13 12:00:07,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:07,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:00:07,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:07,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:00:07,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:00:07,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 12:00:07,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 12:00:07,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:07,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 12:00:07,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:08,045 INFO L130 PetriNetUnfolder]: 1248/2024 cut-off events. [2022-12-13 12:00:08,045 INFO L131 PetriNetUnfolder]: For 508/508 co-relation queries the response was YES. [2022-12-13 12:00:08,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4267 conditions, 2024 events. 1248/2024 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 10253 event pairs, 338 based on Foata normal form. 80/1689 useless extension candidates. Maximal degree in co-relation 4255. Up to 749 conditions per place. [2022-12-13 12:00:08,053 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 31 selfloop transitions, 3 changer transitions 10/50 dead transitions. [2022-12-13 12:00:08,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 209 flow [2022-12-13 12:00:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:00:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:00:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-13 12:00:08,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6293103448275862 [2022-12-13 12:00:08,056 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 78 flow. Second operand 4 states and 73 transitions. [2022-12-13 12:00:08,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 209 flow [2022-12-13 12:00:08,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 203 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:00:08,057 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 86 flow [2022-12-13 12:00:08,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-13 12:00:08,059 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -25 predicate places. [2022-12-13 12:00:08,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:08,059 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 86 flow [2022-12-13 12:00:08,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:08,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:08,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 86 flow [2022-12-13 12:00:08,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 28 transitions, 86 flow [2022-12-13 12:00:08,067 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-13 12:00:08,067 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 12:00:08,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 28 events. 0/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 54 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:00:08,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 28 transitions, 86 flow [2022-12-13 12:00:08,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 300 [2022-12-13 12:00:08,158 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:00:08,159 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 12:00:08,160 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 84 flow [2022-12-13 12:00:08,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 12:00:08,160 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:08,160 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:08,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:00:08,160 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:00:08,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:08,160 INFO L85 PathProgramCache]: Analyzing trace with hash -938974235, now seen corresponding path program 1 times [2022-12-13 12:00:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:08,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160688204] [2022-12-13 12:00:08,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:08,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:09,207 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 12:00:09,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:09,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160688204] [2022-12-13 12:00:09,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160688204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:09,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:09,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:00:09,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445795429] [2022-12-13 12:00:09,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:09,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:00:09,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:09,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:00:09,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:00:09,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 12:00:09,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 12:00:09,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:09,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 12:00:09,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:09,388 INFO L130 PetriNetUnfolder]: 564/923 cut-off events. [2022-12-13 12:00:09,388 INFO L131 PetriNetUnfolder]: For 707/707 co-relation queries the response was YES. [2022-12-13 12:00:09,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2172 conditions, 923 events. 564/923 cut-off events. For 707/707 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4036 event pairs, 150 based on Foata normal form. 6/717 useless extension candidates. Maximal degree in co-relation 2158. Up to 794 conditions per place. [2022-12-13 12:00:09,397 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 30 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2022-12-13 12:00:09,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 200 flow [2022-12-13 12:00:09,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:00:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:00:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-13 12:00:09,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2022-12-13 12:00:09,399 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 84 flow. Second operand 5 states and 69 transitions. [2022-12-13 12:00:09,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 200 flow [2022-12-13 12:00:09,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 178 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 12:00:09,401 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 111 flow [2022-12-13 12:00:09,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-13 12:00:09,403 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -26 predicate places. [2022-12-13 12:00:09,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:09,404 INFO L89 Accepts]: Start accepts. Operand has 43 places, 32 transitions, 111 flow [2022-12-13 12:00:09,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:09,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:09,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 111 flow [2022-12-13 12:00:09,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 111 flow [2022-12-13 12:00:09,411 INFO L130 PetriNetUnfolder]: 10/60 cut-off events. [2022-12-13 12:00:09,412 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-12-13 12:00:09,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 60 events. 10/60 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 214 event pairs, 4 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 110. Up to 20 conditions per place. [2022-12-13 12:00:09,412 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 111 flow [2022-12-13 12:00:09,412 INFO L226 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-13 12:00:13,299 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] L778-->L790: Formula: (and (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$r_buff0_thd2~0_In_3 v_~y$r_buff1_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_19) (= v_~y$w_buff0_used~0_Out_2 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|) (= v_~y$r_buff1_thd3~0_Out_2 v_~y$r_buff0_thd3~0_In_11) (= v_~y$r_buff0_thd0~0_In_3 v_~y$r_buff1_thd0~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff1_used~0_Out_2 v_~y$w_buff0_used~0_In_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_In_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_3, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [634] L826-->L833: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_100 256) 0))) (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_181 256) 0))) (.cse4 (not .cse10)) (.cse7 (= (mod v_~y$w_buff1_used~0_175 256) 0)) (.cse8 (= (mod v_~y$r_buff1_thd3~0_96 256) 0)) (.cse9 (= (mod v_~y$w_buff0_used~0_182 256) 0))) (let ((.cse0 (select |v_#memory_int_145| |v_~#y~0.base_100|)) (.cse3 (not .cse9)) (.cse1 (not .cse8)) (.cse6 (not .cse7)) (.cse11 (and .cse2 .cse4))) (and (= (store |v_#memory_int_145| |v_~#y~0.base_100| (store .cse0 |v_~#y~0.offset_100| |v_P2_#t~ite24_25|)) |v_#memory_int_144|) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_174 256) 0))) (and .cse2 (not (= (mod v_~y$r_buff0_thd3~0_99 256) 0)))) 0 v_~y$r_buff1_thd3~0_96) v_~y$r_buff1_thd3~0_95) (= (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_182) v_~y$w_buff0_used~0_181) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem22_1| |v_P2_#t~mem22_30|))) (or (and (or (and .cse5 .cse1 (= |v_P2_#t~ite23_25| v_~y$w_buff1~0_70) .cse6) (and (= |v_P2_#t~mem22_30| (select .cse0 |v_~#y~0.offset_100|)) (or .cse7 .cse8) (= |v_P2_#t~ite23_25| |v_P2_#t~mem22_30|))) (= |v_P2_#t~ite24_25| |v_P2_#t~ite23_25|) (or .cse9 .cse10)) (and .cse5 .cse3 (= |v_P2_#t~ite23_25| |v_P2Thread1of1ForFork0_#t~ite23_1|) (= |v_P2_#t~ite24_25| v_~y$w_buff0~0_69) .cse4))) (= v_~y$w_buff1_used~0_174 (ite (or .cse11 (and .cse1 .cse6)) 0 v_~y$w_buff1_used~0_175)) (= v_~y$r_buff0_thd3~0_99 (ite .cse11 0 v_~y$r_buff0_thd3~0_100)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_96, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_70, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, ~y$w_buff0~0=v_~y$w_buff0~0_69, #memory_int=|v_#memory_int_145|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_1|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_175} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_95, ~#y~0.offset=|v_~#y~0.offset_100|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_69, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_144|, ~#y~0.base=|v_~#y~0.base_100|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_174} AuxVars[|v_P2_#t~ite24_25|, |v_P2_#t~ite23_25|, |v_P2_#t~mem22_30|] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~y$w_buff1_used~0] [2022-12-13 12:00:13,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [626] L778-->L790: Formula: (and (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$r_buff0_thd2~0_In_3 v_~y$r_buff1_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_19) (= v_~y$w_buff0_used~0_Out_2 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|) (= v_~y$r_buff1_thd3~0_Out_2 v_~y$r_buff0_thd3~0_In_11) (= v_~y$r_buff0_thd0~0_In_3 v_~y$r_buff1_thd0~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff1_used~0_Out_2 v_~y$w_buff0_used~0_In_15)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_In_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_3, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_Out_2, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_In_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_3, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [701] L2-1-->L866: Formula: (let ((.cse6 (= (mod v_~y$r_buff0_thd0~0_51 256) 0))) (let ((.cse11 (= (mod v_~y$r_buff1_thd0~0_55 256) 0)) (.cse10 (= (mod v_~y$w_buff1_used~0_256 256) 0)) (.cse4 (not (= (mod v_~y$w_buff0_used~0_271 256) 0))) (.cse2 (not .cse6)) (.cse5 (= (mod v_~y$w_buff0_used~0_272 256) 0))) (let ((.cse1 (not .cse5)) (.cse0 (and .cse4 .cse2)) (.cse7 (not .cse10)) (.cse3 (not .cse11)) (.cse9 (select |v_#memory_int_243| |v_~#y~0.base_154|))) (and (= v_~y$r_buff0_thd0~0_50 (ite .cse0 0 v_~y$r_buff0_thd0~0_51)) (= v_~y$w_buff0_used~0_271 (ite (and .cse1 .cse2) 0 v_~y$w_buff0_used~0_272)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_255 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_50 256) 0)))) 0 v_~y$r_buff1_thd0~0_55) v_~y$r_buff1_thd0~0_54) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~mem31#1_43| |v_ULTIMATE.start_main_#t~mem31#1_41|))) (or (and (or .cse5 .cse6) (or (and .cse7 (= v_~y$w_buff1~0_135 |v_ULTIMATE.start_main_#t~ite32#1_38|) .cse8 .cse3) (and (= |v_ULTIMATE.start_main_#t~mem31#1_41| (select .cse9 |v_~#y~0.offset_154|)) (= |v_ULTIMATE.start_main_#t~mem31#1_41| |v_ULTIMATE.start_main_#t~ite32#1_38|) (or .cse10 .cse11))) (= |v_ULTIMATE.start_main_#t~ite33#1_33| |v_ULTIMATE.start_main_#t~ite32#1_38|)) (and .cse8 (= |v_ULTIMATE.start_main_#t~ite32#1_38| |v_ULTIMATE.start_main_#t~ite32#1_40|) .cse1 .cse2 (= |v_ULTIMATE.start_main_#t~ite33#1_33| v_~y$w_buff0~0_147)))) (= (ite (or .cse0 (and .cse7 .cse3)) 0 v_~y$w_buff1_used~0_256) v_~y$w_buff1_used~0_255) (= (store |v_#memory_int_243| |v_~#y~0.base_154| (store .cse9 |v_~#y~0.offset_154| |v_ULTIMATE.start_main_#t~ite33#1_33|)) |v_#memory_int_242|))))) InVars {~#y~0.offset=|v_~#y~0.offset_154|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_272, ~y$w_buff1~0=v_~y$w_buff1~0_135, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_147, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_40|, #memory_int=|v_#memory_int_243|, ~#y~0.base=|v_~#y~0.base_154|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_55, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_256} OutVars{~#y~0.offset=|v_~#y~0.offset_154|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_271, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_32|, ~y$w_buff0~0=v_~y$w_buff0~0_147, #memory_int=|v_#memory_int_242|, ~#y~0.base=|v_~#y~0.base_154|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_255} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_38|, |v_ULTIMATE.start_main_#t~mem31#1_41|, |v_ULTIMATE.start_main_#t~ite33#1_33|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~mem31#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ULTIMATE.start_main_#t~ite32#1, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:00:15,098 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:00:15,099 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5696 [2022-12-13 12:00:15,099 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 123 flow [2022-12-13 12:00:15,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 12:00:15,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:15,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:15,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:00:15,100 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:00:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1405441713, now seen corresponding path program 1 times [2022-12-13 12:00:15,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:15,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147070301] [2022-12-13 12:00:15,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:16,376 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 12:00:16,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:16,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147070301] [2022-12-13 12:00:16,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147070301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:16,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:16,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:00:16,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983422700] [2022-12-13 12:00:16,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:16,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:00:16,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:16,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:00:16,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:00:16,378 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2022-12-13 12:00:16,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 12:00:16,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:16,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2022-12-13 12:00:16,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:16,595 INFO L130 PetriNetUnfolder]: 562/921 cut-off events. [2022-12-13 12:00:16,595 INFO L131 PetriNetUnfolder]: For 637/637 co-relation queries the response was YES. [2022-12-13 12:00:16,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2307 conditions, 921 events. 562/921 cut-off events. For 637/637 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4081 event pairs, 171 based on Foata normal form. 21/719 useless extension candidates. Maximal degree in co-relation 2294. Up to 580 conditions per place. [2022-12-13 12:00:16,599 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 31 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2022-12-13 12:00:16,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 247 flow [2022-12-13 12:00:16,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:00:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:00:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-13 12:00:16,600 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47096774193548385 [2022-12-13 12:00:16,600 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 123 flow. Second operand 5 states and 73 transitions. [2022-12-13 12:00:16,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 247 flow [2022-12-13 12:00:16,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 242 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 12:00:16,602 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 171 flow [2022-12-13 12:00:16,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2022-12-13 12:00:16,602 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -22 predicate places. [2022-12-13 12:00:16,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:16,602 INFO L89 Accepts]: Start accepts. Operand has 47 places, 34 transitions, 171 flow [2022-12-13 12:00:16,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:16,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:16,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 171 flow [2022-12-13 12:00:16,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 34 transitions, 171 flow [2022-12-13 12:00:16,611 INFO L130 PetriNetUnfolder]: 12/62 cut-off events. [2022-12-13 12:00:16,611 INFO L131 PetriNetUnfolder]: For 84/89 co-relation queries the response was YES. [2022-12-13 12:00:16,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 62 events. 12/62 cut-off events. For 84/89 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 224 event pairs, 4 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 163. Up to 20 conditions per place. [2022-12-13 12:00:16,612 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 171 flow [2022-12-13 12:00:16,612 INFO L226 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-13 12:00:17,354 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:00:17,355 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 753 [2022-12-13 12:00:17,355 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 175 flow [2022-12-13 12:00:17,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 12:00:17,355 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:17,355 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:17,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:00:17,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:00:17,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1405498412, now seen corresponding path program 1 times [2022-12-13 12:00:17,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:17,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919813803] [2022-12-13 12:00:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:17,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:17,510 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 12:00:17,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:17,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919813803] [2022-12-13 12:00:17,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919813803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:17,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:17,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:00:17,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493067458] [2022-12-13 12:00:17,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:17,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:00:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:17,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:00:17,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:00:17,513 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 12:00:17,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:17,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:17,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 12:00:17,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:17,674 INFO L130 PetriNetUnfolder]: 947/1447 cut-off events. [2022-12-13 12:00:17,674 INFO L131 PetriNetUnfolder]: For 2385/2385 co-relation queries the response was YES. [2022-12-13 12:00:17,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4442 conditions, 1447 events. 947/1447 cut-off events. For 2385/2385 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6714 event pairs, 315 based on Foata normal form. 9/902 useless extension candidates. Maximal degree in co-relation 4426. Up to 1429 conditions per place. [2022-12-13 12:00:17,683 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 36 selfloop transitions, 10 changer transitions 1/49 dead transitions. [2022-12-13 12:00:17,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 344 flow [2022-12-13 12:00:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:00:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:00:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-13 12:00:17,685 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5698924731182796 [2022-12-13 12:00:17,685 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 175 flow. Second operand 3 states and 53 transitions. [2022-12-13 12:00:17,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 344 flow [2022-12-13 12:00:17,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 296 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-13 12:00:17,689 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 204 flow [2022-12-13 12:00:17,689 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2022-12-13 12:00:17,690 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -24 predicate places. [2022-12-13 12:00:17,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:17,690 INFO L89 Accepts]: Start accepts. Operand has 45 places, 41 transitions, 204 flow [2022-12-13 12:00:17,691 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:17,691 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:17,691 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 41 transitions, 204 flow [2022-12-13 12:00:17,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 204 flow [2022-12-13 12:00:17,752 INFO L130 PetriNetUnfolder]: 527/936 cut-off events. [2022-12-13 12:00:17,753 INFO L131 PetriNetUnfolder]: For 301/307 co-relation queries the response was YES. [2022-12-13 12:00:17,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 936 events. 527/936 cut-off events. For 301/307 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 5750 event pairs, 219 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 2257. Up to 640 conditions per place. [2022-12-13 12:00:17,759 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 41 transitions, 204 flow [2022-12-13 12:00:17,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 272 [2022-12-13 12:00:17,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [791] $Ultimate##0-->L833: Formula: (let ((.cse37 (mod v_~y$w_buff0_used~0_585 256)) (.cse38 (mod v_~weak$$choice0~0_129 256))) (let ((.cse25 (= .cse38 0)) (.cse24 (= (mod v_~y$w_buff1_used~0_543 256) 0)) (.cse21 (= .cse37 0)) (.cse28 (= (mod v_~y$r_buff0_thd3~0_275 256) 0)) (.cse12 (= (mod v_~weak$$choice2~0_102 256) 0))) (let ((.cse13 (not .cse12)) (.cse29 (not .cse28)) (.cse30 (not .cse21)) (.cse23 (not .cse24)) (.cse26 (= (mod v_~y$r_buff1_thd3~0_283 256) 0)) (.cse27 (= (mod v_~weak$$choice1~0_230 256) 0)) (.cse22 (not .cse25))) (let ((.cse10 (ite (= (ite .cse13 .cse37 (ite .cse21 .cse37 (ite (and .cse30 .cse29) 0 (ite (and .cse30 .cse23 .cse28 .cse26) (ite (or .cse27 .cse22) 1 0) .cse38)))) 0) 0 1))) (let ((.cse7 (= (mod .cse10 256) 0))) (let ((.cse1 (not .cse7))) (let ((.cse36 (and .cse1 .cse29))) (let ((.cse32 (ite .cse13 v_~y$w_buff1_used~0_543 (ite .cse7 v_~y$w_buff1_used~0_543 (ite .cse36 0 (ite (and .cse23 .cse1 .cse28 .cse26) v_~weak$$choice0~0_129 0)))))) (let ((.cse4 (= (mod .cse32 256) 0))) (let ((.cse6 (not .cse4))) (let ((.cse35 (ite .cse13 v_~y$r_buff0_thd3~0_275 (ite .cse7 v_~y$r_buff0_thd3~0_275 (ite .cse36 0 (ite (and .cse1 .cse6 .cse28 .cse26) v_~y$r_buff0_thd3~0_275 0)))))) (let ((.cse8 (= (mod .cse35 256) 0))) (let ((.cse2 (not .cse8))) (let ((.cse9 (and .cse1 .cse2))) (let ((.cse34 (ite .cse13 v_~y$r_buff1_thd3~0_283 (ite .cse7 v_~y$r_buff1_thd3~0_283 (ite .cse9 0 (ite (and .cse1 .cse6 .cse8 .cse26) (ite .cse22 v_~y$r_buff1_thd3~0_283 0) 0)))))) (let ((.cse33 (not (= (mod v_~y$w_buff0_used~0_583 256) 0))) (.cse3 (= (mod .cse34 256) 0)) (.cse14 (select |v_#memory_int_600| |v_~#y~0.base_282|))) (let ((.cse11 (select .cse14 |v_~#y~0.offset_282|)) (.cse5 (not .cse3)) (.cse31 (and .cse33 .cse2))) (and (= 0 v_~y$flush_delayed~0_90) (= v_~weak$$choice2~0_102 |v_P2Thread1of1ForFork0_#t~nondet7_74|) (= v_~y$w_buff0~0_345 v_~y$w_buff0~0_344) (let ((.cse0 (= |v_P2Thread1of1ForFork0_#t~mem22_60| |v_P2_#t~mem22_59|))) (or (and (= |v_P2_#t~ite23_54| |v_P2Thread1of1ForFork0_#t~ite23_60|) .cse0 .cse1 .cse2 (= |v_P2_#t~ite24_54| v_~y$w_buff0~0_344)) (and (or (and (= |v_P2_#t~ite23_54| |v_P2_#t~mem22_59|) (or .cse3 .cse4) (= |v_P2_#t~ite21_68| |v_P2_#t~mem22_59|)) (and .cse5 .cse0 (= v_~y$w_buff1~0_313 |v_P2_#t~ite23_54|) .cse6)) (or .cse7 .cse8) (= |v_P2_#t~ite24_54| |v_P2_#t~ite23_54|)))) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_174 |v_~#y~0.base_282|) (= |v_~#y~0.offset_282| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_174) (= v_~y$w_buff0_used~0_583 (ite .cse9 0 .cse10)) (= v_~weak$$choice1~0_230 |v_P2Thread1of1ForFork0_#t~nondet9_74|) (= v_~y$mem_tmp~0_66 .cse11) (or (and .cse12 (= |v_P2_#t~mem20_73| v_~__unbuffered_p2_EAX~0_291) (= |v_P2_#t~ite21_68| |v_P2_#t~mem20_73|)) (and .cse13 (= |v_P2Thread1of1ForFork0_#t~mem20_74| |v_P2_#t~mem20_73|) (= |v_P2_#t~ite21_68| v_~y$mem_tmp~0_66))) (= |v_#memory_int_598| (store |v_#memory_int_600| |v_~#y~0.base_282| (store .cse14 |v_~#y~0.offset_282| |v_P2_#t~ite24_54|))) (let ((.cse15 (= |v_P2_#t~ite15_88| |v_P2Thread1of1ForFork0_#t~ite15_74|)) (.cse16 (= |v_P2_#t~ite16_86| |v_P2Thread1of1ForFork0_#t~ite16_74|)) (.cse17 (= |v_P2Thread1of1ForFork0_#t~mem11_74| |v_P2_#t~mem11_93|)) (.cse18 (= |v_P2Thread1of1ForFork0_#t~mem13_74| |v_P2_#t~mem13_109|)) (.cse19 (= |v_P2Thread1of1ForFork0_#t~ite14_74| |v_P2_#t~ite14_106|)) (.cse20 (= |v_P2_#t~ite12_92| |v_P2Thread1of1ForFork0_#t~ite12_74|))) (or (and (= .cse11 |v_P2_#t~mem10_73|) .cse15 .cse16 .cse17 (= |v_P2_#t~ite17_76| |v_P2Thread1of1ForFork0_#t~ite17_73|) .cse18 .cse19 .cse20 (= |v_P2_#t~mem10_73| v_~__unbuffered_p2_EAX~0_291) .cse21) (and (= |v_P2Thread1of1ForFork0_#t~mem10_74| |v_P2_#t~mem10_73|) (or (and (or (and .cse17 (= |v_P2_#t~ite15_88| |v_P2_#t~ite16_86|) (or (and (= |v_P2_#t~ite15_88| (ite .cse22 v_~y$w_buff1~0_314 v_~y$w_buff0~0_345)) .cse18 .cse23 .cse19) (and (= |v_P2_#t~ite15_88| |v_P2_#t~ite14_106|) .cse24 (or (and (= v_~y$w_buff0~0_345 |v_P2_#t~ite14_106|) .cse18 .cse22) (and (= |v_P2_#t~mem13_109| |v_P2_#t~ite14_106|) (= .cse11 |v_P2_#t~mem13_109|) .cse25)))) .cse20 (or .cse24 (not .cse26))) (and .cse15 .cse18 .cse23 (= |v_P2_#t~ite16_86| |v_P2_#t~ite12_92|) .cse19 (or (and (= |v_P2_#t~ite12_92| |v_P2_#t~mem11_93|) (= .cse11 |v_P2_#t~mem11_93|) .cse22) (and .cse17 .cse25 (= |v_P2_#t~ite12_92| (ite (not .cse27) v_~y$w_buff0~0_345 v_~y$w_buff1~0_314)))) .cse26)) (= |v_P2_#t~ite16_86| |v_P2_#t~ite17_76|) .cse28) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |v_P2_#t~ite17_76| v_~y$w_buff0~0_345) .cse29)) .cse30 (= |v_P2_#t~ite17_76| v_~__unbuffered_p2_EAX~0_291)))) (= |v_P2Thread1of1ForFork0_#in~arg.offset_39| v_P2Thread1of1ForFork0_~arg.offset_39) (= v_~y$w_buff1_used~0_541 (ite (or (and .cse5 .cse6) .cse31) 0 .cse32)) (= v_~y$w_buff1~0_314 v_~y$w_buff1~0_313) (= v_~y$r_buff1_thd3~0_281 (ite (or (and .cse5 (not (= (mod v_~y$w_buff1_used~0_541 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_273 256) 0)) .cse33)) 0 .cse34)) (= |v_P2Thread1of1ForFork0_#in~arg.base_39| v_P2Thread1of1ForFork0_~arg.base_39) (= (ite .cse31 0 .cse35) v_~y$r_buff0_thd3~0_273) (= v_~weak$$choice0~0_129 |v_P2Thread1of1ForFork0_#t~nondet6_74|) (= v_~z~0_55 1) (= v_~__unbuffered_p2_EAX$read_delayed~0_171 1))))))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_282|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_585, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_74|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_74|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_74|, ~#y~0.base=|v_~#y~0.base_282|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_283, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_275, ~y$w_buff0~0=v_~y$w_buff0~0_345, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_60|, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_74|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_74|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_74|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_74|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_74|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_74|, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_73|, ~y$w_buff1~0=v_~y$w_buff1~0_314, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_74|, #memory_int=|v_#memory_int_600|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_60|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_543, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_74|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_39|, ~#y~0.offset=|v_~#y~0.offset_282|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_583, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_174, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_174, ~#y~0.base=|v_~#y~0.base_282|, ~y$mem_tmp~0=v_~y$mem_tmp~0_66, ~weak$$choice1~0=v_~weak$$choice1~0_230, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_281, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_39|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_273, ~y$w_buff0~0=v_~y$w_buff0~0_344, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_32|, ~y$flush_delayed~0=v_~y$flush_delayed~0_90, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_291, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_39|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_39, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_171, ~weak$$choice0~0=v_~weak$$choice0~0_129, ~y$w_buff1~0=v_~y$w_buff1~0_313, #memory_int=|v_#memory_int_598|, ~z~0=v_~z~0_55, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_39|, ~weak$$choice2~0=v_~weak$$choice2~0_102, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_541} AuxVars[|v_P2_#t~ite24_54|, |v_P2_#t~ite23_54|, |v_P2_#t~mem11_93|, |v_P2_#t~ite14_106|, |v_P2_#t~mem20_73|, |v_P2_#t~mem22_59|, |v_P2_#t~mem13_109|, |v_P2_#t~ite16_86|, |v_P2_#t~ite12_92|, |v_P2_#t~ite17_76|, |v_P2_#t~ite21_68|, |v_P2_#t~mem10_73|, |v_P2_#t~ite15_88|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~y$flush_delayed~0, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem10, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, #memory_int, P2Thread1of1ForFork0_#t~mem22, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [790] $Ultimate##0-->L766: Formula: (and (= v_~x~0_41 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~z~0_53 v_~__unbuffered_p0_EAX~0_135) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~z~0=v_~z~0_53, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~z~0=v_~z~0_53, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_41, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 12:00:20,024 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [789] $Ultimate##0-->L826: Formula: (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_248 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_546 256) 0)) (.cse24 (mod v_~y$w_buff0_used~0_547 256)) (.cse25 (mod v_~weak$$choice0~0_123 256))) (let ((.cse26 (= 0 (mod v_~weak$$choice2~0_96 256))) (.cse7 (select |v_#memory_int_566| |v_~#y~0.base_268|)) (.cse15 (= .cse25 0)) (.cse9 (= (mod v_~y$w_buff1_used~0_508 256) 0)) (.cse22 (= .cse24 0)) (.cse3 (not .cse1)) (.cse21 (not .cse4))) (let ((.cse2 (and .cse3 .cse21)) (.cse6 (not (= (mod v_~y$w_buff1_used~0_507 256) 0))) (.cse8 (not .cse22)) (.cse12 (not .cse9)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_254 256) 0)) (.cse11 (not .cse15)) (.cse19 (= (mod v_~weak$$choice1~0_224 256) 0)) (.cse16 (select .cse7 |v_~#y~0.offset_268|)) (.cse0 (not .cse26))) (and (= 0 v_~y$flush_delayed~0_84) (= v_~__unbuffered_p2_EAX$read_delayed~0_163 1) (= (ite .cse0 v_~y$r_buff0_thd3~0_248 (ite .cse1 v_~y$r_buff0_thd3~0_248 (ite .cse2 0 (ite (and .cse3 .cse4 .cse5 .cse6) v_~y$r_buff0_thd3~0_248 0)))) v_~y$r_buff0_thd3~0_247) (= |v_~#y~0.offset_268| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_166) (= |v_#memory_int_565| (store |v_#memory_int_566| |v_~#y~0.base_268| (store .cse7 |v_~#y~0.offset_268| |v_P2_#t~ite21_59|))) (= v_~weak$$choice2~0_96 |v_P2Thread1of1ForFork0_#t~nondet7_62|) (let ((.cse10 (= |v_P2Thread1of1ForFork0_#t~mem11_62| |v_P2_#t~mem11_84|)) (.cse18 (= |v_P2_#t~ite15_79| |v_P2Thread1of1ForFork0_#t~ite15_62|)) (.cse20 (= |v_P2_#t~ite16_77| |v_P2Thread1of1ForFork0_#t~ite16_62|)) (.cse13 (= |v_P2_#t~ite14_97| |v_P2Thread1of1ForFork0_#t~ite14_62|)) (.cse17 (= |v_P2_#t~ite12_83| |v_P2Thread1of1ForFork0_#t~ite12_62|)) (.cse14 (= |v_P2Thread1of1ForFork0_#t~mem13_62| |v_P2_#t~mem13_100|))) (or (and (= |v_P2Thread1of1ForFork0_#t~mem10_62| |v_P2_#t~mem10_64|) .cse8 (or (and (= |v_P2_#t~ite16_77| |v_P2_#t~ite17_67|) (or (and (or .cse9 (not .cse5)) .cse10 (= |v_P2_#t~ite15_79| |v_P2_#t~ite16_77|) (or (and (= |v_P2_#t~ite15_79| (ite .cse11 v_~y$w_buff1~0_293 v_~y$w_buff0~0_322)) .cse12 .cse13 .cse14) (and (= |v_P2_#t~ite15_79| |v_P2_#t~ite14_97|) .cse9 (or (and (= |v_P2_#t~ite14_97| v_~y$w_buff0~0_322) .cse11 .cse14) (and .cse15 (= |v_P2_#t~ite14_97| |v_P2_#t~mem13_100|) (= .cse16 |v_P2_#t~mem13_100|))))) .cse17) (and .cse18 .cse12 .cse13 .cse5 (or (and .cse11 (= .cse16 |v_P2_#t~mem11_84|) (= |v_P2_#t~ite12_83| |v_P2_#t~mem11_84|)) (and .cse15 .cse10 (= |v_P2_#t~ite12_83| (ite (not .cse19) v_~y$w_buff0~0_322 v_~y$w_buff1~0_293)))) (= |v_P2_#t~ite16_77| |v_P2_#t~ite12_83|) .cse14)) .cse4) (and .cse10 (= |v_P2_#t~ite17_67| v_~y$w_buff0~0_322) .cse18 .cse20 .cse13 .cse17 .cse14 .cse21)) (= |v_P2_#t~ite17_67| v_~__unbuffered_p2_EAX~0_283)) (and .cse22 .cse10 (= .cse16 |v_P2_#t~mem10_64|) .cse18 .cse20 .cse13 (= |v_P2_#t~ite17_67| |v_P2Thread1of1ForFork0_#t~ite17_61|) (= |v_P2_#t~mem10_64| v_~__unbuffered_p2_EAX~0_283) .cse17 .cse14))) (= v_~y$w_buff1~0_293 v_~y$w_buff1~0_292) (= v_~__unbuffered_p2_EAX$read_delayed_var~0.base_166 |v_~#y~0.base_268|) (= v_~y$w_buff1_used~0_507 (ite .cse0 v_~y$w_buff1_used~0_508 (ite .cse1 v_~y$w_buff1_used~0_508 (ite .cse2 0 (ite (and .cse3 .cse12 .cse4 .cse5) v_~weak$$choice0~0_123 0))))) (= |v_P2Thread1of1ForFork0_#in~arg.base_33| v_P2Thread1of1ForFork0_~arg.base_33) (= (ite .cse0 v_~y$r_buff1_thd3~0_254 (ite .cse1 v_~y$r_buff1_thd3~0_254 (let ((.cse23 (= (mod v_~y$r_buff0_thd3~0_247 256) 0))) (ite (and .cse3 (not .cse23)) 0 (ite (and .cse3 .cse23 .cse5 .cse6) (ite .cse11 v_~y$r_buff1_thd3~0_254 0) 0))))) v_~y$r_buff1_thd3~0_253) (= v_~y$w_buff0_used~0_546 (ite (= (ite .cse0 .cse24 (ite .cse22 .cse24 (ite (and .cse8 .cse21) 0 (ite (and .cse8 .cse12 .cse4 .cse5) (ite (or .cse11 .cse19) 1 0) .cse25)))) 0) 0 1)) (= v_~weak$$choice1~0_224 |v_P2Thread1of1ForFork0_#t~nondet9_62|) (= v_~y$w_buff0~0_322 v_~y$w_buff0~0_321) (= v_~z~0_47 1) (= v_~weak$$choice0~0_123 |v_P2Thread1of1ForFork0_#t~nondet6_62|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_33| v_P2Thread1of1ForFork0_~arg.offset_33) (= v_~y$mem_tmp~0_60 .cse16) (or (and (= |v_P2Thread1of1ForFork0_#t~mem20_62| |v_P2_#t~mem20_64|) .cse0 (= |v_P2_#t~ite21_59| v_~y$mem_tmp~0_60)) (and (= |v_P2_#t~mem20_64| v_~__unbuffered_p2_EAX~0_283) (= |v_P2_#t~ite21_59| |v_P2_#t~mem20_64|) .cse26)))))) InVars {~#y~0.offset=|v_~#y~0.offset_268|, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_33|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_547, P2Thread1of1ForFork0_#t~nondet9=|v_P2Thread1of1ForFork0_#t~nondet9_62|, P2Thread1of1ForFork0_#t~nondet7=|v_P2Thread1of1ForFork0_#t~nondet7_62|, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_62|, ~#y~0.base=|v_~#y~0.base_268|, P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_62|, P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_62|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_62|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_254, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_61|, ~y$w_buff1~0=v_~y$w_buff1~0_293, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_248, ~y$w_buff0~0=v_~y$w_buff0~0_322, P2Thread1of1ForFork0_#t~ite12=|v_P2Thread1of1ForFork0_#t~ite12_62|, #memory_int=|v_#memory_int_566|, P2Thread1of1ForFork0_#t~mem11=|v_P2Thread1of1ForFork0_#t~mem11_62|, P2Thread1of1ForFork0_#t~mem13=|v_P2Thread1of1ForFork0_#t~mem13_62|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_33|, P2Thread1of1ForFork0_#t~mem10=|v_P2Thread1of1ForFork0_#t~mem10_62|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_508, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_62|} OutVars{P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_33|, ~#y~0.offset=|v_~#y~0.offset_268|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_546, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_166, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_166, ~#y~0.base=|v_~#y~0.base_268|, ~y$mem_tmp~0=v_~y$mem_tmp~0_60, ~weak$$choice1~0=v_~weak$$choice1~0_224, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_253, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_33|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_247, ~y$w_buff0~0=v_~y$w_buff0~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_84, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_283, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_33|, P2Thread1of1ForFork0_#t~mem8=|v_P2Thread1of1ForFork0_#t~mem8_33|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_33, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_163, ~weak$$choice0~0=v_~weak$$choice0~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_292, #memory_int=|v_#memory_int_565|, ~z~0=v_~z~0_47, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_33|, ~weak$$choice2~0=v_~weak$$choice2~0_96, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_33|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_507} AuxVars[|v_P2_#t~mem11_84|, |v_P2_#t~mem13_100|, |v_P2_#t~ite21_59|, |v_P2_#t~mem10_64|, |v_P2_#t~ite15_79|, |v_P2_#t~ite17_67|, |v_P2_#t~mem20_64|, |v_P2_#t~ite16_77|, |v_P2_#t~ite12_83|, |v_P2_#t~ite14_97|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet9, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, P2Thread1of1ForFork0_#t~nondet7, ~__unbuffered_p2_EAX$read_delayed_var~0.base, P2Thread1of1ForFork0_#t~nondet6, ~y$mem_tmp~0, ~weak$$choice1~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, P2Thread1of1ForFork0_#t~mem11, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#t~mem13, P2Thread1of1ForFork0_#t~mem10, P2Thread1of1ForFork0_#t~mem8, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX$read_delayed~0, P2Thread1of1ForFork0_#t~ite14, ~weak$$choice0~0, P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, P2Thread1of1ForFork0_#t~ite17, ~y$w_buff1~0, P2Thread1of1ForFork0_#t~ite12, #memory_int, ~z~0, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, ~y$w_buff1_used~0, P2Thread1of1ForFork0_#t~mem20] and [790] $Ultimate##0-->L766: Formula: (and (= v_~x~0_41 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~z~0_53 v_~__unbuffered_p0_EAX~0_135) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~z~0=v_~z~0_53, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_135, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~z~0=v_~z~0_53, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_41, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 12:00:21,173 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [775] L855-3-->L2-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_Out_2|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [797] $Ultimate##0-->L866: Formula: (let ((.cse5 (= 0 (mod v_~y$r_buff0_thd0~0_157 256)))) (let ((.cse1 (not .cse5)) (.cse0 (not (= (mod v_~y$w_buff0_used~0_615 256) 0)))) (let ((.cse3 (and .cse1 .cse0)) (.cse2 (= (mod v_~y$w_buff0_used~0_616 256) 0)) (.cse4 (select |v_#memory_int_625| |v_~#y~0.base_294|))) (and (= v_~y$r_buff1_thd0~0_168 (ite (or (and (not (= (mod v_~y$r_buff0_thd0~0_156 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_563 256) 0)))) 0 v_~y$r_buff0_thd0~0_157)) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61| 0)) (= v_~y$r_buff0_thd3~0_293 v_~y$r_buff1_thd3~0_299) (= v_~y$w_buff1_used~0_563 (ite (or (and .cse1 (not .cse2)) .cse3) 0 v_~y$w_buff0_used~0_616)) (= v_~y$r_buff0_thd0~0_156 (ite .cse3 0 v_~y$r_buff0_thd0~0_157)) (= v_~y$w_buff0~0_368 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_23| |v_P1Thread1of1ForFork2_~arg#1.offset_23|) (= (ite .cse1 0 1) v_~y$w_buff0_used~0_615) (= v_~x~0_47 v_~__unbuffered_p1_EAX~0_138) (= v_~y$r_buff0_thd2~0_298 v_~y$r_buff1_thd2~0_238) (= v_~y$r_buff0_thd1~0_75 v_~y$r_buff1_thd1~0_79) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61| (ite .cse2 1 0)) (= (store |v_#memory_int_625| |v_~#y~0.base_294| (store .cse4 |v_~#y~0.offset_294| |v_ULTIMATE.start_main_#t~ite33#1_119|)) |v_#memory_int_624|) (= v_~y$w_buff1~0_327 v_~y$w_buff0~0_369) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61|) (= v_~y$r_buff0_thd2~0_297 1) (or (and (= |v_ULTIMATE.start_main_#t~ite33#1_119| v_~y$w_buff0~0_368) .cse1 (= |v_ULTIMATE.start_main_#t~ite32#1_149| |v_ULTIMATE.start_main_#t~ite32#1_151|) (= |v_ULTIMATE.start_main_#t~mem31#1_154| |v_ULTIMATE.start_main_#t~mem31#1_152|)) (and (= (select .cse4 |v_~#y~0.offset_294|) |v_ULTIMATE.start_main_#t~mem31#1_152|) (= |v_ULTIMATE.start_main_#t~ite33#1_119| |v_ULTIMATE.start_main_#t~ite32#1_149|) (= |v_ULTIMATE.start_main_#t~mem31#1_152| |v_ULTIMATE.start_main_#t~ite32#1_149|) .cse5)) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_23| |v_P1Thread1of1ForFork2_~arg#1.base_23|))))) InVars {~#y~0.offset=|v_~#y~0.offset_294|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_616, ~#y~0.base=|v_~#y~0.base_294|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_23|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_154|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_157, ~y$w_buff0~0=v_~y$w_buff0~0_369, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_293, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_298, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_75, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_151|, #memory_int=|v_#memory_int_625|, ~x~0=v_~x~0_47, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_23|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_23|, ~#y~0.offset=|v_~#y~0.offset_294|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_615, ~#y~0.base=|v_~#y~0.base_294|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_23|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_79, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_299, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_138, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61|, ~y$w_buff0~0=v_~y$w_buff0~0_368, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_293, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_75, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_23|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_23|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_238, ~y$w_buff1~0=v_~y$w_buff1~0_327, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_156, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_118|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, #memory_int=|v_#memory_int_624|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_168, ~x~0=v_~x~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_563} AuxVars[|v_ULTIMATE.start_main_#t~ite32#1_149|, |v_ULTIMATE.start_main_#t~ite33#1_119|, |v_ULTIMATE.start_main_#t~mem31#1_152|] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~mem31#1, ~y$w_buff0~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite33#1, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32#1, #memory_int, P1Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:00:21,593 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:00:21,593 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3903 [2022-12-13 12:00:21,594 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 206 flow [2022-12-13 12:00:21,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:21,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:21,594 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:21,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:00:21,594 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:00:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:21,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1820624704, now seen corresponding path program 1 times [2022-12-13 12:00:21,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:21,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454570973] [2022-12-13 12:00:21,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:21,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:22,818 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 12:00:22,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:22,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454570973] [2022-12-13 12:00:22,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454570973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:22,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:22,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:00:22,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986649479] [2022-12-13 12:00:22,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:22,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:00:22,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:22,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:00:22,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:00:22,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-13 12:00:22,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:22,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:22,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-13 12:00:22,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:23,091 INFO L130 PetriNetUnfolder]: 759/1231 cut-off events. [2022-12-13 12:00:23,091 INFO L131 PetriNetUnfolder]: For 1190/1236 co-relation queries the response was YES. [2022-12-13 12:00:23,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4047 conditions, 1231 events. 759/1231 cut-off events. For 1190/1236 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 6368 event pairs, 211 based on Foata normal form. 19/948 useless extension candidates. Maximal degree in co-relation 4031. Up to 945 conditions per place. [2022-12-13 12:00:23,099 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 44 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2022-12-13 12:00:23,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 62 transitions, 428 flow [2022-12-13 12:00:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:00:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:00:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-13 12:00:23,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2022-12-13 12:00:23,100 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 206 flow. Second operand 5 states and 65 transitions. [2022-12-13 12:00:23,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 62 transitions, 428 flow [2022-12-13 12:00:23,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:00:23,104 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 268 flow [2022-12-13 12:00:23,104 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2022-12-13 12:00:23,105 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -22 predicate places. [2022-12-13 12:00:23,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:23,105 INFO L89 Accepts]: Start accepts. Operand has 47 places, 44 transitions, 268 flow [2022-12-13 12:00:23,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:23,105 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:23,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 44 transitions, 268 flow [2022-12-13 12:00:23,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 268 flow [2022-12-13 12:00:23,145 INFO L130 PetriNetUnfolder]: 377/694 cut-off events. [2022-12-13 12:00:23,146 INFO L131 PetriNetUnfolder]: For 334/358 co-relation queries the response was YES. [2022-12-13 12:00:23,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 694 events. 377/694 cut-off events. For 334/358 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 4203 event pairs, 162 based on Foata normal form. 6/365 useless extension candidates. Maximal degree in co-relation 1647. Up to 571 conditions per place. [2022-12-13 12:00:23,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 44 transitions, 268 flow [2022-12-13 12:00:23,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 12:00:23,153 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:00:23,153 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 12:00:23,153 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 268 flow [2022-12-13 12:00:23,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:23,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:23,153 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:23,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:00:23,154 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:00:23,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:23,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1824848110, now seen corresponding path program 1 times [2022-12-13 12:00:23,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:23,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940147135] [2022-12-13 12:00:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:23,294 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 12:00:23,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:23,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940147135] [2022-12-13 12:00:23,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940147135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:23,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:23,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:00:23,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789469308] [2022-12-13 12:00:23,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:23,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:00:23,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:23,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:00:23,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:00:23,297 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 12:00:23,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:23,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:23,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 12:00:23,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:23,451 INFO L130 PetriNetUnfolder]: 509/901 cut-off events. [2022-12-13 12:00:23,451 INFO L131 PetriNetUnfolder]: For 1177/1177 co-relation queries the response was YES. [2022-12-13 12:00:23,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3348 conditions, 901 events. 509/901 cut-off events. For 1177/1177 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4600 event pairs, 81 based on Foata normal form. 39/616 useless extension candidates. Maximal degree in co-relation 3330. Up to 820 conditions per place. [2022-12-13 12:00:23,458 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 38 selfloop transitions, 19 changer transitions 0/59 dead transitions. [2022-12-13 12:00:23,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 456 flow [2022-12-13 12:00:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:00:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:00:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-13 12:00:23,459 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2022-12-13 12:00:23,459 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 268 flow. Second operand 4 states and 61 transitions. [2022-12-13 12:00:23,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 456 flow [2022-12-13 12:00:23,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 430 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 12:00:23,463 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 312 flow [2022-12-13 12:00:23,464 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2022-12-13 12:00:23,465 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -20 predicate places. [2022-12-13 12:00:23,465 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:23,465 INFO L89 Accepts]: Start accepts. Operand has 49 places, 49 transitions, 312 flow [2022-12-13 12:00:23,466 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:23,466 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:23,466 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 49 transitions, 312 flow [2022-12-13 12:00:23,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 312 flow [2022-12-13 12:00:23,514 INFO L130 PetriNetUnfolder]: 227/511 cut-off events. [2022-12-13 12:00:23,514 INFO L131 PetriNetUnfolder]: For 219/282 co-relation queries the response was YES. [2022-12-13 12:00:23,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1727 conditions, 511 events. 227/511 cut-off events. For 219/282 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 3195 event pairs, 27 based on Foata normal form. 3/325 useless extension candidates. Maximal degree in co-relation 1711. Up to 343 conditions per place. [2022-12-13 12:00:23,519 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 49 transitions, 312 flow [2022-12-13 12:00:23,519 INFO L226 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-13 12:00:24,762 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:00:24,763 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1298 [2022-12-13 12:00:24,763 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 306 flow [2022-12-13 12:00:24,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:24,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:24,763 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:24,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:00:24,763 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:00:24,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:24,764 INFO L85 PathProgramCache]: Analyzing trace with hash -785267498, now seen corresponding path program 1 times [2022-12-13 12:00:24,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:24,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678036157] [2022-12-13 12:00:24,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:24,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:00:24,920 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 12:00:24,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:00:24,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678036157] [2022-12-13 12:00:24,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678036157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:00:24,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:00:24,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:00:24,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608363236] [2022-12-13 12:00:24,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:00:24,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:00:24,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:00:24,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:00:24,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:00:24,921 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 12:00:24,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 306 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:24,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:00:24,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 12:00:24,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:00:25,027 INFO L130 PetriNetUnfolder]: 161/366 cut-off events. [2022-12-13 12:00:25,029 INFO L131 PetriNetUnfolder]: For 504/504 co-relation queries the response was YES. [2022-12-13 12:00:25,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 366 events. 161/366 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1854 event pairs, 0 based on Foata normal form. 63/283 useless extension candidates. Maximal degree in co-relation 1680. Up to 247 conditions per place. [2022-12-13 12:00:25,033 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 23 selfloop transitions, 28 changer transitions 0/53 dead transitions. [2022-12-13 12:00:25,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 458 flow [2022-12-13 12:00:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:00:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:00:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-13 12:00:25,034 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43448275862068964 [2022-12-13 12:00:25,034 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 306 flow. Second operand 5 states and 63 transitions. [2022-12-13 12:00:25,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 458 flow [2022-12-13 12:00:25,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 352 flow, removed 30 selfloop flow, removed 8 redundant places. [2022-12-13 12:00:25,036 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 290 flow [2022-12-13 12:00:25,037 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2022-12-13 12:00:25,037 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -25 predicate places. [2022-12-13 12:00:25,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:00:25,037 INFO L89 Accepts]: Start accepts. Operand has 44 places, 45 transitions, 290 flow [2022-12-13 12:00:25,039 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:00:25,039 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:00:25,039 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 45 transitions, 290 flow [2022-12-13 12:00:25,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 290 flow [2022-12-13 12:00:25,056 INFO L130 PetriNetUnfolder]: 101/285 cut-off events. [2022-12-13 12:00:25,056 INFO L131 PetriNetUnfolder]: For 100/142 co-relation queries the response was YES. [2022-12-13 12:00:25,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 285 events. 101/285 cut-off events. For 100/142 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 1633 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 939. Up to 199 conditions per place. [2022-12-13 12:00:25,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 45 transitions, 290 flow [2022-12-13 12:00:25,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-13 12:00:25,553 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [796] $Ultimate##0-->L833: Formula: (let ((.cse5 (= (mod v_~y$r_buff0_thd3~0_290 256) 0))) (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_611 256) 0))) (.cse1 (not .cse5))) (let ((.cse0 (= (mod v_~y$w_buff0_used~0_612 256) 0)) (.cse2 (and .cse3 .cse1)) (.cse4 (select |v_#memory_int_621| |v_~#y~0.base_292|))) (and (= v_~y$w_buff1_used~0_561 (ite (or (and (not .cse0) .cse1) .cse2) 0 v_~y$w_buff0_used~0_612)) (= v_~y$w_buff1~0_325 v_~y$w_buff0~0_365) (= v_~y$r_buff0_thd2~0_294 v_~y$r_buff1_thd2~0_236) (= (ite .cse0 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_59|) (= v_~y$w_buff0~0_364 1) (= v_~y$r_buff0_thd0~0_154 v_~y$r_buff1_thd0~0_166) (= v_~y$r_buff0_thd2~0_293 1) (= v_~y$r_buff0_thd1~0_73 v_~y$r_buff1_thd1~0_77) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_561 256) 0)) .cse1) (and (not (= (mod v_~y$r_buff0_thd3~0_289 256) 0)) .cse3)) 0 v_~y$r_buff0_thd3~0_290) v_~y$r_buff1_thd3~0_297) (= (ite .cse2 0 v_~y$r_buff0_thd3~0_290) v_~y$r_buff0_thd3~0_289) (= v_~x~0_45 v_~__unbuffered_p1_EAX~0_136) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_21| |v_P1Thread1of1ForFork2_~arg#1.offset_21|) (or (and (= |v_P2_#t~ite24_59| |v_P2_#t~ite23_59|) (= |v_P2_#t~mem22_64| (select .cse4 |v_~#y~0.offset_292|)) (= |v_P2_#t~ite23_59| |v_P2_#t~mem22_64|) .cse5) (and (= |v_P2_#t~ite24_59| v_~y$w_buff0~0_364) (= |v_P2Thread1of1ForFork0_#t~mem22_68| |v_P2_#t~mem22_64|) .cse1 (= |v_P2_#t~ite23_59| |v_P2Thread1of1ForFork0_#t~ite23_68|))) (= (store |v_#memory_int_621| |v_~#y~0.base_292| (store .cse4 |v_~#y~0.offset_292| |v_P2_#t~ite24_59|)) |v_#memory_int_620|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_21| |v_P1Thread1of1ForFork2_~arg#1.base_21|) (= v_~y$w_buff0_used~0_611 (ite .cse1 0 1)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_59| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_59|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_59| 0)))))) InVars {~#y~0.offset=|v_~#y~0.offset_292|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_612, ~#y~0.base=|v_~#y~0.base_292|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_21|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_290, ~y$w_buff0~0=v_~y$w_buff0~0_365, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_154, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_68|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_294, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_73, #memory_int=|v_#memory_int_621|, P2Thread1of1ForFork0_#t~mem22=|v_P2Thread1of1ForFork0_#t~mem22_68|, ~x~0=v_~x~0_45, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_21|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_21|, ~#y~0.offset=|v_~#y~0.offset_292|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_611, ~#y~0.base=|v_~#y~0.base_292|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_21|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_77, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_297, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_59|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_289, ~y$w_buff0~0=v_~y$w_buff0~0_364, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_36|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_73, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_21|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_21|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_236, ~y$w_buff1~0=v_~y$w_buff1~0_325, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_154, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_293, #memory_int=|v_#memory_int_620|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_166, ~x~0=v_~x~0_45, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_561} AuxVars[|v_P2_#t~ite24_59|, |v_P2_#t~ite23_59|, |v_P2_#t~mem22_64|] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~y$r_buff0_thd2~0, #memory_int, P2Thread1of1ForFork0_#t~mem22, P1Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [627] L790-->L797: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd2~0_50 256) 0))) (let ((.cse11 (= (mod v_~y$w_buff0_used~0_194 256) 0)) (.cse9 (= (mod v_~y$r_buff1_thd2~0_43 256) 0)) (.cse8 (= (mod v_~y$w_buff1_used~0_189 256) 0)) (.cse6 (not (= (mod v_~y$w_buff0_used~0_193 256) 0))) (.cse1 (not .cse10))) (let ((.cse4 (and .cse6 .cse1)) (.cse2 (not .cse8)) (.cse3 (not .cse9)) (.cse5 (select |v_#memory_int_169| |v_~#y~0.base_112|)) (.cse0 (not .cse11))) (and (= v_~y$w_buff0_used~0_193 (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_194)) (= v_~y$w_buff1_used~0_188 (ite (or (and .cse2 .cse3) .cse4) 0 v_~y$w_buff1_used~0_189)) (= (ite .cse4 0 v_~y$r_buff0_thd2~0_50) v_~y$r_buff0_thd2~0_49) (= (store |v_#memory_int_169| |v_~#y~0.base_112| (store .cse5 |v_~#y~0.offset_112| |v_P1_#t~ite5#1_27|)) |v_#memory_int_168|) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_188 256) 0)) .cse3) (and .cse6 (not (= (mod v_~y$r_buff0_thd2~0_49 256) 0)))) 0 v_~y$r_buff1_thd2~0_43) v_~y$r_buff1_thd2~0_42) (let ((.cse7 (= |v_P1Thread1of1ForFork2_#t~mem3#1_1| |v_P1_#t~mem3#1_36|))) (or (and (or (and .cse2 (= |v_P1_#t~ite4#1_29| v_~y$w_buff1~0_82) .cse7 .cse3) (and (= (select .cse5 |v_~#y~0.offset_112|) |v_P1_#t~mem3#1_36|) (or .cse8 .cse9) (= |v_P1_#t~ite4#1_29| |v_P1_#t~mem3#1_36|))) (or .cse10 .cse11) (= |v_P1_#t~ite4#1_29| |v_P1_#t~ite5#1_27|)) (and .cse0 (= |v_P1_#t~ite5#1_27| v_~y$w_buff0~0_77) (= |v_P1_#t~ite4#1_29| |v_P1Thread1of1ForFork2_#t~ite4#1_1|) .cse1 .cse7))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~#y~0.offset=|v_~#y~0.offset_112|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_194, ~y$w_buff1~0=v_~y$w_buff1~0_82, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, #memory_int=|v_#memory_int_169|, P1Thread1of1ForFork2_#t~ite4#1=|v_P1Thread1of1ForFork2_#t~ite4#1_1|, ~#y~0.base=|v_~#y~0.base_112|, P1Thread1of1ForFork2_#t~mem3#1=|v_P1Thread1of1ForFork2_#t~mem3#1_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_189} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~#y~0.offset=|v_~#y~0.offset_112|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_193, ~y$w_buff1~0=v_~y$w_buff1~0_82, P1Thread1of1ForFork2_#t~ite5#1=|v_P1Thread1of1ForFork2_#t~ite5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, #memory_int=|v_#memory_int_168|, ~#y~0.base=|v_~#y~0.base_112|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_188} AuxVars[|v_P1_#t~ite4#1_29|, |v_P1_#t~ite5#1_27|, |v_P1_#t~mem3#1_36|] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, P1Thread1of1ForFork2_#t~ite5#1, ~y$r_buff0_thd2~0, #memory_int, P1Thread1of1ForFork2_#t~ite4#1, ~y$w_buff1_used~0, P1Thread1of1ForFork2_#t~mem3#1] [2022-12-13 12:00:27,230 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 12:00:27,230 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2193 [2022-12-13 12:00:27,230 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 284 flow [2022-12-13 12:00:27,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:00:27,231 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:00:27,231 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:27,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:00:27,231 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:00:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:00:27,231 INFO L85 PathProgramCache]: Analyzing trace with hash -600759269, now seen corresponding path program 1 times [2022-12-13 12:00:27,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:00:27,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827967003] [2022-12-13 12:00:27,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:00:27,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:00:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:00:27,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:00:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:00:27,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:00:27,323 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:00:27,323 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 12:00:27,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 12:00:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 12:00:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 12:00:27,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 12:00:27,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 12:00:27,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:00:27,326 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:00:27,346 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:00:27,348 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:00:27,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:00:27 BasicIcfg [2022-12-13 12:00:27,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:00:27,395 INFO L158 Benchmark]: Toolchain (without parser) took 38106.48ms. Allocated memory was 183.5MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 158.7MB in the beginning and 719.1MB in the end (delta: -560.4MB). Peak memory consumption was 285.8MB. Max. memory is 8.0GB. [2022-12-13 12:00:27,396 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 160.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:00:27,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.63ms. Allocated memory is still 183.5MB. Free memory was 158.2MB in the beginning and 131.5MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 12:00:27,396 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.50ms. Allocated memory is still 183.5MB. Free memory was 131.5MB in the beginning and 128.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 12:00:27,396 INFO L158 Benchmark]: Boogie Preprocessor took 51.12ms. Allocated memory is still 183.5MB. Free memory was 128.9MB in the beginning and 126.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:00:27,396 INFO L158 Benchmark]: RCFGBuilder took 735.72ms. Allocated memory was 183.5MB in the beginning and 261.1MB in the end (delta: 77.6MB). Free memory was 126.2MB in the beginning and 208.5MB in the end (delta: -82.2MB). Peak memory consumption was 50.4MB. Max. memory is 8.0GB. [2022-12-13 12:00:27,396 INFO L158 Benchmark]: TraceAbstraction took 36638.43ms. Allocated memory was 261.1MB in the beginning and 1.0GB in the end (delta: 767.6MB). Free memory was 207.4MB in the beginning and 719.1MB in the end (delta: -511.7MB). Peak memory consumption was 255.3MB. Max. memory is 8.0GB. [2022-12-13 12:00:27,397 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 183.5MB. Free memory is still 160.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 604.63ms. Allocated memory is still 183.5MB. Free memory was 158.2MB in the beginning and 131.5MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.50ms. Allocated memory is still 183.5MB. Free memory was 131.5MB in the beginning and 128.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.12ms. Allocated memory is still 183.5MB. Free memory was 128.9MB in the beginning and 126.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 735.72ms. Allocated memory was 183.5MB in the beginning and 261.1MB in the end (delta: 77.6MB). Free memory was 126.2MB in the beginning and 208.5MB in the end (delta: -82.2MB). Peak memory consumption was 50.4MB. Max. memory is 8.0GB. * TraceAbstraction took 36638.43ms. Allocated memory was 261.1MB in the beginning and 1.0GB in the end (delta: 767.6MB). Free memory was 207.4MB in the beginning and 719.1MB in the end (delta: -511.7MB). Peak memory consumption was 255.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.4s, 132 PlacesBefore, 69 PlacesAfterwards, 124 TransitionsBefore, 59 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 58 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3673, independent: 3504, independent conditional: 3504, independent unconditional: 0, dependent: 169, dependent conditional: 169, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3673, independent: 3504, independent conditional: 0, independent unconditional: 3504, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3673, independent: 3504, independent conditional: 0, independent unconditional: 3504, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3673, independent: 3504, independent conditional: 0, independent unconditional: 3504, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1786, independent: 1722, independent conditional: 0, independent unconditional: 1722, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1786, independent: 1691, independent conditional: 0, independent unconditional: 1691, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 621, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 585, dependent conditional: 0, dependent unconditional: 585, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3673, independent: 1782, independent conditional: 0, independent unconditional: 1782, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 1786, unknown conditional: 0, unknown unconditional: 1786] , Statistics on independence cache: Total cache size (in pairs): 3107, Positive cache size: 3043, Positive conditional cache size: 0, Positive unconditional cache size: 3043, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, 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, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 234, independent conditional: 234, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266, independent: 234, independent conditional: 27, independent unconditional: 207, dependent: 32, dependent conditional: 9, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 266, independent: 234, independent conditional: 27, independent unconditional: 207, dependent: 32, dependent conditional: 9, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 266, independent: 234, independent conditional: 27, independent unconditional: 207, dependent: 32, dependent conditional: 9, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 214, independent: 192, independent conditional: 23, independent unconditional: 169, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 214, independent: 174, independent conditional: 0, independent unconditional: 174, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 94, dependent conditional: 54, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 266, independent: 42, independent conditional: 4, independent unconditional: 38, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 214, unknown conditional: 29, unknown unconditional: 185] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 192, Positive conditional cache size: 23, Positive unconditional cache size: 169, Negative cache size: 22, Negative conditional cache size: 6, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 250, independent: 220, independent conditional: 220, 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: 250, independent: 220, independent conditional: 21, independent unconditional: 199, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 250, independent: 220, independent conditional: 0, independent unconditional: 220, 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: 250, independent: 220, independent conditional: 0, independent unconditional: 220, 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: 29, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 29, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 250, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 29, unknown conditional: 0, unknown unconditional: 29] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 215, Positive conditional cache size: 23, Positive unconditional cache size: 192, Negative cache size: 28, Negative conditional cache size: 6, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 43 PlacesBefore, 42 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 402, independent: 347, independent conditional: 347, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 402, independent: 347, independent conditional: 51, independent unconditional: 296, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 402, independent: 347, independent conditional: 0, independent unconditional: 347, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 402, independent: 347, independent conditional: 0, independent unconditional: 347, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 402, independent: 331, independent conditional: 0, independent unconditional: 331, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 232, Positive conditional cache size: 23, Positive unconditional cache size: 209, Negative cache size: 29, Negative conditional cache size: 6, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 51, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 112, independent: 86, independent conditional: 14, independent unconditional: 72, dependent: 26, dependent conditional: 4, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 112, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 112, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 239, Positive conditional cache size: 23, Positive unconditional cache size: 216, Negative cache size: 31, Negative conditional cache size: 6, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 226, independent: 182, independent conditional: 182, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 226, independent: 182, independent conditional: 34, independent unconditional: 148, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 226, independent: 182, independent conditional: 0, independent unconditional: 182, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 226, independent: 182, independent conditional: 0, independent unconditional: 182, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 226, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 319, Positive cache size: 286, Positive conditional cache size: 25, Positive unconditional cache size: 261, Negative cache size: 33, Negative conditional cache size: 6, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 43 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, independent: 118, independent conditional: 118, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 128, independent: 118, independent conditional: 94, independent unconditional: 24, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 128, independent: 118, independent conditional: 58, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 128, independent: 118, independent conditional: 58, independent unconditional: 60, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 2, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 128, independent: 114, independent conditional: 56, independent unconditional: 58, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 368, Positive conditional cache size: 27, Positive unconditional cache size: 341, Negative cache size: 33, Negative conditional cache size: 6, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 47 PlacesBefore, 46 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 87, independent conditional: 87, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 87, independent conditional: 36, independent unconditional: 51, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 87, independent conditional: 21, independent unconditional: 66, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 87, independent conditional: 21, independent unconditional: 66, 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: 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] , 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: 99, independent: 75, independent conditional: 21, independent unconditional: 54, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 436, Positive cache size: 403, Positive conditional cache size: 27, Positive unconditional cache size: 376, Negative cache size: 33, Negative conditional cache size: 6, Negative unconditional cache size: 27, 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: 3.8s, 44 PlacesBefore, 43 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 18, independent unconditional: 3, 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: 21, independent: 21, independent conditional: 3, independent unconditional: 18, 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: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 21, independent: 16, independent conditional: 3, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 453, Positive cache size: 420, Positive conditional cache size: 27, Positive unconditional cache size: 393, Negative cache size: 33, Negative conditional cache size: 6, Negative unconditional cache size: 27, 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, 47 PlacesBefore, 47 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 453, Positive cache size: 420, Positive conditional cache size: 27, Positive unconditional cache size: 393, Negative cache size: 33, Negative conditional cache size: 6, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 49 PlacesBefore, 47 PlacesAfterwards, 49 TransitionsBefore, 47 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 15, independent unconditional: 3, 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: 18, independent: 18, independent conditional: 15, independent unconditional: 3, 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: 18, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 484, Positive cache size: 451, Positive conditional cache size: 27, Positive unconditional cache size: 424, Negative cache size: 33, Negative conditional cache size: 6, Negative unconditional cache size: 27, 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: 2.2s, 44 PlacesBefore, 41 PlacesAfterwards, 45 TransitionsBefore, 42 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 12, independent unconditional: 1, 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: 13, independent: 13, independent conditional: 12, independent unconditional: 1, 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: 13, independent: 13, independent conditional: 12, independent unconditional: 1, 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: 13, independent: 13, independent conditional: 12, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 12, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 513, Positive cache size: 480, Positive conditional cache size: 39, Positive unconditional cache size: 441, Negative cache size: 33, Negative conditional cache size: 6, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1940; [L851] FCALL, FORK 0 pthread_create(&t1940, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1940, ((void *)0), P0, ((void *)0))=-3, t1940={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t1941; [L853] FCALL, FORK 0 pthread_create(&t1941, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1941, ((void *)0), P1, ((void *)0))=-2, t1940={7:0}, t1941={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] 0 pthread_t t1942; [L855] FCALL, FORK 0 pthread_create(&t1942, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1942, ((void *)0), P2, ((void *)0))=-1, t1940={7:0}, t1941={5:0}, t1942={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 \read(y) [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 [L825] 3 z = 1 [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L762] 3 __unbuffered_p0_EAX = z [L765] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 2 __unbuffered_p1_EAX = x [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 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) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 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 [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 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_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 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) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 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 [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 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 [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y={3:0}, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, 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: 853]: 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: 855]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 734 IncrementalHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 2 mSDtfsCounter, 734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=10, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 1278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 12:00:27,432 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...