/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/mix014_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:19:37,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:19:37,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:19:38,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:19:38,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:19:38,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:19:38,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:19:38,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:19:38,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:19:38,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:19:38,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:19:38,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:19:38,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:19:38,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:19:38,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:19:38,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:19:38,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:19:38,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:19:38,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:19:38,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:19:38,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:19:38,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:19:38,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:19:38,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:19:38,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:19:38,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:19:38,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:19:38,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:19:38,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:19:38,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:19:38,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:19:38,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:19:38,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:19:38,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:19:38,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:19:38,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:19:38,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:19:38,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:19:38,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:19:38,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:19:38,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:19:38,034 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-13 09:19:38,050 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:19:38,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:19:38,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:19:38,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:19:38,052 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:19:38,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:19:38,052 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:19:38,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:19:38,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:19:38,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:19:38,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:19:38,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:19:38,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:19:38,053 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:19:38,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:19:38,054 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:19:38,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:19:38,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:19:38,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:19:38,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:19:38,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:19:38,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:19:38,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:19:38,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:19:38,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:19:38,056 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:19:38,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:19:38,056 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:19:38,056 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:19:38,056 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:19:38,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:19:38,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:19:38,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:19:38,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:19:38,348 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:19:38,360 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2022-12-13 09:19:39,354 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:19:39,650 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:19:39,651 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2022-12-13 09:19:39,675 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2cae5a64/3fc3c50c3374491aa2b237b758e3aea6/FLAG746d089d6 [2022-12-13 09:19:39,685 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2cae5a64/3fc3c50c3374491aa2b237b758e3aea6 [2022-12-13 09:19:39,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:19:39,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:19:39,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:19:39,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:19:39,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:19:39,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:19:39" (1/1) ... [2022-12-13 09:19:39,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61360cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:39, skipping insertion in model container [2022-12-13 09:19:39,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:19:39" (1/1) ... [2022-12-13 09:19:39,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:19:39,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:19:39,833 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/mix014_tso.oepc.i[949,962] [2022-12-13 09:19:39,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:39,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:39,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:39,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:39,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:39,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:39,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:39,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:39,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:39,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:39,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:39,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:39,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,022 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:19:40,066 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:19:40,074 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/mix014_tso.oepc.i[949,962] [2022-12-13 09:19:40,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:19:40,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:19:40,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:19:40,159 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:19:40,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:40 WrapperNode [2022-12-13 09:19:40,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:19:40,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:19:40,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:19:40,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:19:40,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:40" (1/1) ... [2022-12-13 09:19:40,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:40" (1/1) ... [2022-12-13 09:19:40,215 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 257 [2022-12-13 09:19:40,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:19:40,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:19:40,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:19:40,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:19:40,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:40" (1/1) ... [2022-12-13 09:19:40,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:40" (1/1) ... [2022-12-13 09:19:40,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:40" (1/1) ... [2022-12-13 09:19:40,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:40" (1/1) ... [2022-12-13 09:19:40,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:40" (1/1) ... [2022-12-13 09:19:40,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:40" (1/1) ... [2022-12-13 09:19:40,238 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:40" (1/1) ... [2022-12-13 09:19:40,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:40" (1/1) ... [2022-12-13 09:19:40,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:19:40,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:19:40,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:19:40,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:19:40,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:40" (1/1) ... [2022-12-13 09:19:40,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:19:40,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:19:40,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:19:40,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:19:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:19:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:19:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:19:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:19:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:19:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:19:40,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:19:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:19:40,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:19:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:19:40,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:19:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 09:19:40,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 09:19:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:19:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:19:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:19:40,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:19:40,422 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:19:40,553 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:19:40,554 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:19:41,011 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:19:41,199 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:19:41,199 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:19:41,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:19:41 BoogieIcfgContainer [2022-12-13 09:19:41,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:19:41,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:19:41,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:19:41,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:19:41,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:19:39" (1/3) ... [2022-12-13 09:19:41,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e50919d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:19:41, skipping insertion in model container [2022-12-13 09:19:41,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:19:40" (2/3) ... [2022-12-13 09:19:41,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e50919d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:19:41, skipping insertion in model container [2022-12-13 09:19:41,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:19:41" (3/3) ... [2022-12-13 09:19:41,211 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_tso.oepc.i [2022-12-13 09:19:41,225 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:19:41,226 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-13 09:19:41,226 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:19:41,320 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:19:41,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 152 transitions, 324 flow [2022-12-13 09:19:41,395 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-12-13 09:19:41,395 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:41,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 09:19:41,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 152 transitions, 324 flow [2022-12-13 09:19:41,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 148 transitions, 308 flow [2022-12-13 09:19:41,405 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:19:41,416 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 308 flow [2022-12-13 09:19:41,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 308 flow [2022-12-13 09:19:41,441 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-12-13 09:19:41,442 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:41,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 09:19:41,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 308 flow [2022-12-13 09:19:41,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 3408 [2022-12-13 09:19:50,849 INFO L241 LiptonReduction]: Total number of compositions: 119 [2022-12-13 09:19:50,874 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:19:50,881 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;@6cac55c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:19:50,881 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-12-13 09:19:50,885 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 09:19:50,885 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:19:50,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:19:50,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:19:50,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 09:19:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:19:50,889 INFO L85 PathProgramCache]: Analyzing trace with hash 737521066, now seen corresponding path program 1 times [2022-12-13 09:19:50,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:19:50,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518485778] [2022-12-13 09:19:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:19:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:19:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:19:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:19:51,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:19:51,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518485778] [2022-12-13 09:19:51,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518485778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:19:51,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:19:51,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:19:51,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581576335] [2022-12-13 09:19:51,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:19:51,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:19:51,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:19:51,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:19:51,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:19:51,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 79 [2022-12-13 09:19:51,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 79 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:19:51,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:19:51,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 79 [2022-12-13 09:19:51,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:05,242 INFO L130 PetriNetUnfolder]: 99185/136745 cut-off events. [2022-12-13 09:20:05,243 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-12-13 09:20:05,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267319 conditions, 136745 events. 99185/136745 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 6187. Compared 990481 event pairs, 35207 based on Foata normal form. 0/83223 useless extension candidates. Maximal degree in co-relation 267307. Up to 115249 conditions per place. [2022-12-13 09:20:05,875 INFO L137 encePairwiseOnDemand]: 75/79 looper letters, 104 selfloop transitions, 2 changer transitions 8/129 dead transitions. [2022-12-13 09:20:05,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 129 transitions, 504 flow [2022-12-13 09:20:05,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:20:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:20:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-12-13 09:20:05,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6835443037974683 [2022-12-13 09:20:05,886 INFO L175 Difference]: Start difference. First operand has 92 places, 79 transitions, 170 flow. Second operand 3 states and 162 transitions. [2022-12-13 09:20:05,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 129 transitions, 504 flow [2022-12-13 09:20:05,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 129 transitions, 498 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 09:20:05,895 INFO L231 Difference]: Finished difference. Result has 88 places, 73 transitions, 158 flow [2022-12-13 09:20:05,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=88, PETRI_TRANSITIONS=73} [2022-12-13 09:20:05,900 INFO L295 CegarLoopForPetriNet]: 92 programPoint places, -4 predicate places. [2022-12-13 09:20:05,900 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:05,900 INFO L89 Accepts]: Start accepts. Operand has 88 places, 73 transitions, 158 flow [2022-12-13 09:20:05,903 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:05,903 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:05,903 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 73 transitions, 158 flow [2022-12-13 09:20:05,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 158 flow [2022-12-13 09:20:05,920 INFO L130 PetriNetUnfolder]: 0/73 cut-off events. [2022-12-13 09:20:05,920 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:05,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 73 events. 0/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 311 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:20:05,924 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 73 transitions, 158 flow [2022-12-13 09:20:05,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 2896 [2022-12-13 09:20:06,093 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:06,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-13 09:20:06,095 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 73 transitions, 158 flow [2022-12-13 09:20:06,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:06,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:06,095 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:06,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:20:06,096 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 09:20:06,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash 88192876, now seen corresponding path program 1 times [2022-12-13 09:20:06,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:06,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595732087] [2022-12-13 09:20:06,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:06,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:06,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:06,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595732087] [2022-12-13 09:20:06,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595732087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:06,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:06,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:20:06,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357493944] [2022-12-13 09:20:06,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:06,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:20:06,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:06,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:20:06,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:20:06,286 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 73 [2022-12-13 09:20:06,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 73 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:06,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:06,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 73 [2022-12-13 09:20:06,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:17,146 INFO L130 PetriNetUnfolder]: 81630/118555 cut-off events. [2022-12-13 09:20:17,147 INFO L131 PetriNetUnfolder]: For 3657/3657 co-relation queries the response was YES. [2022-12-13 09:20:17,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229912 conditions, 118555 events. 81630/118555 cut-off events. For 3657/3657 co-relation queries the response was YES. Maximal size of possible extension queue 5432. Compared 957178 event pairs, 12338 based on Foata normal form. 0/77358 useless extension candidates. Maximal degree in co-relation 229902. Up to 89733 conditions per place. [2022-12-13 09:20:17,499 INFO L137 encePairwiseOnDemand]: 70/73 looper letters, 46 selfloop transitions, 2 changer transitions 56/119 dead transitions. [2022-12-13 09:20:17,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 119 transitions, 462 flow [2022-12-13 09:20:17,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:20:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:20:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-12-13 09:20:17,501 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.684931506849315 [2022-12-13 09:20:17,501 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 158 flow. Second operand 3 states and 150 transitions. [2022-12-13 09:20:17,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 119 transitions, 462 flow [2022-12-13 09:20:17,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 119 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:20:17,506 INFO L231 Difference]: Finished difference. Result has 83 places, 44 transitions, 100 flow [2022-12-13 09:20:17,506 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=83, PETRI_TRANSITIONS=44} [2022-12-13 09:20:17,507 INFO L295 CegarLoopForPetriNet]: 92 programPoint places, -9 predicate places. [2022-12-13 09:20:17,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:17,507 INFO L89 Accepts]: Start accepts. Operand has 83 places, 44 transitions, 100 flow [2022-12-13 09:20:17,508 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:17,508 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:17,508 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 44 transitions, 100 flow [2022-12-13 09:20:17,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 44 transitions, 100 flow [2022-12-13 09:20:17,514 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-12-13 09:20:17,514 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:17,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 44 events. 0/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 117 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:20:17,514 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 44 transitions, 100 flow [2022-12-13 09:20:17,514 INFO L226 LiptonReduction]: Number of co-enabled transitions 1164 [2022-12-13 09:20:17,733 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:17,734 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-13 09:20:17,735 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 100 flow [2022-12-13 09:20:17,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:17,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:17,736 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:17,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:20:17,736 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 09:20:17,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1714075343, now seen corresponding path program 1 times [2022-12-13 09:20:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:17,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069510947] [2022-12-13 09:20:17,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:18,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:18,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069510947] [2022-12-13 09:20:18,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069510947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:18,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:18,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:20:18,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479808830] [2022-12-13 09:20:18,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:18,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:20:18,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:18,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:20:18,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:20:18,142 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2022-12-13 09:20:18,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:18,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:18,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2022-12-13 09:20:18,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:20,560 INFO L130 PetriNetUnfolder]: 21741/30026 cut-off events. [2022-12-13 09:20:20,560 INFO L131 PetriNetUnfolder]: For 1164/1164 co-relation queries the response was YES. [2022-12-13 09:20:20,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60702 conditions, 30026 events. 21741/30026 cut-off events. For 1164/1164 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 163901 event pairs, 6501 based on Foata normal form. 504/26134 useless extension candidates. Maximal degree in co-relation 60692. Up to 21289 conditions per place. [2022-12-13 09:20:20,708 INFO L137 encePairwiseOnDemand]: 41/44 looper letters, 49 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2022-12-13 09:20:20,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 240 flow [2022-12-13 09:20:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:20:20,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:20:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-12-13 09:20:20,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6439393939393939 [2022-12-13 09:20:20,709 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 100 flow. Second operand 3 states and 85 transitions. [2022-12-13 09:20:20,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 240 flow [2022-12-13 09:20:20,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:20:20,713 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 104 flow [2022-12-13 09:20:20,713 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2022-12-13 09:20:20,714 INFO L295 CegarLoopForPetriNet]: 92 programPoint places, -36 predicate places. [2022-12-13 09:20:20,714 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:20,714 INFO L89 Accepts]: Start accepts. Operand has 56 places, 44 transitions, 104 flow [2022-12-13 09:20:20,714 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:20,715 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:20,715 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 44 transitions, 104 flow [2022-12-13 09:20:20,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 44 transitions, 104 flow [2022-12-13 09:20:20,719 INFO L130 PetriNetUnfolder]: 0/44 cut-off events. [2022-12-13 09:20:20,719 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:20:20,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 44 events. 0/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 125 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:20:20,720 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 44 transitions, 104 flow [2022-12-13 09:20:20,720 INFO L226 LiptonReduction]: Number of co-enabled transitions 1158 [2022-12-13 09:20:20,773 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:20:20,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-13 09:20:20,774 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 102 flow [2022-12-13 09:20:20,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:20,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:20,775 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:20,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:20:20,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 09:20:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:20,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1596671786, now seen corresponding path program 1 times [2022-12-13 09:20:20,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:20,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123773167] [2022-12-13 09:20:20,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:20,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:20,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:20,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:20,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123773167] [2022-12-13 09:20:20,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123773167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:20,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:20,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:20:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639046613] [2022-12-13 09:20:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:20,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:20:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:20,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:20:20,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:20:20,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2022-12-13 09:20:20,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:20,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:20,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2022-12-13 09:20:20,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:22,292 INFO L130 PetriNetUnfolder]: 10235/14455 cut-off events. [2022-12-13 09:20:22,292 INFO L131 PetriNetUnfolder]: For 1095/1095 co-relation queries the response was YES. [2022-12-13 09:20:22,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30233 conditions, 14455 events. 10235/14455 cut-off events. For 1095/1095 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 84530 event pairs, 2570 based on Foata normal form. 200/11983 useless extension candidates. Maximal degree in co-relation 30222. Up to 10741 conditions per place. [2022-12-13 09:20:22,343 INFO L137 encePairwiseOnDemand]: 40/43 looper letters, 45 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2022-12-13 09:20:22,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 239 flow [2022-12-13 09:20:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:20:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:20:22,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-12-13 09:20:22,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2022-12-13 09:20:22,345 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 102 flow. Second operand 3 states and 90 transitions. [2022-12-13 09:20:22,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 239 flow [2022-12-13 09:20:22,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 233 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:20:22,348 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 106 flow [2022-12-13 09:20:22,349 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2022-12-13 09:20:22,349 INFO L295 CegarLoopForPetriNet]: 92 programPoint places, -36 predicate places. [2022-12-13 09:20:22,349 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:22,349 INFO L89 Accepts]: Start accepts. Operand has 56 places, 43 transitions, 106 flow [2022-12-13 09:20:22,350 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:22,350 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:22,350 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 43 transitions, 106 flow [2022-12-13 09:20:22,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 43 transitions, 106 flow [2022-12-13 09:20:22,354 INFO L130 PetriNetUnfolder]: 0/43 cut-off events. [2022-12-13 09:20:22,355 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 09:20:22,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 43 events. 0/43 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 123 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:20:22,355 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 43 transitions, 106 flow [2022-12-13 09:20:22,355 INFO L226 LiptonReduction]: Number of co-enabled transitions 1102 [2022-12-13 09:20:22,364 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:22,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 09:20:22,365 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 106 flow [2022-12-13 09:20:22,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:22,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:22,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:22,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:20:22,365 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 09:20:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1265685024, now seen corresponding path program 1 times [2022-12-13 09:20:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:22,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167478989] [2022-12-13 09:20:22,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:22,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:22,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167478989] [2022-12-13 09:20:22,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167478989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:22,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:22,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:20:22,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587029132] [2022-12-13 09:20:22,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:22,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:20:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:22,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:20:22,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:20:22,505 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2022-12-13 09:20:22,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:22,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:22,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2022-12-13 09:20:22,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:24,445 INFO L130 PetriNetUnfolder]: 18865/25636 cut-off events. [2022-12-13 09:20:24,445 INFO L131 PetriNetUnfolder]: For 2832/2832 co-relation queries the response was YES. [2022-12-13 09:20:24,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56000 conditions, 25636 events. 18865/25636 cut-off events. For 2832/2832 co-relation queries the response was YES. Maximal size of possible extension queue 1041. Compared 143029 event pairs, 5614 based on Foata normal form. 135/17894 useless extension candidates. Maximal degree in co-relation 55988. Up to 24745 conditions per place. [2022-12-13 09:20:24,569 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 48 selfloop transitions, 13 changer transitions 0/71 dead transitions. [2022-12-13 09:20:24,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 294 flow [2022-12-13 09:20:24,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:20:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:20:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-12-13 09:20:24,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7131782945736435 [2022-12-13 09:20:24,571 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 106 flow. Second operand 3 states and 92 transitions. [2022-12-13 09:20:24,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 294 flow [2022-12-13 09:20:24,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:20:24,574 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 191 flow [2022-12-13 09:20:24,574 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2022-12-13 09:20:24,574 INFO L295 CegarLoopForPetriNet]: 92 programPoint places, -35 predicate places. [2022-12-13 09:20:24,574 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:24,574 INFO L89 Accepts]: Start accepts. Operand has 57 places, 55 transitions, 191 flow [2022-12-13 09:20:24,575 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:24,575 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:24,575 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 55 transitions, 191 flow [2022-12-13 09:20:24,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 55 transitions, 191 flow [2022-12-13 09:20:24,708 INFO L130 PetriNetUnfolder]: 1269/2317 cut-off events. [2022-12-13 09:20:24,708 INFO L131 PetriNetUnfolder]: For 255/255 co-relation queries the response was YES. [2022-12-13 09:20:24,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4634 conditions, 2317 events. 1269/2317 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 17390 event pairs, 783 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 4624. Up to 1780 conditions per place. [2022-12-13 09:20:24,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 55 transitions, 191 flow [2022-12-13 09:20:24,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 1390 [2022-12-13 09:20:24,755 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:24,758 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 184 [2022-12-13 09:20:24,758 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 191 flow [2022-12-13 09:20:24,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:24,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:24,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:24,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:20:24,759 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 09:20:24,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:24,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1890217336, now seen corresponding path program 1 times [2022-12-13 09:20:24,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:24,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312474154] [2022-12-13 09:20:24,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:24,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:25,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:25,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312474154] [2022-12-13 09:20:25,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312474154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:25,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:25,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:20:25,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018800853] [2022-12-13 09:20:25,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:25,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:20:25,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:25,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:20:25,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:20:25,214 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2022-12-13 09:20:25,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:25,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:25,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2022-12-13 09:20:25,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:27,077 INFO L130 PetriNetUnfolder]: 12952/18508 cut-off events. [2022-12-13 09:20:27,078 INFO L131 PetriNetUnfolder]: For 2492/2492 co-relation queries the response was YES. [2022-12-13 09:20:27,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50319 conditions, 18508 events. 12952/18508 cut-off events. For 2492/2492 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 110182 event pairs, 2104 based on Foata normal form. 486/13385 useless extension candidates. Maximal degree in co-relation 50306. Up to 15157 conditions per place. [2022-12-13 09:20:27,168 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 62 selfloop transitions, 25 changer transitions 0/97 dead transitions. [2022-12-13 09:20:27,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 487 flow [2022-12-13 09:20:27,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:20:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:20:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-12-13 09:20:27,170 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2022-12-13 09:20:27,170 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 191 flow. Second operand 4 states and 128 transitions. [2022-12-13 09:20:27,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 487 flow [2022-12-13 09:20:27,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 97 transitions, 474 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:20:27,174 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 326 flow [2022-12-13 09:20:27,174 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2022-12-13 09:20:27,174 INFO L295 CegarLoopForPetriNet]: 92 programPoint places, -32 predicate places. [2022-12-13 09:20:27,174 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:27,174 INFO L89 Accepts]: Start accepts. Operand has 60 places, 67 transitions, 326 flow [2022-12-13 09:20:27,175 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:27,175 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:27,175 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 67 transitions, 326 flow [2022-12-13 09:20:27,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 67 transitions, 326 flow [2022-12-13 09:20:27,310 INFO L130 PetriNetUnfolder]: 1161/2173 cut-off events. [2022-12-13 09:20:27,310 INFO L131 PetriNetUnfolder]: For 270/372 co-relation queries the response was YES. [2022-12-13 09:20:27,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6103 conditions, 2173 events. 1161/2173 cut-off events. For 270/372 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 16093 event pairs, 351 based on Foata normal form. 4/1215 useless extension candidates. Maximal degree in co-relation 6091. Up to 1660 conditions per place. [2022-12-13 09:20:27,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 67 transitions, 326 flow [2022-12-13 09:20:27,327 INFO L226 LiptonReduction]: Number of co-enabled transitions 1774 [2022-12-13 09:20:27,469 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:27,471 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 297 [2022-12-13 09:20:27,471 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 326 flow [2022-12-13 09:20:27,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:27,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:27,471 INFO L214 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-13 09:20:27,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:20:27,472 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 09:20:27,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:27,475 INFO L85 PathProgramCache]: Analyzing trace with hash -480859114, now seen corresponding path program 1 times [2022-12-13 09:20:27,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:27,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493217644] [2022-12-13 09:20:27,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:27,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:27,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:27,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493217644] [2022-12-13 09:20:27,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493217644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:27,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:27,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:20:27,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614602260] [2022-12-13 09:20:27,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:27,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:20:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:27,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:20:27,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:20:27,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2022-12-13 09:20:27,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 67 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:27,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:27,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2022-12-13 09:20:27,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:28,896 INFO L130 PetriNetUnfolder]: 7444/11299 cut-off events. [2022-12-13 09:20:28,896 INFO L131 PetriNetUnfolder]: For 2472/2472 co-relation queries the response was YES. [2022-12-13 09:20:28,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37433 conditions, 11299 events. 7444/11299 cut-off events. For 2472/2472 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 68951 event pairs, 727 based on Foata normal form. 648/8444 useless extension candidates. Maximal degree in co-relation 37418. Up to 5554 conditions per place. [2022-12-13 09:20:28,944 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 74 selfloop transitions, 37 changer transitions 0/121 dead transitions. [2022-12-13 09:20:28,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 121 transitions, 722 flow [2022-12-13 09:20:28,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:20:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:20:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2022-12-13 09:20:28,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7534883720930232 [2022-12-13 09:20:28,946 INFO L175 Difference]: Start difference. First operand has 60 places, 67 transitions, 326 flow. Second operand 5 states and 162 transitions. [2022-12-13 09:20:28,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 121 transitions, 722 flow [2022-12-13 09:20:28,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 121 transitions, 672 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 09:20:28,954 INFO L231 Difference]: Finished difference. Result has 63 places, 79 transitions, 472 flow [2022-12-13 09:20:28,955 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=472, PETRI_PLACES=63, PETRI_TRANSITIONS=79} [2022-12-13 09:20:28,955 INFO L295 CegarLoopForPetriNet]: 92 programPoint places, -29 predicate places. [2022-12-13 09:20:28,955 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:28,955 INFO L89 Accepts]: Start accepts. Operand has 63 places, 79 transitions, 472 flow [2022-12-13 09:20:28,956 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:28,956 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:28,956 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 79 transitions, 472 flow [2022-12-13 09:20:28,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 79 transitions, 472 flow [2022-12-13 09:20:29,077 INFO L130 PetriNetUnfolder]: 837/1687 cut-off events. [2022-12-13 09:20:29,077 INFO L131 PetriNetUnfolder]: For 393/495 co-relation queries the response was YES. [2022-12-13 09:20:29,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6143 conditions, 1687 events. 837/1687 cut-off events. For 393/495 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 12034 event pairs, 81 based on Foata normal form. 4/945 useless extension candidates. Maximal degree in co-relation 6130. Up to 1270 conditions per place. [2022-12-13 09:20:29,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 79 transitions, 472 flow [2022-12-13 09:20:29,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 1798 [2022-12-13 09:20:29,102 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:29,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-13 09:20:29,103 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 79 transitions, 472 flow [2022-12-13 09:20:29,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:29,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:29,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:29,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:20:29,104 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 09:20:29,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:29,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1122239424, now seen corresponding path program 1 times [2022-12-13 09:20:29,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:29,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488423889] [2022-12-13 09:20:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:29,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:29,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:29,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:29,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488423889] [2022-12-13 09:20:29,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488423889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:29,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:29,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:20:29,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73578858] [2022-12-13 09:20:29,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:29,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:20:29,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:29,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:20:29,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:20:29,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 09:20:29,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 79 transitions, 472 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:29,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:29,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 09:20:29,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:31,503 INFO L130 PetriNetUnfolder]: 13219/20700 cut-off events. [2022-12-13 09:20:31,503 INFO L131 PetriNetUnfolder]: For 20876/24452 co-relation queries the response was YES. [2022-12-13 09:20:31,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72853 conditions, 20700 events. 13219/20700 cut-off events. For 20876/24452 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 143072 event pairs, 1839 based on Foata normal form. 1883/18879 useless extension candidates. Maximal degree in co-relation 72837. Up to 10871 conditions per place. [2022-12-13 09:20:31,629 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 133 selfloop transitions, 11 changer transitions 14/181 dead transitions. [2022-12-13 09:20:31,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 181 transitions, 1329 flow [2022-12-13 09:20:31,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:20:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:20:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2022-12-13 09:20:31,630 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6395348837209303 [2022-12-13 09:20:31,630 INFO L175 Difference]: Start difference. First operand has 63 places, 79 transitions, 472 flow. Second operand 6 states and 165 transitions. [2022-12-13 09:20:31,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 181 transitions, 1329 flow [2022-12-13 09:20:31,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 181 transitions, 1119 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-12-13 09:20:31,945 INFO L231 Difference]: Finished difference. Result has 69 places, 88 transitions, 451 flow [2022-12-13 09:20:31,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=451, PETRI_PLACES=69, PETRI_TRANSITIONS=88} [2022-12-13 09:20:31,946 INFO L295 CegarLoopForPetriNet]: 92 programPoint places, -23 predicate places. [2022-12-13 09:20:31,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:31,946 INFO L89 Accepts]: Start accepts. Operand has 69 places, 88 transitions, 451 flow [2022-12-13 09:20:31,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:31,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:31,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 88 transitions, 451 flow [2022-12-13 09:20:31,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 88 transitions, 451 flow [2022-12-13 09:20:32,338 INFO L130 PetriNetUnfolder]: 2135/4246 cut-off events. [2022-12-13 09:20:32,338 INFO L131 PetriNetUnfolder]: For 2634/2883 co-relation queries the response was YES. [2022-12-13 09:20:32,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12895 conditions, 4246 events. 2135/4246 cut-off events. For 2634/2883 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 36442 event pairs, 170 based on Foata normal form. 21/2132 useless extension candidates. Maximal degree in co-relation 12878. Up to 2944 conditions per place. [2022-12-13 09:20:32,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 88 transitions, 451 flow [2022-12-13 09:20:32,369 INFO L226 LiptonReduction]: Number of co-enabled transitions 1962 [2022-12-13 09:20:32,390 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:32,391 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 445 [2022-12-13 09:20:32,391 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 88 transitions, 451 flow [2022-12-13 09:20:32,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:32,391 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:32,391 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:32,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:20:32,391 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 09:20:32,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1783928466, now seen corresponding path program 1 times [2022-12-13 09:20:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:32,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106141800] [2022-12-13 09:20:32,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:33,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:33,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106141800] [2022-12-13 09:20:33,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106141800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:33,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:33,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:20:33,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539165480] [2022-12-13 09:20:33,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:33,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:20:33,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:33,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:20:33,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:20:33,237 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2022-12-13 09:20:33,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 88 transitions, 451 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:33,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:33,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2022-12-13 09:20:33,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:36,418 INFO L130 PetriNetUnfolder]: 19804/31805 cut-off events. [2022-12-13 09:20:36,419 INFO L131 PetriNetUnfolder]: For 33685/37046 co-relation queries the response was YES. [2022-12-13 09:20:36,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104722 conditions, 31805 events. 19804/31805 cut-off events. For 33685/37046 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 248880 event pairs, 2586 based on Foata normal form. 2388/27864 useless extension candidates. Maximal degree in co-relation 104702. Up to 15814 conditions per place. [2022-12-13 09:20:36,621 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 124 selfloop transitions, 9 changer transitions 6/167 dead transitions. [2022-12-13 09:20:36,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 167 transitions, 1116 flow [2022-12-13 09:20:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:20:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:20:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2022-12-13 09:20:36,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6465116279069767 [2022-12-13 09:20:36,622 INFO L175 Difference]: Start difference. First operand has 69 places, 88 transitions, 451 flow. Second operand 5 states and 139 transitions. [2022-12-13 09:20:36,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 167 transitions, 1116 flow [2022-12-13 09:20:37,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 167 transitions, 1116 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:20:37,353 INFO L231 Difference]: Finished difference. Result has 75 places, 93 transitions, 505 flow [2022-12-13 09:20:37,353 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=505, PETRI_PLACES=75, PETRI_TRANSITIONS=93} [2022-12-13 09:20:37,353 INFO L295 CegarLoopForPetriNet]: 92 programPoint places, -17 predicate places. [2022-12-13 09:20:37,353 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:37,353 INFO L89 Accepts]: Start accepts. Operand has 75 places, 93 transitions, 505 flow [2022-12-13 09:20:37,354 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:37,354 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:37,354 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 93 transitions, 505 flow [2022-12-13 09:20:37,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 93 transitions, 505 flow [2022-12-13 09:20:38,181 INFO L130 PetriNetUnfolder]: 6892/12936 cut-off events. [2022-12-13 09:20:38,181 INFO L131 PetriNetUnfolder]: For 8327/11857 co-relation queries the response was YES. [2022-12-13 09:20:38,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37974 conditions, 12936 events. 6892/12936 cut-off events. For 8327/11857 co-relation queries the response was YES. Maximal size of possible extension queue 1494. Compared 121414 event pairs, 809 based on Foata normal form. 82/5974 useless extension candidates. Maximal degree in co-relation 37953. Up to 8371 conditions per place. [2022-12-13 09:20:38,293 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 93 transitions, 505 flow [2022-12-13 09:20:38,293 INFO L226 LiptonReduction]: Number of co-enabled transitions 2314 [2022-12-13 09:20:38,408 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:38,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1056 [2022-12-13 09:20:38,409 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 93 transitions, 505 flow [2022-12-13 09:20:38,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:38,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:38,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:38,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:20:38,409 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 09:20:38,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:38,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1911575136, now seen corresponding path program 2 times [2022-12-13 09:20:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:38,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342358590] [2022-12-13 09:20:38,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:38,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:38,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:38,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342358590] [2022-12-13 09:20:38,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342358590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:38,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:38,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:20:38,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954561232] [2022-12-13 09:20:38,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:38,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:20:38,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:38,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:20:38,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:20:38,656 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2022-12-13 09:20:38,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 93 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:38,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:38,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2022-12-13 09:20:38,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:41,099 INFO L130 PetriNetUnfolder]: 18089/26585 cut-off events. [2022-12-13 09:20:41,100 INFO L131 PetriNetUnfolder]: For 29582/29813 co-relation queries the response was YES. [2022-12-13 09:20:41,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94139 conditions, 26585 events. 18089/26585 cut-off events. For 29582/29813 co-relation queries the response was YES. Maximal size of possible extension queue 1120. Compared 173347 event pairs, 727 based on Foata normal form. 1435/18497 useless extension candidates. Maximal degree in co-relation 94115. Up to 9576 conditions per place. [2022-12-13 09:20:41,188 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 72 selfloop transitions, 49 changer transitions 15/147 dead transitions. [2022-12-13 09:20:41,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 147 transitions, 1020 flow [2022-12-13 09:20:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:20:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:20:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2022-12-13 09:20:41,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 09:20:41,190 INFO L175 Difference]: Start difference. First operand has 75 places, 93 transitions, 505 flow. Second operand 6 states and 172 transitions. [2022-12-13 09:20:41,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 147 transitions, 1020 flow [2022-12-13 09:20:42,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 147 transitions, 992 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 09:20:42,493 INFO L231 Difference]: Finished difference. Result has 77 places, 86 transitions, 573 flow [2022-12-13 09:20:42,494 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=77, PETRI_TRANSITIONS=86} [2022-12-13 09:20:42,494 INFO L295 CegarLoopForPetriNet]: 92 programPoint places, -15 predicate places. [2022-12-13 09:20:42,494 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:42,494 INFO L89 Accepts]: Start accepts. Operand has 77 places, 86 transitions, 573 flow [2022-12-13 09:20:42,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:42,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:42,495 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 86 transitions, 573 flow [2022-12-13 09:20:42,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 86 transitions, 573 flow [2022-12-13 09:20:42,730 INFO L130 PetriNetUnfolder]: 2489/4660 cut-off events. [2022-12-13 09:20:42,731 INFO L131 PetriNetUnfolder]: For 2794/5398 co-relation queries the response was YES. [2022-12-13 09:20:42,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17291 conditions, 4660 events. 2489/4660 cut-off events. For 2794/5398 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 37272 event pairs, 49 based on Foata normal form. 0/1689 useless extension candidates. Maximal degree in co-relation 17271. Up to 2593 conditions per place. [2022-12-13 09:20:42,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 86 transitions, 573 flow [2022-12-13 09:20:42,779 INFO L226 LiptonReduction]: Number of co-enabled transitions 1916 [2022-12-13 09:20:45,715 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:20:45,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3222 [2022-12-13 09:20:45,716 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 83 transitions, 570 flow [2022-12-13 09:20:45,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:45,716 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:45,716 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:45,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:20:45,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 09:20:45,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:45,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1236511964, now seen corresponding path program 1 times [2022-12-13 09:20:45,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:45,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584808695] [2022-12-13 09:20:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:45,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:49,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584808695] [2022-12-13 09:20:49,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584808695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:49,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:49,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:20:49,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582626848] [2022-12-13 09:20:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:49,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:20:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:20:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:20:49,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2022-12-13 09:20:49,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 83 transitions, 570 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:49,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:49,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2022-12-13 09:20:49,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:51,270 INFO L130 PetriNetUnfolder]: 14851/22162 cut-off events. [2022-12-13 09:20:51,270 INFO L131 PetriNetUnfolder]: For 40668/42295 co-relation queries the response was YES. [2022-12-13 09:20:51,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90780 conditions, 22162 events. 14851/22162 cut-off events. For 40668/42295 co-relation queries the response was YES. Maximal size of possible extension queue 1299. Compared 147663 event pairs, 1631 based on Foata normal form. 635/17824 useless extension candidates. Maximal degree in co-relation 90757. Up to 8314 conditions per place. [2022-12-13 09:20:51,388 INFO L137 encePairwiseOnDemand]: 35/40 looper letters, 78 selfloop transitions, 4 changer transitions 61/165 dead transitions. [2022-12-13 09:20:51,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 165 transitions, 1422 flow [2022-12-13 09:20:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:20:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:20:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2022-12-13 09:20:51,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.615 [2022-12-13 09:20:51,390 INFO L175 Difference]: Start difference. First operand has 71 places, 83 transitions, 570 flow. Second operand 5 states and 123 transitions. [2022-12-13 09:20:51,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 165 transitions, 1422 flow [2022-12-13 09:20:53,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 165 transitions, 1148 flow, removed 61 selfloop flow, removed 5 redundant places. [2022-12-13 09:20:54,000 INFO L231 Difference]: Finished difference. Result has 72 places, 82 transitions, 430 flow [2022-12-13 09:20:54,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=430, PETRI_PLACES=72, PETRI_TRANSITIONS=82} [2022-12-13 09:20:54,001 INFO L295 CegarLoopForPetriNet]: 92 programPoint places, -20 predicate places. [2022-12-13 09:20:54,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:20:54,001 INFO L89 Accepts]: Start accepts. Operand has 72 places, 82 transitions, 430 flow [2022-12-13 09:20:54,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:20:54,002 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:20:54,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 82 transitions, 430 flow [2022-12-13 09:20:54,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 82 transitions, 430 flow [2022-12-13 09:20:54,192 INFO L130 PetriNetUnfolder]: 2350/4069 cut-off events. [2022-12-13 09:20:54,192 INFO L131 PetriNetUnfolder]: For 3212/3374 co-relation queries the response was YES. [2022-12-13 09:20:54,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11826 conditions, 4069 events. 2350/4069 cut-off events. For 3212/3374 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 30618 event pairs, 32 based on Foata normal form. 16/1374 useless extension candidates. Maximal degree in co-relation 11805. Up to 1756 conditions per place. [2022-12-13 09:20:54,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 82 transitions, 430 flow [2022-12-13 09:20:54,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 1766 [2022-12-13 09:20:54,237 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:20:54,238 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 237 [2022-12-13 09:20:54,238 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 82 transitions, 430 flow [2022-12-13 09:20:54,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:54,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:20:54,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:20:54,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:20:54,238 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 09:20:54,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:20:54,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1853032080, now seen corresponding path program 1 times [2022-12-13 09:20:54,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:20:54,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208050435] [2022-12-13 09:20:54,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:20:54,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:20:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:20:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:20:56,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:20:56,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208050435] [2022-12-13 09:20:56,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208050435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:20:56,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:20:56,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 09:20:56,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411012371] [2022-12-13 09:20:56,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:20:56,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 09:20:56,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:20:56,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 09:20:56,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 09:20:56,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2022-12-13 09:20:56,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 82 transitions, 430 flow. Second operand has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:20:56,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:20:56,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2022-12-13 09:20:56,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:20:58,810 INFO L130 PetriNetUnfolder]: 18207/27638 cut-off events. [2022-12-13 09:20:58,810 INFO L131 PetriNetUnfolder]: For 41528/42853 co-relation queries the response was YES. [2022-12-13 09:20:58,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97419 conditions, 27638 events. 18207/27638 cut-off events. For 41528/42853 co-relation queries the response was YES. Maximal size of possible extension queue 1561. Compared 199593 event pairs, 2369 based on Foata normal form. 858/21703 useless extension candidates. Maximal degree in co-relation 97395. Up to 9531 conditions per place. [2022-12-13 09:20:59,014 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 164 selfloop transitions, 19 changer transitions 74/282 dead transitions. [2022-12-13 09:20:59,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 282 transitions, 2004 flow [2022-12-13 09:20:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 09:20:59,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 09:20:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 242 transitions. [2022-12-13 09:20:59,024 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6722222222222223 [2022-12-13 09:20:59,024 INFO L175 Difference]: Start difference. First operand has 71 places, 82 transitions, 430 flow. Second operand 9 states and 242 transitions. [2022-12-13 09:20:59,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 282 transitions, 2004 flow [2022-12-13 09:21:03,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 282 transitions, 1997 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 09:21:03,420 INFO L231 Difference]: Finished difference. Result has 84 places, 99 transitions, 624 flow [2022-12-13 09:21:03,420 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=624, PETRI_PLACES=84, PETRI_TRANSITIONS=99} [2022-12-13 09:21:03,420 INFO L295 CegarLoopForPetriNet]: 92 programPoint places, -8 predicate places. [2022-12-13 09:21:03,420 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:21:03,421 INFO L89 Accepts]: Start accepts. Operand has 84 places, 99 transitions, 624 flow [2022-12-13 09:21:03,421 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:21:03,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:21:03,422 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 99 transitions, 624 flow [2022-12-13 09:21:03,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 99 transitions, 624 flow [2022-12-13 09:21:03,924 INFO L130 PetriNetUnfolder]: 6193/10109 cut-off events. [2022-12-13 09:21:03,924 INFO L131 PetriNetUnfolder]: For 9477/9936 co-relation queries the response was YES. [2022-12-13 09:21:03,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29271 conditions, 10109 events. 6193/10109 cut-off events. For 9477/9936 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 80878 event pairs, 188 based on Foata normal form. 45/3375 useless extension candidates. Maximal degree in co-relation 29243. Up to 4483 conditions per place. [2022-12-13 09:21:04,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 99 transitions, 624 flow [2022-12-13 09:21:04,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 2472 [2022-12-13 09:21:04,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] $Ultimate##0-->L776: Formula: (and (= v_~a~0_79 1) (= v_~x~0_932 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|} OutVars{~a~0=v_~a~0_79, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_932, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [687] $Ultimate##0-->L803: Formula: (and (= v_~x$r_buff0_thd0~0_105 v_~x$r_buff1_thd0~0_111) (= v_~x$r_buff1_thd3~0_96 v_~x$r_buff0_thd3~0_85) (= v_~x$r_buff1_thd4~0_53 v_~x$r_buff0_thd4~0_51) (= 2 v_~x$w_buff0~0_165) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_11| 0)) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_11| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_11|) (= v_~x$r_buff1_thd2~0_93 v_~x$r_buff0_thd2~0_101) (= v_~x$r_buff1_thd1~0_45 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff0_thd2~0_100 1) (= v_~x$w_buff0~0_166 v_~x$w_buff1~0_149) (= v_~x$w_buff0_used~0_308 v_~x$w_buff1_used~0_281) (= v_~x$w_buff0_used~0_307 1) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_281 256) 0)) (not (= (mod v_~x$w_buff0_used~0_307 256) 0)))) 1 0) |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_11|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_166, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_105, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_85, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_101, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_308} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_165, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_105, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_149, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_96, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_93, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_281, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_45, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_51, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_85, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_100, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_111, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_11|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_307, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_11|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] [2022-12-13 09:21:04,317 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] $Ultimate##0-->L776: Formula: (and (= v_~a~0_79 1) (= v_~x~0_932 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|} OutVars{~a~0=v_~a~0_79, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_932, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [569] L865-->L877: Formula: (let ((.cse6 (not (= (mod v_~y$r_buff1_thd3~0_34 256) 0))) (.cse11 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (.cse9 (not (= (mod v_~x$w_buff0_used~0_151 256) 0))) (.cse7 (not (= (mod v_~y$w_buff0_used~0_89 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd3~0_47 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0)))) (let ((.cse3 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_133 256) 0)))) (.cse0 (and .cse7 .cse10)) (.cse4 (and .cse11 .cse9)) (.cse2 (and .cse11 (not (= (mod v_~x$w_buff0_used~0_152 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_90 256) 0)) .cse10)) (.cse5 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse6))) (and (= v_~y$r_buff0_thd3~0_46 (ite .cse0 0 v_~y$r_buff0_thd3~0_47)) (= v_~y$w_buff0_used~0_89 (ite .cse1 0 v_~y$w_buff0_used~0_90)) (= v_~x~0_95 (ite .cse2 v_~x$w_buff0~0_61 (ite .cse3 v_~x$w_buff1~0_56 v_~x~0_96))) (= v_~x$w_buff1_used~0_132 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_133)) (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse5) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and .cse6 (not (= (mod v_~y$w_buff1_used~0_80 256) 0))) (and .cse7 (not (= (mod v_~y$r_buff0_thd3~0_46 256) 0)))) 0 v_~y$r_buff1_thd3~0_34) v_~y$r_buff1_thd3~0_33) (= v_~x$r_buff0_thd3~0_23 (ite .cse4 0 v_~x$r_buff0_thd3~0_24)) (= (ite .cse2 0 v_~x$w_buff0_used~0_152) v_~x$w_buff0_used~0_151) (= v_~y~0_58 (ite .cse1 v_~y$w_buff0~0_40 (ite .cse5 v_~y$w_buff1~0_33 v_~y~0_59))) (= v_~x$r_buff1_thd3~0_23 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse8) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse9)) 0 v_~x$r_buff1_thd3~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_61, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_90, ~x$w_buff1~0=v_~x$w_buff1~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_34, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_59, ~x~0=v_~x~0_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_61, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~x$w_buff1~0=v_~x$w_buff1~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_151, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_40, ~y~0=v_~y~0_58, ~x~0=v_~x~0_95, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~y~0, ~x~0, ~x$w_buff0_used~0, ~y$w_buff1_used~0] [2022-12-13 09:21:04,585 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:21:04,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1166 [2022-12-13 09:21:04,586 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 98 transitions, 638 flow [2022-12-13 09:21:04,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:21:04,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:21:04,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:04,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:21:04,587 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-13 09:21:04,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:21:04,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1263106624, now seen corresponding path program 2 times [2022-12-13 09:21:04,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:21:04,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860481630] [2022-12-13 09:21:04,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:21:04,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:21:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:21:04,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:21:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:21:04,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:21:04,801 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:21:04,803 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2022-12-13 09:21:04,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2022-12-13 09:21:04,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2022-12-13 09:21:04,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2022-12-13 09:21:04,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2022-12-13 09:21:04,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2022-12-13 09:21:04,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2022-12-13 09:21:04,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2022-12-13 09:21:04,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2022-12-13 09:21:04,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 09:21:04,806 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:21:04,809 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:21:04,809 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:21:04,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:21:04 BasicIcfg [2022-12-13 09:21:04,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:21:04,917 INFO L158 Benchmark]: Toolchain (without parser) took 85229.87ms. Allocated memory was 208.7MB in the beginning and 7.3GB in the end (delta: 7.0GB). Free memory was 184.0MB in the beginning and 4.4GB in the end (delta: -4.2GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-13 09:21:04,918 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 208.7MB. Free memory is still 185.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:21:04,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.74ms. Allocated memory is still 208.7MB. Free memory was 183.5MB in the beginning and 151.5MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-13 09:21:04,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.41ms. Allocated memory is still 208.7MB. Free memory was 151.5MB in the beginning and 147.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-13 09:21:04,918 INFO L158 Benchmark]: Boogie Preprocessor took 42.45ms. Allocated memory is still 208.7MB. Free memory was 147.3MB in the beginning and 144.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:21:04,918 INFO L158 Benchmark]: RCFGBuilder took 944.42ms. Allocated memory is still 208.7MB. Free memory was 144.7MB in the beginning and 77.6MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. [2022-12-13 09:21:04,918 INFO L158 Benchmark]: TraceAbstraction took 83712.23ms. Allocated memory was 208.7MB in the beginning and 7.3GB in the end (delta: 7.0GB). Free memory was 76.5MB in the beginning and 4.4GB in the end (delta: -4.4GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-12-13 09:21:04,919 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.25ms. Allocated memory is still 208.7MB. Free memory is still 185.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 471.74ms. Allocated memory is still 208.7MB. Free memory was 183.5MB in the beginning and 151.5MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.41ms. Allocated memory is still 208.7MB. Free memory was 151.5MB in the beginning and 147.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.45ms. Allocated memory is still 208.7MB. Free memory was 147.3MB in the beginning and 144.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 944.42ms. Allocated memory is still 208.7MB. Free memory was 144.7MB in the beginning and 77.6MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. * TraceAbstraction took 83712.23ms. Allocated memory was 208.7MB in the beginning and 7.3GB in the end (delta: 7.0GB). Free memory was 76.5MB in the beginning and 4.4GB in the end (delta: -4.4GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 159 PlacesBefore, 92 PlacesAfterwards, 148 TransitionsBefore, 79 TransitionsAfterwards, 3408 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 52 ConcurrentYvCompositions, 3 ChoiceCompositions, 119 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5201, independent: 4958, independent conditional: 4958, independent unconditional: 0, dependent: 243, dependent conditional: 243, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3259, independent: 3191, independent conditional: 0, independent unconditional: 3191, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3259, independent: 3191, independent conditional: 0, independent unconditional: 3191, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3259, independent: 3159, independent conditional: 0, independent unconditional: 3159, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 631, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 597, dependent conditional: 0, dependent unconditional: 597, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5201, independent: 1767, independent conditional: 1767, independent unconditional: 0, dependent: 175, dependent conditional: 175, dependent unconditional: 0, unknown: 3259, unknown conditional: 3259, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3276, Positive cache size: 3208, Positive conditional cache size: 3208, Positive unconditional cache size: 0, Negative cache size: 68, Negative conditional cache size: 68, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 84 PlacesBefore, 84 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 2896 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 734, independent: 652, independent conditional: 652, independent unconditional: 0, dependent: 82, dependent conditional: 82, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 590, independent: 538, independent conditional: 20, independent unconditional: 518, dependent: 52, dependent conditional: 2, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 590, independent: 538, independent conditional: 20, independent unconditional: 518, dependent: 52, dependent conditional: 2, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 590, independent: 511, independent conditional: 0, independent unconditional: 511, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 52, dependent conditional: 2, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 143, dependent conditional: 14, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 734, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 590, unknown conditional: 590, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 590, Positive cache size: 538, Positive conditional cache size: 538, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 55 PlacesBefore, 55 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 520, independent: 472, independent conditional: 472, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, independent: 127, independent conditional: 15, independent unconditional: 112, dependent: 27, dependent conditional: 1, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 154, independent: 127, independent conditional: 15, independent unconditional: 112, dependent: 27, dependent conditional: 1, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 154, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 27, dependent conditional: 1, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 214, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 178, dependent conditional: 5, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 520, independent: 345, independent conditional: 345, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 154, unknown conditional: 154, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 744, Positive cache size: 665, Positive conditional cache size: 665, Positive unconditional cache size: 0, Negative cache size: 79, Negative conditional cache size: 79, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 56 PlacesBefore, 55 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 1158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 903, independent: 814, independent conditional: 814, independent unconditional: 0, dependent: 89, dependent conditional: 89, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 38, independent conditional: 25, independent unconditional: 13, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, independent: 38, independent conditional: 25, independent unconditional: 13, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 903, independent: 776, independent conditional: 776, independent unconditional: 0, dependent: 84, dependent conditional: 84, dependent unconditional: 0, unknown: 43, unknown conditional: 43, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 787, Positive cache size: 703, Positive conditional cache size: 703, Positive unconditional cache size: 0, Negative cache size: 84, Negative conditional cache size: 84, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 1102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 421, independent: 378, independent conditional: 378, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 15, independent conditional: 14, independent unconditional: 1, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 15, independent conditional: 14, independent unconditional: 1, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 7, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 421, independent: 363, independent conditional: 363, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 806, Positive cache size: 718, Positive conditional cache size: 718, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 1390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 256, independent: 215, independent conditional: 215, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 21, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 21, independent unconditional: 21, 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: 42, independent: 42, independent conditional: 0, independent unconditional: 42, 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: 256, independent: 173, independent conditional: 173, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 42, unknown conditional: 42, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 848, Positive cache size: 760, Positive conditional cache size: 760, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 60 PlacesBefore, 60 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1774 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 222, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 23, independent conditional: 12, independent unconditional: 11, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 23, independent conditional: 12, independent unconditional: 11, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 128, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 222, independent: 146, independent conditional: 146, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 880, Positive cache size: 783, Positive conditional cache size: 783, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1798 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 419, independent: 354, independent conditional: 354, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 66, independent conditional: 61, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 66, independent: 66, independent conditional: 61, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 66, independent: 66, independent conditional: 0, independent unconditional: 66, 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: 419, independent: 288, independent conditional: 288, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 66, unknown conditional: 66, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 946, Positive cache size: 849, Positive conditional cache size: 849, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 348, independent: 298, independent conditional: 298, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 43, independent conditional: 27, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, independent: 43, independent conditional: 27, independent unconditional: 16, 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: 43, independent: 43, independent conditional: 0, independent unconditional: 43, 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: 348, independent: 255, independent conditional: 255, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 43, unknown conditional: 43, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 989, Positive cache size: 892, Positive conditional cache size: 892, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 75 PlacesBefore, 75 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 2314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 92, independent conditional: 92, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 10, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 10, independent unconditional: 10, 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: 22, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 912, Positive conditional cache size: 912, Positive unconditional cache size: 0, Negative cache size: 99, Negative conditional cache size: 99, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 74 PlacesBefore, 71 PlacesAfterwards, 86 TransitionsBefore, 83 TransitionsAfterwards, 1916 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 260, independent: 248, independent conditional: 248, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, independent: 69, independent conditional: 52, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 69, independent: 69, independent conditional: 52, independent unconditional: 17, 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: 69, independent: 69, independent conditional: 0, independent unconditional: 69, 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: 260, independent: 179, independent conditional: 179, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 69, unknown conditional: 69, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1080, Positive cache size: 981, Positive conditional cache size: 981, Positive unconditional cache size: 0, Negative cache size: 99, Negative conditional cache size: 99, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 1766 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 13, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 13, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 60, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1094, Positive cache size: 995, Positive conditional cache size: 995, Positive unconditional cache size: 0, Negative cache size: 99, Negative conditional cache size: 99, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 84 PlacesBefore, 83 PlacesAfterwards, 99 TransitionsBefore, 98 TransitionsAfterwards, 2472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 101, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1114, Positive cache size: 1013, Positive conditional cache size: 1013, Positive unconditional cache size: 0, Negative cache size: 101, Negative conditional cache size: 101, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool y$flush_delayed; [L748] 0 int y$mem_tmp; [L749] 0 _Bool y$r_buff0_thd0; [L750] 0 _Bool y$r_buff0_thd1; [L751] 0 _Bool y$r_buff0_thd2; [L752] 0 _Bool y$r_buff0_thd3; [L753] 0 _Bool y$r_buff0_thd4; [L754] 0 _Bool y$r_buff1_thd0; [L755] 0 _Bool y$r_buff1_thd1; [L756] 0 _Bool y$r_buff1_thd2; [L757] 0 _Bool y$r_buff1_thd3; [L758] 0 _Bool y$r_buff1_thd4; [L759] 0 _Bool y$read_delayed; [L760] 0 int *y$read_delayed_var; [L761] 0 int y$w_buff0; [L762] 0 _Bool y$w_buff0_used; [L763] 0 int y$w_buff1; [L764] 0 _Bool y$w_buff1_used; [L766] 0 int z = 0; [L767] 0 _Bool weak$$choice0; [L768] 0 _Bool weak$$choice2; [L922] 0 pthread_t t377; [L923] FCALL, FORK 0 pthread_create(&t377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t377, ((void *)0), P0, ((void *)0))=-4, t377={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L924] 0 pthread_t t378; [L925] FCALL, FORK 0 pthread_create(&t378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t378, ((void *)0), P1, ((void *)0))=-3, t377={5:0}, t378={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L926] 0 pthread_t t379; [L927] FCALL, FORK 0 pthread_create(&t379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t379, ((void *)0), P2, ((void *)0))=-2, t377={5:0}, t378={6:0}, t379={7: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] 3 y$w_buff1 = y$w_buff0 [L852] 3 y$w_buff0 = 1 [L853] 3 y$w_buff1_used = y$w_buff0_used [L854] 3 y$w_buff0_used = (_Bool)1 [L855] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L855] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L856] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L857] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L858] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L859] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L860] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L861] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L928] 0 pthread_t t380; [L929] FCALL, FORK 0 pthread_create(&t380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t380, ((void *)0), P3, ((void *)0))=-1, t377={5:0}, t378={6:0}, t379={7:0}, t380={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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 2 x$w_buff1 = x$w_buff0 [L793] 2 x$w_buff0 = 2 [L794] 2 x$w_buff1_used = x$w_buff0_used [L795] 2 x$w_buff0_used = (_Bool)1 [L796] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L796] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L797] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L798] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L799] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L800] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L801] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L802] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L864] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L886] 4 z = 1 [L889] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 2 x$flush_delayed = weak$$choice2 [L808] 2 x$mem_tmp = x [L809] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L810] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L811] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L812] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L813] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L815] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L816] 2 __unbuffered_p1_EAX = x [L817] 2 x = x$flush_delayed ? x$mem_tmp : x [L818] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=50, weak$$choice2=255, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L892] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 1 a = 1 [L775] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 2 y$flush_delayed = weak$$choice2 [L824] 2 y$mem_tmp = y [L825] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L826] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L827] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L828] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L829] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L830] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L831] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L832] 2 __unbuffered_p1_EBX = y [L833] 2 y = y$flush_delayed ? y$mem_tmp : y [L834] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=51, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 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) [L779] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L780] 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 [L781] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L782] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L895] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L896] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L897] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L898] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L899] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L900] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L901] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L902] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L903] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L904] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L867] 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) [L868] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L869] 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 [L870] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L871] 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 [L872] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L873] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L874] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L875] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L876] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=51, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 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) [L838] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L839] 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 [L840] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L841] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=51, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L844] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=51, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L879] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=51, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L907] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L931] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L933] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L933] RET 0 assume_abort_if_not(main$tmp_guard0) [L935] 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) [L936] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L937] 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 [L938] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L939] 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 [L940] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L941] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L942] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L943] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L944] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L947] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L948] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L949] 0 x$flush_delayed = weak$$choice2 [L950] 0 x$mem_tmp = x [L951] 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) [L952] 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)) [L953] 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)) [L954] 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)) [L955] 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)) [L956] 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)) [L957] 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)) [L958] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L959] 0 x = x$flush_delayed ? x$mem_tmp : x [L960] 0 x$flush_delayed = (_Bool)0 [L962] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 923]: 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: 925]: 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: 927]: 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: 929]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 191 locations, 9 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: 83.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 57.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 676 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 676 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1604 IncrementalHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 184 mSolverCounterUnsat, 15 mSDtfsCounter, 1604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=638occurred in iteration=12, InterpolantAutomatonStates: 55, 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.5s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 2519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:21:04,944 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...