/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:25:16,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:25:16,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:25:16,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:25:16,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:25:16,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:25:16,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:25:16,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:25:16,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:25:16,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:25:16,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:25:16,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:25:16,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:25:16,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:25:16,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:25:16,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:25:16,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:25:16,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:25:16,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:25:16,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:25:16,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:25:16,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:25:16,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:25:16,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:25:16,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:25:16,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:25:16,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:25:16,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:25:16,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:25:16,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:25:16,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:25:16,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:25:16,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:25:16,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:25:16,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:25:16,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:25:16,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:25:16,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:25:16,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:25:16,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:25:16,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:25:16,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:25:16,476 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:25:16,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:25:16,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:25:16,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:25:16,479 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:25:16,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:25:16,480 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:25:16,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:25:16,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:25:16,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:25:16,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:25:16,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:25:16,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:25:16,481 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:25:16,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:25:16,481 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:25:16,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:25:16,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:25:16,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:25:16,482 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:25:16,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:25:16,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:25:16,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:25:16,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:25:16,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:25:16,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:25:16,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:25:16,483 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:25:16,483 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:25:16,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:25:16,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:25:16,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:25:16,855 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:25:16,855 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:25:16,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-12-06 04:25:18,058 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:25:18,397 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:25:18,398 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-12-06 04:25:18,422 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89b17909/24b41ced4928474aadcbb4f8f670a25e/FLAG3e7314a4d [2022-12-06 04:25:18,444 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e89b17909/24b41ced4928474aadcbb4f8f670a25e [2022-12-06 04:25:18,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:25:18,447 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:25:18,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:25:18,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:25:18,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:25:18,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:25:18" (1/1) ... [2022-12-06 04:25:18,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5364b37a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:18, skipping insertion in model container [2022-12-06 04:25:18,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:25:18" (1/1) ... [2022-12-06 04:25:18,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:25:18,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:25:18,711 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-06 04:25:18,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:18,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:18,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:25:18,970 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:25:18,982 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-06 04:25:19,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:25:19,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:25:19,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:25:19,101 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:25:19,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:19 WrapperNode [2022-12-06 04:25:19,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:25:19,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:25:19,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:25:19,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:25:19,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:19" (1/1) ... [2022-12-06 04:25:19,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:19" (1/1) ... [2022-12-06 04:25:19,181 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-06 04:25:19,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:25:19,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:25:19,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:25:19,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:25:19,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:19" (1/1) ... [2022-12-06 04:25:19,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:19" (1/1) ... [2022-12-06 04:25:19,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:19" (1/1) ... [2022-12-06 04:25:19,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:19" (1/1) ... [2022-12-06 04:25:19,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:19" (1/1) ... [2022-12-06 04:25:19,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:19" (1/1) ... [2022-12-06 04:25:19,224 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:19" (1/1) ... [2022-12-06 04:25:19,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:19" (1/1) ... [2022-12-06 04:25:19,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:25:19,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:25:19,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:25:19,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:25:19,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:19" (1/1) ... [2022-12-06 04:25:19,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:25:19,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:25:19,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:25:19,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:25:19,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:25:19,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:25:19,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:25:19,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:25:19,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:25:19,320 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:25:19,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:25:19,322 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:25:19,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:25:19,322 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:25:19,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:25:19,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:25:19,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:25:19,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:25:19,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:25:19,324 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:25:19,528 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:25:19,530 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:25:19,851 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:25:19,976 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:25:19,977 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:25:19,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:25:19 BoogieIcfgContainer [2022-12-06 04:25:19,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:25:19,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:25:19,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:25:19,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:25:19,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:25:18" (1/3) ... [2022-12-06 04:25:19,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b45523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:25:19, skipping insertion in model container [2022-12-06 04:25:19,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:25:19" (2/3) ... [2022-12-06 04:25:19,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b45523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:25:19, skipping insertion in model container [2022-12-06 04:25:19,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:25:19" (3/3) ... [2022-12-06 04:25:19,986 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2022-12-06 04:25:20,003 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:25:20,003 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:25:20,004 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:25:20,095 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:25:20,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 04:25:20,202 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 04:25:20,202 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:20,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:25:20,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 04:25:20,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-06 04:25:20,214 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:20,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 04:25:20,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-06 04:25:20,289 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 04:25:20,290 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:20,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 04:25:20,295 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 04:25:20,295 INFO L188 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-06 04:25:26,368 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-06 04:25:26,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:25:26,387 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;@3e32883f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:25:26,388 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:25:26,391 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 04:25:26,392 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:26,392 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:26,392 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:25:26,393 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-06 04:25:26,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:26,397 INFO L85 PathProgramCache]: Analyzing trace with hash 443002296, now seen corresponding path program 1 times [2022-12-06 04:25:26,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:26,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702957826] [2022-12-06 04:25:26,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:26,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:25:26,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:26,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702957826] [2022-12-06 04:25:26,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702957826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:26,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:26,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:25:26,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510020910] [2022-12-06 04:25:26,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:26,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:25:26,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:26,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:25:26,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:25:26,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:25:26,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:26,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:26,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:25:26,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:27,155 INFO L130 PetriNetUnfolder]: 879/1434 cut-off events. [2022-12-06 04:25:27,155 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 04:25:27,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 1434 events. 879/1434 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7495 event pairs, 144 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 2790. Up to 1060 conditions per place. [2022-12-06 04:25:27,170 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2022-12-06 04:25:27,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2022-12-06 04:25:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:25:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:25:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 04:25:27,181 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-06 04:25:27,183 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 49 transitions. [2022-12-06 04:25:27,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2022-12-06 04:25:27,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:25:27,187 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 52 flow [2022-12-06 04:25:27,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-06 04:25:27,192 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 04:25:27,193 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:27,193 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 52 flow [2022-12-06 04:25:27,196 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:27,196 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:27,196 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 52 flow [2022-12-06 04:25:27,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 04:25:27,202 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:25:27,202 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:25:27,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:25:27,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 04:25:27,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 04:25:27,289 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:27,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 04:25:27,292 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 04:25:27,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:27,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:27,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:27,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:25:27,297 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-06 04:25:27,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash 539521193, now seen corresponding path program 1 times [2022-12-06 04:25:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:27,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257250789] [2022-12-06 04:25:27,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:25:27,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:27,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257250789] [2022-12-06 04:25:27,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257250789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:27,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:27,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:25:27,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647575406] [2022-12-06 04:25:27,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:27,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:27,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:27,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:27,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:27,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:25:27,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:27,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:27,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:25:27,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:28,188 INFO L130 PetriNetUnfolder]: 1273/1900 cut-off events. [2022-12-06 04:25:28,189 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-06 04:25:28,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3979 conditions, 1900 events. 1273/1900 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7864 event pairs, 379 based on Foata normal form. 85/1985 useless extension candidates. Maximal degree in co-relation 3969. Up to 1068 conditions per place. [2022-12-06 04:25:28,203 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 34 selfloop transitions, 9 changer transitions 0/43 dead transitions. [2022-12-06 04:25:28,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 186 flow [2022-12-06 04:25:28,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:25:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:25:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 04:25:28,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-06 04:25:28,205 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 4 states and 45 transitions. [2022-12-06 04:25:28,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 186 flow [2022-12-06 04:25:28,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:25:28,208 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 116 flow [2022-12-06 04:25:28,208 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2022-12-06 04:25:28,209 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2022-12-06 04:25:28,209 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:28,209 INFO L89 Accepts]: Start accepts. Operand has 34 places, 28 transitions, 116 flow [2022-12-06 04:25:28,211 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:28,211 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:28,212 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 116 flow [2022-12-06 04:25:28,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 116 flow [2022-12-06 04:25:28,269 INFO L130 PetriNetUnfolder]: 215/393 cut-off events. [2022-12-06 04:25:28,270 INFO L131 PetriNetUnfolder]: For 85/91 co-relation queries the response was YES. [2022-12-06 04:25:28,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 393 events. 215/393 cut-off events. For 85/91 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1802 event pairs, 95 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 906. Up to 303 conditions per place. [2022-12-06 04:25:28,273 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 116 flow [2022-12-06 04:25:28,273 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 04:25:28,292 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:28,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 04:25:28,294 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 116 flow [2022-12-06 04:25:28,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:28,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:28,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:28,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:25:28,295 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-06 04:25:28,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:28,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1177191057, now seen corresponding path program 1 times [2022-12-06 04:25:28,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:28,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391518296] [2022-12-06 04:25:28,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:28,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:25:28,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:28,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391518296] [2022-12-06 04:25:28,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391518296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:28,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:28,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:25:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359709330] [2022-12-06 04:25:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:28,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:28,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:28,566 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:25:28,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:28,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:28,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:25:28,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:28,857 INFO L130 PetriNetUnfolder]: 1317/2037 cut-off events. [2022-12-06 04:25:28,857 INFO L131 PetriNetUnfolder]: For 821/821 co-relation queries the response was YES. [2022-12-06 04:25:28,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5769 conditions, 2037 events. 1317/2037 cut-off events. For 821/821 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9892 event pairs, 162 based on Foata normal form. 60/2097 useless extension candidates. Maximal degree in co-relation 5756. Up to 1060 conditions per place. [2022-12-06 04:25:28,873 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 42 selfloop transitions, 4 changer transitions 16/63 dead transitions. [2022-12-06 04:25:28,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 63 transitions, 386 flow [2022-12-06 04:25:28,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:25:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:25:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 04:25:28,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-06 04:25:28,876 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 116 flow. Second operand 4 states and 50 transitions. [2022-12-06 04:25:28,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 63 transitions, 386 flow [2022-12-06 04:25:28,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 63 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:25:28,880 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 148 flow [2022-12-06 04:25:28,880 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-06 04:25:28,881 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-06 04:25:28,881 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:28,881 INFO L89 Accepts]: Start accepts. Operand has 38 places, 30 transitions, 148 flow [2022-12-06 04:25:28,882 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:28,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:28,883 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 148 flow [2022-12-06 04:25:28,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 148 flow [2022-12-06 04:25:28,954 INFO L130 PetriNetUnfolder]: 168/325 cut-off events. [2022-12-06 04:25:28,955 INFO L131 PetriNetUnfolder]: For 194/209 co-relation queries the response was YES. [2022-12-06 04:25:28,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 325 events. 168/325 cut-off events. For 194/209 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1476 event pairs, 71 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 849. Up to 244 conditions per place. [2022-12-06 04:25:28,958 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 148 flow [2022-12-06 04:25:28,958 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-06 04:25:28,966 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:28,967 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 04:25:28,967 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 148 flow [2022-12-06 04:25:28,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:28,967 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:28,968 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:28,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:25:28,968 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-06 04:25:28,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:28,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2132384892, now seen corresponding path program 1 times [2022-12-06 04:25:28,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:28,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473276144] [2022-12-06 04:25:28,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:28,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:25:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:29,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473276144] [2022-12-06 04:25:29,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473276144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:29,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:29,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:25:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392117273] [2022-12-06 04:25:29,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:29,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:29,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:29,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:29,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:29,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-06 04:25:29,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:29,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:29,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-06 04:25:29,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:29,545 INFO L130 PetriNetUnfolder]: 1460/2309 cut-off events. [2022-12-06 04:25:29,546 INFO L131 PetriNetUnfolder]: For 1848/1848 co-relation queries the response was YES. [2022-12-06 04:25:29,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6755 conditions, 2309 events. 1460/2309 cut-off events. For 1848/1848 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11992 event pairs, 275 based on Foata normal form. 72/2381 useless extension candidates. Maximal degree in co-relation 6739. Up to 1117 conditions per place. [2022-12-06 04:25:29,562 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 38 selfloop transitions, 5 changer transitions 29/73 dead transitions. [2022-12-06 04:25:29,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 73 transitions, 464 flow [2022-12-06 04:25:29,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:25:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:25:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-12-06 04:25:29,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 04:25:29,565 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 148 flow. Second operand 5 states and 63 transitions. [2022-12-06 04:25:29,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 73 transitions, 464 flow [2022-12-06 04:25:29,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 73 transitions, 451 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 04:25:29,574 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 169 flow [2022-12-06 04:25:29,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-12-06 04:25:29,575 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-06 04:25:29,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:29,575 INFO L89 Accepts]: Start accepts. Operand has 44 places, 30 transitions, 169 flow [2022-12-06 04:25:29,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:29,578 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:29,578 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 30 transitions, 169 flow [2022-12-06 04:25:29,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 169 flow [2022-12-06 04:25:29,620 INFO L130 PetriNetUnfolder]: 120/273 cut-off events. [2022-12-06 04:25:29,620 INFO L131 PetriNetUnfolder]: For 372/384 co-relation queries the response was YES. [2022-12-06 04:25:29,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 273 events. 120/273 cut-off events. For 372/384 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1396 event pairs, 66 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 711. Up to 196 conditions per place. [2022-12-06 04:25:29,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 169 flow [2022-12-06 04:25:29,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 04:25:29,720 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] L791-->L794: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] and [324] L745-->L752: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_69 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_14 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_70 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_57 256) 0)))) (.cse2 (and .cse0 .cse5))) (and (= v_~x$r_buff1_thd1~0_13 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0))) (and (not (= 0 (mod v_~x$w_buff1_used~0_56 256))) .cse1)) 0 v_~x$r_buff1_thd1~0_14)) (= v_~x$r_buff0_thd1~0_19 (ite .cse2 0 v_~x$r_buff0_thd1~0_20)) (= v_~x~0_39 (ite .cse3 v_~x$w_buff0~0_21 (ite .cse4 v_~x$w_buff1~0_28 v_~x~0_40))) (= (ite .cse3 0 v_~x$w_buff0_used~0_70) v_~x$w_buff0_used~0_69) (= v_~x$w_buff1_used~0_56 (ite (or .cse4 .cse2) 0 v_~x$w_buff1_used~0_57))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_21, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_13, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:25:29,795 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] L791-->L794: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] and [406] L3-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_130 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_126 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_231 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_232 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_208 256) 0))))) (and (= v_~x$r_buff0_thd0~0_125 (ite .cse0 0 v_~x$r_buff0_thd0~0_126)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_208) v_~x$w_buff1_used~0_207) (= v_~x$r_buff1_thd0~0_129 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_125 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_207 256) 0)))) 0 v_~x$r_buff1_thd0~0_130)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| 0)) (= v_~x$w_buff0_used~0_231 (ite .cse4 0 v_~x$w_buff0_used~0_232)) (= (ite .cse4 v_~x$w_buff0~0_133 (ite .cse1 v_~x$w_buff1~0_125 v_~x~0_155)) v_~x~0_154)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_133, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~x$w_buff1~0=v_~x$w_buff1~0_125, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_208, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_130, ~x~0=v_~x~0_155, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_133, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~x$w_buff1~0=v_~x$w_buff1~0_125, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_207, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_129, ~x~0=v_~x~0_154, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_231} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:25:29,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] L791-->L794: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] and [367] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~y~0_34 2)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_34, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] [2022-12-06 04:25:29,901 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [338] L791-->L794: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] and [332] L774-->L781: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_93)) (= v_~x$r_buff0_thd2~0_24 (ite .cse1 0 v_~x$r_buff0_thd2~0_25)) (= (ite .cse2 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_20)) (= v_~x~0_61 (ite .cse2 v_~x$w_buff0~0_33 (ite .cse0 v_~x$w_buff1~0_44 v_~x~0_62)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 04:25:29,982 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:25:29,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 409 [2022-12-06 04:25:29,984 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 187 flow [2022-12-06 04:25:29,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:29,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:29,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:29,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:25:29,985 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-06 04:25:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash -866721729, now seen corresponding path program 1 times [2022-12-06 04:25:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:29,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261835834] [2022-12-06 04:25:29,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:29,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:25:30,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:30,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261835834] [2022-12-06 04:25:30,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261835834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:30,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:30,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:25:30,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002297557] [2022-12-06 04:25:30,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:30,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:25:30,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:30,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:25:30,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:25:30,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:25:30,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 187 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:30,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:30,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:25:30,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:31,287 INFO L130 PetriNetUnfolder]: 1477/2265 cut-off events. [2022-12-06 04:25:31,287 INFO L131 PetriNetUnfolder]: For 4163/4163 co-relation queries the response was YES. [2022-12-06 04:25:31,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7154 conditions, 2265 events. 1477/2265 cut-off events. For 4163/4163 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10809 event pairs, 177 based on Foata normal form. 47/2312 useless extension candidates. Maximal degree in co-relation 7136. Up to 1506 conditions per place. [2022-12-06 04:25:31,302 INFO L137 encePairwiseOnDemand]: 9/25 looper letters, 54 selfloop transitions, 21 changer transitions 0/75 dead transitions. [2022-12-06 04:25:31,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 75 transitions, 594 flow [2022-12-06 04:25:31,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:25:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:25:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-06 04:25:31,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.584 [2022-12-06 04:25:31,309 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 187 flow. Second operand 5 states and 73 transitions. [2022-12-06 04:25:31,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 75 transitions, 594 flow [2022-12-06 04:25:31,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 75 transitions, 535 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-06 04:25:31,327 INFO L231 Difference]: Finished difference. Result has 44 places, 49 transitions, 406 flow [2022-12-06 04:25:31,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=44, PETRI_TRANSITIONS=49} [2022-12-06 04:25:31,329 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-06 04:25:31,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:31,329 INFO L89 Accepts]: Start accepts. Operand has 44 places, 49 transitions, 406 flow [2022-12-06 04:25:31,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:31,331 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:31,331 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 49 transitions, 406 flow [2022-12-06 04:25:31,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 49 transitions, 406 flow [2022-12-06 04:25:31,406 INFO L130 PetriNetUnfolder]: 297/584 cut-off events. [2022-12-06 04:25:31,406 INFO L131 PetriNetUnfolder]: For 1347/1460 co-relation queries the response was YES. [2022-12-06 04:25:31,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2099 conditions, 584 events. 297/584 cut-off events. For 1347/1460 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3343 event pairs, 52 based on Foata normal form. 9/570 useless extension candidates. Maximal degree in co-relation 2082. Up to 413 conditions per place. [2022-12-06 04:25:31,413 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 49 transitions, 406 flow [2022-12-06 04:25:31,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-06 04:25:31,418 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:31,420 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 04:25:31,420 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 49 transitions, 406 flow [2022-12-06 04:25:31,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:31,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:31,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:31,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:25:31,420 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-06 04:25:31,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:31,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1103977955, now seen corresponding path program 1 times [2022-12-06 04:25:31,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:31,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535908437] [2022-12-06 04:25:31,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:31,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:25:31,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:31,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535908437] [2022-12-06 04:25:31,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535908437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:31,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:31,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:25:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51015506] [2022-12-06 04:25:31,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:31,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:31,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:31,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:31,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:25:31,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 49 transitions, 406 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:31,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:31,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:25:31,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:32,131 INFO L130 PetriNetUnfolder]: 2169/3406 cut-off events. [2022-12-06 04:25:32,131 INFO L131 PetriNetUnfolder]: For 9772/9836 co-relation queries the response was YES. [2022-12-06 04:25:32,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13016 conditions, 3406 events. 2169/3406 cut-off events. For 9772/9836 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 18729 event pairs, 408 based on Foata normal form. 93/3489 useless extension candidates. Maximal degree in co-relation 12996. Up to 1781 conditions per place. [2022-12-06 04:25:32,158 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 63 selfloop transitions, 5 changer transitions 18/89 dead transitions. [2022-12-06 04:25:32,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 89 transitions, 899 flow [2022-12-06 04:25:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:25:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:25:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 04:25:32,160 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 04:25:32,160 INFO L175 Difference]: Start difference. First operand has 44 places, 49 transitions, 406 flow. Second operand 4 states and 55 transitions. [2022-12-06 04:25:32,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 89 transitions, 899 flow [2022-12-06 04:25:32,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 89 transitions, 869 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 04:25:32,184 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 407 flow [2022-12-06 04:25:32,184 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=407, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2022-12-06 04:25:32,186 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-06 04:25:32,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:32,186 INFO L89 Accepts]: Start accepts. Operand has 47 places, 49 transitions, 407 flow [2022-12-06 04:25:32,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:32,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:32,188 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 49 transitions, 407 flow [2022-12-06 04:25:32,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 407 flow [2022-12-06 04:25:32,261 INFO L130 PetriNetUnfolder]: 298/594 cut-off events. [2022-12-06 04:25:32,261 INFO L131 PetriNetUnfolder]: For 1263/1338 co-relation queries the response was YES. [2022-12-06 04:25:32,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2213 conditions, 594 events. 298/594 cut-off events. For 1263/1338 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3446 event pairs, 53 based on Foata normal form. 10/585 useless extension candidates. Maximal degree in co-relation 2194. Up to 413 conditions per place. [2022-12-06 04:25:32,268 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 49 transitions, 407 flow [2022-12-06 04:25:32,268 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 04:25:32,273 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:32,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-06 04:25:32,273 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 407 flow [2022-12-06 04:25:32,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:32,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:32,274 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:32,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:25:32,274 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-06 04:25:32,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:32,274 INFO L85 PathProgramCache]: Analyzing trace with hash 983619289, now seen corresponding path program 1 times [2022-12-06 04:25:32,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:32,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80097657] [2022-12-06 04:25:32,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:32,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:25:32,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:32,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80097657] [2022-12-06 04:25:32,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80097657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:32,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:32,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:25:32,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138306796] [2022-12-06 04:25:32,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:32,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:25:32,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:32,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:25:32,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:25:32,503 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 04:25:32,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 407 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-06 04:25:32,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:32,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 04:25:32,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:32,666 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([324] L745-->L752: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_69 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_14 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_70 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_57 256) 0)))) (.cse2 (and .cse0 .cse5))) (and (= v_~x$r_buff1_thd1~0_13 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0))) (and (not (= 0 (mod v_~x$w_buff1_used~0_56 256))) .cse1)) 0 v_~x$r_buff1_thd1~0_14)) (= v_~x$r_buff0_thd1~0_19 (ite .cse2 0 v_~x$r_buff0_thd1~0_20)) (= v_~x~0_39 (ite .cse3 v_~x$w_buff0~0_21 (ite .cse4 v_~x$w_buff1~0_28 v_~x~0_40))) (= (ite .cse3 0 v_~x$w_buff0_used~0_70) v_~x$w_buff0_used~0_69) (= v_~x$w_buff1_used~0_56 (ite (or .cse4 .cse2) 0 v_~x$w_buff1_used~0_57))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_21, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_13, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][31], [Black: 127#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), 161#true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 63#L791true, Black: 136#(and (= ~y~0 0) (= ~__unbuffered_p2_EBX~0 0)), 134#(= ~__unbuffered_p2_EBX~0 0), 43#L3true, 173#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 150#true, P1Thread1of1ForFork0InUse, 34#L774true, P0Thread1of1ForFork2InUse, Black: 141#(= 2 ~y~0), P2Thread1of1ForFork1InUse, 93#L752true, Black: 154#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), Black: 156#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-06 04:25:32,667 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,667 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,667 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,667 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,668 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([444] L791-->L781: Formula: (let ((.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_518 256)))) (.cse3 (not (= (mod v_~x$r_buff1_thd2~0_124 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_155 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_519 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_475 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4))) (and (= v_~x$w_buff0_used~0_518 (ite .cse0 0 v_~x$w_buff0_used~0_519)) (= v_~x$w_buff1_used~0_474 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_475)) (= v_~y~0_152 v_~__unbuffered_p2_EBX~0_111) (= v_~x~0_413 (ite .cse0 v_~x$w_buff0~0_341 (ite .cse1 v_~x$w_buff1~0_313 v_~x~0_414))) (= v_~x$r_buff0_thd2~0_154 (ite .cse2 0 v_~x$r_buff0_thd2~0_155)) (= v_~x$r_buff1_thd2~0_123 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_474 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd2~0_154 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_124))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_341, ~x$w_buff1~0=v_~x$w_buff1~0_313, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_475, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_155, ~y~0=v_~y~0_152, ~x~0=v_~x~0_414, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_519} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_341, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_111, ~x$w_buff1~0=v_~x$w_buff1~0_313, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_123, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_474, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_154, ~y~0=v_~y~0_152, ~x~0=v_~x~0_413, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_518} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][57], [Black: 150#true, Black: 127#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), Black: 126#(= ~__unbuffered_p2_EBX~0 0), 154#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), 161#true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 88#L794true, Black: 136#(and (= ~y~0 0) (= ~__unbuffered_p2_EBX~0 0)), 43#L3true, 173#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 87#L745true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 141#(= 2 ~y~0), P2Thread1of1ForFork1InUse, 74#L781true, Black: 156#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-06 04:25:32,668 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,668 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,668 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,668 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,669 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L791-->L752: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_510 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_104 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_104 256) 0)))) (let ((.cse3 (and (not (= (mod v_~x$w_buff0_used~0_511 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_467 256) 0)))) (.cse0 (and .cse2 .cse5))) (and (= v_~x$r_buff0_thd1~0_103 (ite .cse0 0 v_~x$r_buff0_thd1~0_104)) (= v_~x$r_buff1_thd1~0_103 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_466 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_103 256) 0)) .cse2)) 0 v_~x$r_buff1_thd1~0_104)) (= (ite .cse3 0 v_~x$w_buff0_used~0_511) v_~x$w_buff0_used~0_510) (= (ite .cse3 v_~x$w_buff0~0_337 (ite .cse4 v_~x$w_buff1~0_309 v_~x~0_406)) v_~x~0_405) (= v_~x$w_buff1_used~0_466 (ite (or .cse4 .cse0) 0 v_~x$w_buff1_used~0_467)) (= v_~y~0_144 v_~__unbuffered_p2_EBX~0_105)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~x$w_buff1~0=v_~x$w_buff1~0_309, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_467, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_104, ~y~0=v_~y~0_144, ~x~0=v_~x~0_406, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_511} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_337, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_105, ~x$w_buff1~0=v_~x$w_buff1~0_309, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_466, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_103, ~y~0=v_~y~0_144, ~x~0=v_~x~0_405, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_510} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][58], [Black: 150#true, Black: 127#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), Black: 126#(= ~__unbuffered_p2_EBX~0 0), 154#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), 161#true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 88#L794true, Black: 136#(and (= ~y~0 0) (= ~__unbuffered_p2_EBX~0 0)), 43#L3true, 173#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P1Thread1of1ForFork0InUse, 34#L774true, P0Thread1of1ForFork2InUse, Black: 141#(= 2 ~y~0), P2Thread1of1ForFork1InUse, 93#L752true, Black: 156#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-06 04:25:32,669 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,669 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,669 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,669 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,669 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([332] L774-->L781: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_93)) (= v_~x$r_buff0_thd2~0_24 (ite .cse1 0 v_~x$r_buff0_thd2~0_25)) (= (ite .cse2 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_20)) (= v_~x~0_61 (ite .cse2 v_~x$w_buff0~0_33 (ite .cse0 v_~x$w_buff1~0_44 v_~x~0_62)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][41], [Black: 127#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), 161#true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 63#L791true, Black: 136#(and (= ~y~0 0) (= ~__unbuffered_p2_EBX~0 0)), 134#(= ~__unbuffered_p2_EBX~0 0), 43#L3true, 173#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 87#L745true, 150#true, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 141#(= 2 ~y~0), P2Thread1of1ForFork1InUse, 74#L781true, Black: 154#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), Black: 156#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-06 04:25:32,670 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,670 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,670 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,670 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,670 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L791-->L801: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_506 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_108 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_112 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_463 256) 0)))) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_507 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_335 (ite .cse1 v_~x$w_buff1~0_307 v_~x~0_402)) v_~x~0_401) (= v_~x$r_buff1_thd3~0_111 (ite (or (and .cse2 (not (= 0 (mod v_~x$r_buff0_thd3~0_107 256)))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_462 256) 0)))) 0 v_~x$r_buff1_thd3~0_112)) (= (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_463) v_~x$w_buff1_used~0_462) (= v_~y~0_142 v_~__unbuffered_p2_EBX~0_103) (= v_~x$w_buff0_used~0_506 (ite .cse0 0 v_~x$w_buff0_used~0_507)) (= v_~x$r_buff0_thd3~0_107 (ite .cse4 0 v_~x$r_buff0_thd3~0_108))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$w_buff1~0=v_~x$w_buff1~0_307, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_112, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_463, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_108, ~y~0=v_~y~0_142, ~x~0=v_~x~0_402, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_507} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_103, ~x$w_buff1~0=v_~x$w_buff1~0_307, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_111, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_462, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, ~y~0=v_~y~0_142, ~x~0=v_~x~0_401, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_506} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][60], [Black: 150#true, Black: 127#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), Black: 126#(= ~__unbuffered_p2_EBX~0 0), 154#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= ~__unbuffered_p2_EBX~0 1))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EBX~0 1)) (not (= 2 ~x$w_buff1~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= ~__unbuffered_p2_EBX~0 1)))), 161#true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 86#L801true, Black: 136#(and (= ~y~0 0) (= ~__unbuffered_p2_EBX~0 0)), 43#L3true, 173#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 87#L745true, P1Thread1of1ForFork0InUse, 34#L774true, P0Thread1of1ForFork2InUse, Black: 141#(= 2 ~y~0), P2Thread1of1ForFork1InUse, Black: 156#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-06 04:25:32,670 INFO L382 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,671 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,671 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,671 INFO L385 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2022-12-06 04:25:32,853 INFO L130 PetriNetUnfolder]: 1062/1809 cut-off events. [2022-12-06 04:25:32,854 INFO L131 PetriNetUnfolder]: For 6907/6954 co-relation queries the response was YES. [2022-12-06 04:25:32,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7145 conditions, 1809 events. 1062/1809 cut-off events. For 6907/6954 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10212 event pairs, 132 based on Foata normal form. 274/2065 useless extension candidates. Maximal degree in co-relation 7123. Up to 1052 conditions per place. [2022-12-06 04:25:32,870 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 102 selfloop transitions, 8 changer transitions 13/129 dead transitions. [2022-12-06 04:25:32,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 129 transitions, 1329 flow [2022-12-06 04:25:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:25:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:25:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-06 04:25:32,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.648 [2022-12-06 04:25:32,872 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 407 flow. Second operand 5 states and 81 transitions. [2022-12-06 04:25:32,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 129 transitions, 1329 flow [2022-12-06 04:25:32,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 129 transitions, 1260 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 04:25:32,879 INFO L231 Difference]: Finished difference. Result has 50 places, 56 transitions, 449 flow [2022-12-06 04:25:32,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=449, PETRI_PLACES=50, PETRI_TRANSITIONS=56} [2022-12-06 04:25:32,879 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2022-12-06 04:25:32,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:32,880 INFO L89 Accepts]: Start accepts. Operand has 50 places, 56 transitions, 449 flow [2022-12-06 04:25:32,880 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:32,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:32,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 56 transitions, 449 flow [2022-12-06 04:25:32,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 56 transitions, 449 flow [2022-12-06 04:25:32,972 INFO L130 PetriNetUnfolder]: 360/810 cut-off events. [2022-12-06 04:25:32,973 INFO L131 PetriNetUnfolder]: For 2544/2851 co-relation queries the response was YES. [2022-12-06 04:25:32,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3117 conditions, 810 events. 360/810 cut-off events. For 2544/2851 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 5738 event pairs, 89 based on Foata normal form. 113/885 useless extension candidates. Maximal degree in co-relation 3096. Up to 404 conditions per place. [2022-12-06 04:25:32,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 56 transitions, 449 flow [2022-12-06 04:25:32,982 INFO L188 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-06 04:25:32,988 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] L823-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_20 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_20 256)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [426] L752-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] [2022-12-06 04:25:33,029 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] L823-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_20 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_20 256)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [416] L781-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_65 (+ v_~__unbuffered_cnt~0_66 1)) (= |v_P1Thread1of1ForFork0_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_7|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset] [2022-12-06 04:25:33,065 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [401] L823-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_20 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_47) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_20 256)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [429] L801-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] [2022-12-06 04:25:33,101 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:25:33,102 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 04:25:33,102 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 55 transitions, 455 flow [2022-12-06 04:25:33,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-06 04:25:33,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:33,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:33,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:25:33,103 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-06 04:25:33,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:33,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1450546875, now seen corresponding path program 1 times [2022-12-06 04:25:33,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:33,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798347433] [2022-12-06 04:25:33,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:33,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:25:33,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:33,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798347433] [2022-12-06 04:25:33,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798347433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:33,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:33,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:25:33,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059449891] [2022-12-06 04:25:33,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:33,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:25:33,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:25:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:25:33,291 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 04:25:33,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 55 transitions, 455 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:33,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:33,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 04:25:33,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:33,573 INFO L130 PetriNetUnfolder]: 661/1249 cut-off events. [2022-12-06 04:25:33,573 INFO L131 PetriNetUnfolder]: For 5215/5237 co-relation queries the response was YES. [2022-12-06 04:25:33,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5620 conditions, 1249 events. 661/1249 cut-off events. For 5215/5237 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7267 event pairs, 59 based on Foata normal form. 154/1389 useless extension candidates. Maximal degree in co-relation 5596. Up to 548 conditions per place. [2022-12-06 04:25:33,590 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 93 selfloop transitions, 13 changer transitions 21/133 dead transitions. [2022-12-06 04:25:33,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 133 transitions, 1321 flow [2022-12-06 04:25:33,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:25:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:25:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-06 04:25:33,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5535714285714286 [2022-12-06 04:25:33,592 INFO L175 Difference]: Start difference. First operand has 49 places, 55 transitions, 455 flow. Second operand 6 states and 93 transitions. [2022-12-06 04:25:33,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 133 transitions, 1321 flow [2022-12-06 04:25:33,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 133 transitions, 1315 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 04:25:33,599 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 548 flow [2022-12-06 04:25:33,599 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=548, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2022-12-06 04:25:33,601 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2022-12-06 04:25:33,601 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:33,601 INFO L89 Accepts]: Start accepts. Operand has 57 places, 61 transitions, 548 flow [2022-12-06 04:25:33,603 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:33,603 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:33,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 61 transitions, 548 flow [2022-12-06 04:25:33,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 61 transitions, 548 flow [2022-12-06 04:25:33,657 INFO L130 PetriNetUnfolder]: 169/529 cut-off events. [2022-12-06 04:25:33,657 INFO L131 PetriNetUnfolder]: For 2114/2255 co-relation queries the response was YES. [2022-12-06 04:25:33,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 529 events. 169/529 cut-off events. For 2114/2255 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3912 event pairs, 18 based on Foata normal form. 31/544 useless extension candidates. Maximal degree in co-relation 2365. Up to 278 conditions per place. [2022-12-06 04:25:33,664 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 61 transitions, 548 flow [2022-12-06 04:25:33,664 INFO L188 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-06 04:25:33,665 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:33,667 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-06 04:25:33,667 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 548 flow [2022-12-06 04:25:33,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:33,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:33,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:33,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:25:33,668 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-06 04:25:33,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:33,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2042078924, now seen corresponding path program 1 times [2022-12-06 04:25:33,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:33,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535452016] [2022-12-06 04:25:33,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:33,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:25:33,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-06 04:25:33,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:25:33,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535452016] [2022-12-06 04:25:33,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535452016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:25:33,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:25:33,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:25:33,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073641905] [2022-12-06 04:25:33,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:25:33,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:25:33,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:25:33,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:25:33,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:25:33,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 04:25:33,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 548 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:33,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:25:33,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 04:25:33,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:25:34,192 INFO L130 PetriNetUnfolder]: 590/1146 cut-off events. [2022-12-06 04:25:34,193 INFO L131 PetriNetUnfolder]: For 5448/5469 co-relation queries the response was YES. [2022-12-06 04:25:34,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5746 conditions, 1146 events. 590/1146 cut-off events. For 5448/5469 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6849 event pairs, 53 based on Foata normal form. 50/1182 useless extension candidates. Maximal degree in co-relation 5717. Up to 488 conditions per place. [2022-12-06 04:25:34,203 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 87 selfloop transitions, 17 changer transitions 20/130 dead transitions. [2022-12-06 04:25:34,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 130 transitions, 1340 flow [2022-12-06 04:25:34,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:25:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:25:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-12-06 04:25:34,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42410714285714285 [2022-12-06 04:25:34,205 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 548 flow. Second operand 8 states and 95 transitions. [2022-12-06 04:25:34,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 130 transitions, 1340 flow [2022-12-06 04:25:34,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 130 transitions, 1264 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-06 04:25:34,231 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 506 flow [2022-12-06 04:25:34,231 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=506, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2022-12-06 04:25:34,232 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2022-12-06 04:25:34,232 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:25:34,232 INFO L89 Accepts]: Start accepts. Operand has 65 places, 59 transitions, 506 flow [2022-12-06 04:25:34,236 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:25:34,236 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:25:34,236 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 59 transitions, 506 flow [2022-12-06 04:25:34,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 59 transitions, 506 flow [2022-12-06 04:25:34,283 INFO L130 PetriNetUnfolder]: 122/447 cut-off events. [2022-12-06 04:25:34,283 INFO L131 PetriNetUnfolder]: For 1493/1569 co-relation queries the response was YES. [2022-12-06 04:25:34,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1958 conditions, 447 events. 122/447 cut-off events. For 1493/1569 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3455 event pairs, 11 based on Foata normal form. 28/461 useless extension candidates. Maximal degree in co-relation 1929. Up to 123 conditions per place. [2022-12-06 04:25:34,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 59 transitions, 506 flow [2022-12-06 04:25:34,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-06 04:25:34,290 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:25:34,291 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-06 04:25:34,291 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 506 flow [2022-12-06 04:25:34,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:25:34,291 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:25:34,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:34,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:25:34,292 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-06 04:25:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:25:34,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1515842224, now seen corresponding path program 1 times [2022-12-06 04:25:34,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:25:34,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004888137] [2022-12-06 04:25:34,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:25:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:25:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:25:34,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:25:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:25:34,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:25:34,398 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:25:34,399 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:25:34,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:25:34,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:25:34,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:25:34,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:25:34,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:25:34,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:25:34,402 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:25:34,408 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:25:34,408 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:25:34,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:25:34 BasicIcfg [2022-12-06 04:25:34,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:25:34,478 INFO L158 Benchmark]: Toolchain (without parser) took 16030.80ms. Allocated memory was 200.3MB in the beginning and 494.9MB in the end (delta: 294.6MB). Free memory was 174.8MB in the beginning and 330.5MB in the end (delta: -155.7MB). Peak memory consumption was 139.7MB. Max. memory is 8.0GB. [2022-12-06 04:25:34,478 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 200.3MB. Free memory is still 177.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:25:34,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.41ms. Allocated memory is still 200.3MB. Free memory was 174.8MB in the beginning and 148.3MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 04:25:34,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.36ms. Allocated memory is still 200.3MB. Free memory was 148.3MB in the beginning and 145.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:25:34,479 INFO L158 Benchmark]: Boogie Preprocessor took 46.15ms. Allocated memory is still 200.3MB. Free memory was 145.7MB in the beginning and 143.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:25:34,479 INFO L158 Benchmark]: RCFGBuilder took 749.65ms. Allocated memory is still 200.3MB. Free memory was 143.6MB in the beginning and 107.9MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-06 04:25:34,479 INFO L158 Benchmark]: TraceAbstraction took 14496.39ms. Allocated memory was 200.3MB in the beginning and 494.9MB in the end (delta: 294.6MB). Free memory was 107.4MB in the beginning and 330.5MB in the end (delta: -223.1MB). Peak memory consumption was 72.6MB. Max. memory is 8.0GB. [2022-12-06 04:25:34,480 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 200.3MB. Free memory is still 177.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 652.41ms. Allocated memory is still 200.3MB. Free memory was 174.8MB in the beginning and 148.3MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.36ms. Allocated memory is still 200.3MB. Free memory was 148.3MB in the beginning and 145.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.15ms. Allocated memory is still 200.3MB. Free memory was 145.7MB in the beginning and 143.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 749.65ms. Allocated memory is still 200.3MB. Free memory was 143.6MB in the beginning and 107.9MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 14496.39ms. Allocated memory was 200.3MB in the beginning and 494.9MB in the end (delta: 294.6MB). Free memory was 107.4MB in the beginning and 330.5MB in the end (delta: -223.1MB). Peak memory consumption was 72.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 112 PlacesBefore, 36 PlacesAfterwards, 104 TransitionsBefore, 27 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1295, independent: 1241, independent conditional: 1241, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1295, independent: 1241, independent conditional: 0, independent unconditional: 1241, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1295, independent: 1241, independent conditional: 0, independent unconditional: 1241, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1295, independent: 1241, independent conditional: 0, independent unconditional: 1241, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1125, independent: 1085, independent conditional: 0, independent unconditional: 1085, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1125, independent: 1061, independent conditional: 0, independent unconditional: 1061, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 317, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 274, dependent conditional: 0, dependent unconditional: 274, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1295, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1125, unknown conditional: 0, unknown unconditional: 1125] , Statistics on independence cache: Total cache size (in pairs): 1654, Positive cache size: 1614, Positive conditional cache size: 0, Positive unconditional cache size: 1614, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 86, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 86, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 86, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 77, independent: 62, independent conditional: 7, independent unconditional: 55, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 77, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 17, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 77, unknown conditional: 9, unknown unconditional: 68] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 62, Positive conditional cache size: 7, Positive unconditional cache size: 55, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 55, independent conditional: 11, independent unconditional: 44, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 55, independent conditional: 9, independent unconditional: 46, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 55, independent conditional: 9, independent unconditional: 46, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 6, independent unconditional: 10, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 39, independent conditional: 3, independent unconditional: 36, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 18, unknown conditional: 8, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 78, Positive conditional cache size: 13, Positive unconditional cache size: 65, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 4, independent unconditional: 49, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 79, Positive conditional cache size: 13, Positive unconditional cache size: 66, Negative cache size: 18, Negative conditional cache size: 5, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 42 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 99, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 32, independent unconditional: 67, dependent: 19, dependent conditional: 9, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 19, dependent conditional: 7, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 19, dependent conditional: 7, dependent unconditional: 12, 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: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, independent: 92, independent conditional: 0, independent unconditional: 92, dependent: 17, dependent conditional: 7, dependent unconditional: 10, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 91, Positive conditional cache size: 13, Positive unconditional cache size: 78, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 71, independent: 64, independent conditional: 31, independent unconditional: 33, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, independent: 64, independent conditional: 15, independent unconditional: 49, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, independent: 64, independent conditional: 15, independent unconditional: 49, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, independent: 64, independent conditional: 15, independent unconditional: 49, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 91, Positive conditional cache size: 13, Positive unconditional cache size: 78, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 41, independent conditional: 26, independent unconditional: 15, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 41, independent conditional: 11, independent unconditional: 30, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 41, independent conditional: 11, independent unconditional: 30, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 41, independent conditional: 11, independent unconditional: 30, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 91, Positive conditional cache size: 13, Positive unconditional cache size: 78, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, 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.1s, 50 PlacesBefore, 49 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 96, independent conditional: 96, 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: 96, independent: 96, independent conditional: 96, 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: 96, independent: 96, independent conditional: 96, 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: 96, independent: 96, independent conditional: 96, 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: 5, independent: 5, independent conditional: 5, 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: 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: 96, independent: 91, independent conditional: 91, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 102, Positive conditional cache size: 18, Positive unconditional cache size: 84, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 428 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): 122, Positive cache size: 102, Positive conditional cache size: 18, Positive unconditional cache size: 84, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 412 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): 122, Positive cache size: 102, Positive conditional cache size: 18, Positive unconditional cache size: 84, Negative cache size: 20, Negative conditional cache size: 5, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1876, ((void *)0), P0, ((void *)0))=-2, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1877, ((void *)0), P1, ((void *)0))=-1, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 pthread_t t1878; [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1878, ((void *)0), P2, ((void *)0))=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y [L741] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: 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, 134 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: 14.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 710 IncrementalHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 10 mSDtfsCounter, 710 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=548occurred in iteration=8, 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.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:25:34,502 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...