/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:50:35,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:50:35,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:50:35,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:50:35,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:50:35,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:50:35,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:50:35,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:50:35,875 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:50:35,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:50:35,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:50:35,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:50:35,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:50:35,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:50:35,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:50:35,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:50:35,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:50:35,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:50:35,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:50:35,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:50:35,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:50:35,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:50:35,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:50:35,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:50:35,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:50:35,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:50:35,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:50:35,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:50:35,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:50:35,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:50:35,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:50:35,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:50:35,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:50:35,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:50:35,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:50:35,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:50:35,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:50:35,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:50:35,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:50:35,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:50:35,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:50:35,911 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-RepeatedSemanticLbe.epf [2022-12-13 00:50:35,939 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:50:35,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:50:35,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:50:35,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:50:35,942 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:50:35,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:50:35,943 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:50:35,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:50:35,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:50:35,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:50:35,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:50:35,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:50:35,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:50:35,944 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:50:35,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:50:35,945 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:50:35,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:50:35,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:50:35,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:50:35,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:50:35,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:50:35,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:50:35,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:50:35,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:50:35,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:50:35,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:50:35,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:50:35,946 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:50:35,946 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 00:50:36,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:50:36,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:50:36,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:50:36,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:50:36,251 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:50:36,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i [2022-12-13 00:50:37,180 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:50:37,425 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:50:37,426 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_power.opt.i [2022-12-13 00:50:37,438 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d87f934e/930328cd9d3044d0b58b765a6995728a/FLAGdb0fb0168 [2022-12-13 00:50:37,741 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d87f934e/930328cd9d3044d0b58b765a6995728a [2022-12-13 00:50:37,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:50:37,744 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:50:37,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:50:37,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:50:37,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:50:37,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:50:37" (1/1) ... [2022-12-13 00:50:37,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15d9db26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:37, skipping insertion in model container [2022-12-13 00:50:37,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:50:37" (1/1) ... [2022-12-13 00:50:37,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:50:37,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:50:37,914 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/safe015_power.opt.i[994,1007] [2022-12-13 00:50:38,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:50:38,097 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:50:38,105 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/safe015_power.opt.i[994,1007] [2022-12-13 00:50:38,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:50:38,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:50:38,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:50:38,206 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:50:38,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:38 WrapperNode [2022-12-13 00:50:38,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:50:38,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:50:38,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:50:38,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:50:38,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:38" (1/1) ... [2022-12-13 00:50:38,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:38" (1/1) ... [2022-12-13 00:50:38,251 INFO L138 Inliner]: procedures = 176, calls = 86, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 166 [2022-12-13 00:50:38,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:50:38,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:50:38,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:50:38,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:50:38,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:38" (1/1) ... [2022-12-13 00:50:38,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:38" (1/1) ... [2022-12-13 00:50:38,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:38" (1/1) ... [2022-12-13 00:50:38,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:38" (1/1) ... [2022-12-13 00:50:38,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:38" (1/1) ... [2022-12-13 00:50:38,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:38" (1/1) ... [2022-12-13 00:50:38,278 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:38" (1/1) ... [2022-12-13 00:50:38,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:38" (1/1) ... [2022-12-13 00:50:38,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:50:38,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:50:38,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:50:38,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:50:38,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:38" (1/1) ... [2022-12-13 00:50:38,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:50:38,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:50:38,319 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 00:50:38,343 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 00:50:38,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:50:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:50:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:50:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:50:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:50:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:50:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:50:38,350 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:50:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:50:38,350 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:50:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:50:38,350 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:50:38,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:50:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:50:38,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:50:38,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:50:38,352 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 00:50:38,449 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:50:38,450 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:50:38,771 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:50:39,056 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:50:39,057 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:50:39,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:50:39 BoogieIcfgContainer [2022-12-13 00:50:39,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:50:39,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:50:39,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:50:39,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:50:39,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:50:37" (1/3) ... [2022-12-13 00:50:39,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d1a5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:50:39, skipping insertion in model container [2022-12-13 00:50:39,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:50:38" (2/3) ... [2022-12-13 00:50:39,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d1a5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:50:39, skipping insertion in model container [2022-12-13 00:50:39,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:50:39" (3/3) ... [2022-12-13 00:50:39,064 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_power.opt.i [2022-12-13 00:50:39,077 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:50:39,077 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:50:39,077 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:50:39,135 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:50:39,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-13 00:50:39,206 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-13 00:50:39,206 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:50:39,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-13 00:50:39,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-13 00:50:39,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-13 00:50:39,215 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:39,254 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-13 00:50:39,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-13 00:50:39,282 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-13 00:50:39,282 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:50:39,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-12-13 00:50:39,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-13 00:50:39,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 1212 [2022-12-13 00:50:46,033 INFO L241 LiptonReduction]: Total number of compositions: 90 [2022-12-13 00:50:46,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:50:46,061 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;@ff67a40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:50:46,061 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 00:50:46,069 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 00:50:46,069 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:50:46,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:46,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:46,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:46,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1392480139, now seen corresponding path program 1 times [2022-12-13 00:50:46,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:46,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727987046] [2022-12-13 00:50:46,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:46,287 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 00:50:46,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:46,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727987046] [2022-12-13 00:50:46,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727987046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:46,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:46,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:50:46,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376257531] [2022-12-13 00:50:46,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:46,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 00:50:46,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:46,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 00:50:46,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 00:50:46,310 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2022-12-13 00:50:46,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:46,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:46,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2022-12-13 00:50:46,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:46,662 INFO L130 PetriNetUnfolder]: 1164/1796 cut-off events. [2022-12-13 00:50:46,663 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 00:50:46,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3588 conditions, 1796 events. 1164/1796 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8402 event pairs, 1164 based on Foata normal form. 0/1454 useless extension candidates. Maximal degree in co-relation 3577. Up to 1726 conditions per place. [2022-12-13 00:50:46,689 INFO L137 encePairwiseOnDemand]: 29/30 looper letters, 21 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2022-12-13 00:50:46,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 109 flow [2022-12-13 00:50:46,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 00:50:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 00:50:46,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2022-12-13 00:50:46,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-13 00:50:46,699 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 2 states and 38 transitions. [2022-12-13 00:50:46,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 109 flow [2022-12-13 00:50:46,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:50:46,702 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2022-12-13 00:50:46,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-13 00:50:46,705 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2022-12-13 00:50:46,706 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:46,706 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 64 flow [2022-12-13 00:50:46,708 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:46,708 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:46,708 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 64 flow [2022-12-13 00:50:46,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 64 flow [2022-12-13 00:50:46,713 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 00:50:46,713 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:50:46,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 00:50:46,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 64 flow [2022-12-13 00:50:46,715 INFO L226 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-13 00:50:46,919 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:46,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-13 00:50:46,922 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 64 flow [2022-12-13 00:50:46,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:46,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:46,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:46,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:50:46,925 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:46,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1856373316, now seen corresponding path program 1 times [2022-12-13 00:50:46,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:46,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38398412] [2022-12-13 00:50:46,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:46,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:47,185 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 00:50:47,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:47,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38398412] [2022-12-13 00:50:47,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38398412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:47,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:47,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:50:47,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952480964] [2022-12-13 00:50:47,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:47,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:50:47,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:47,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:50:47,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:50:47,187 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 00:50:47,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:47,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:47,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 00:50:47,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:47,512 INFO L130 PetriNetUnfolder]: 1371/2159 cut-off events. [2022-12-13 00:50:47,512 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:50:47,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4245 conditions, 2159 events. 1371/2159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10684 event pairs, 730 based on Foata normal form. 10/1808 useless extension candidates. Maximal degree in co-relation 4237. Up to 1942 conditions per place. [2022-12-13 00:50:47,522 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 32 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-13 00:50:47,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 164 flow [2022-12-13 00:50:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:50:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:50:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 00:50:47,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2022-12-13 00:50:47,523 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 64 flow. Second operand 3 states and 57 transitions. [2022-12-13 00:50:47,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 164 flow [2022-12-13 00:50:47,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:50:47,525 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 83 flow [2022-12-13 00:50:47,525 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2022-12-13 00:50:47,525 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2022-12-13 00:50:47,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:47,525 INFO L89 Accepts]: Start accepts. Operand has 39 places, 31 transitions, 83 flow [2022-12-13 00:50:47,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:47,526 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:47,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 31 transitions, 83 flow [2022-12-13 00:50:47,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 83 flow [2022-12-13 00:50:47,533 INFO L130 PetriNetUnfolder]: 3/43 cut-off events. [2022-12-13 00:50:47,534 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:50:47,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 43 events. 3/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 111 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 56. Up to 10 conditions per place. [2022-12-13 00:50:47,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 83 flow [2022-12-13 00:50:47,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-13 00:50:47,536 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:47,537 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 00:50:47,537 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 83 flow [2022-12-13 00:50:47,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:47,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:47,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:47,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:50:47,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:47,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:47,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1712999620, now seen corresponding path program 1 times [2022-12-13 00:50:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:47,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012819427] [2022-12-13 00:50:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:47,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:48,102 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 00:50:48,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:48,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012819427] [2022-12-13 00:50:48,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012819427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:48,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:48,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:50:48,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396020336] [2022-12-13 00:50:48,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:48,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:50:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:48,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:50:48,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:50:48,104 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 00:50:48,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 00:50:48,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:48,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 00:50:48,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:48,381 INFO L130 PetriNetUnfolder]: 1165/1904 cut-off events. [2022-12-13 00:50:48,381 INFO L131 PetriNetUnfolder]: For 229/229 co-relation queries the response was YES. [2022-12-13 00:50:48,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4066 conditions, 1904 events. 1165/1904 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9699 event pairs, 279 based on Foata normal form. 20/1596 useless extension candidates. Maximal degree in co-relation 4055. Up to 1382 conditions per place. [2022-12-13 00:50:48,392 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 30 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-12-13 00:50:48,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 170 flow [2022-12-13 00:50:48,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:50:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:50:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 00:50:48,393 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2022-12-13 00:50:48,393 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 83 flow. Second operand 3 states and 56 transitions. [2022-12-13 00:50:48,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 170 flow [2022-12-13 00:50:48,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:50:48,394 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 88 flow [2022-12-13 00:50:48,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-12-13 00:50:48,395 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2022-12-13 00:50:48,395 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:48,395 INFO L89 Accepts]: Start accepts. Operand has 41 places, 31 transitions, 88 flow [2022-12-13 00:50:48,395 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:48,395 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:48,396 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 88 flow [2022-12-13 00:50:48,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 88 flow [2022-12-13 00:50:48,401 INFO L130 PetriNetUnfolder]: 3/43 cut-off events. [2022-12-13 00:50:48,402 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:50:48,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 43 events. 3/43 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 118 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 59. Up to 10 conditions per place. [2022-12-13 00:50:48,402 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 88 flow [2022-12-13 00:50:48,402 INFO L226 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-13 00:50:48,427 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:48,428 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 00:50:48,428 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 88 flow [2022-12-13 00:50:48,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 00:50:48,428 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:48,428 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:48,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:50:48,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:48,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:48,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1386735926, now seen corresponding path program 1 times [2022-12-13 00:50:48,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:48,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126064382] [2022-12-13 00:50:48,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:48,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:48,615 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 00:50:48,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:48,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126064382] [2022-12-13 00:50:48,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126064382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:48,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:48,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:50:48,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986499930] [2022-12-13 00:50:48,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:48,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:50:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:48,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:50:48,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:50:48,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-13 00:50:48,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 00:50:48,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:48,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-13 00:50:48,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:49,021 INFO L130 PetriNetUnfolder]: 2099/3276 cut-off events. [2022-12-13 00:50:49,021 INFO L131 PetriNetUnfolder]: For 475/475 co-relation queries the response was YES. [2022-12-13 00:50:49,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7463 conditions, 3276 events. 2099/3276 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 18394 event pairs, 182 based on Foata normal form. 231/2472 useless extension candidates. Maximal degree in co-relation 7450. Up to 1828 conditions per place. [2022-12-13 00:50:49,036 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 50 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2022-12-13 00:50:49,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 304 flow [2022-12-13 00:50:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-13 00:50:49,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6982758620689655 [2022-12-13 00:50:49,037 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 88 flow. Second operand 4 states and 81 transitions. [2022-12-13 00:50:49,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 304 flow [2022-12-13 00:50:49,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:50:49,039 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 166 flow [2022-12-13 00:50:49,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2022-12-13 00:50:49,040 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2022-12-13 00:50:49,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:49,040 INFO L89 Accepts]: Start accepts. Operand has 44 places, 40 transitions, 166 flow [2022-12-13 00:50:49,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:49,041 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:49,041 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 40 transitions, 166 flow [2022-12-13 00:50:49,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 40 transitions, 166 flow [2022-12-13 00:50:49,107 INFO L130 PetriNetUnfolder]: 346/635 cut-off events. [2022-12-13 00:50:49,108 INFO L131 PetriNetUnfolder]: For 160/163 co-relation queries the response was YES. [2022-12-13 00:50:49,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 635 events. 346/635 cut-off events. For 160/163 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 3895 event pairs, 177 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 1434. Up to 466 conditions per place. [2022-12-13 00:50:49,111 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 40 transitions, 166 flow [2022-12-13 00:50:49,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 572 [2022-12-13 00:50:49,117 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:49,118 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 00:50:49,118 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 166 flow [2022-12-13 00:50:49,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 00:50:49,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:49,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:49,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:50:49,118 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:49,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:49,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1283585679, now seen corresponding path program 1 times [2022-12-13 00:50:49,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:49,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058564020] [2022-12-13 00:50:49,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:49,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:49,318 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 00:50:49,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:49,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058564020] [2022-12-13 00:50:49,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058564020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:49,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:49,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:50:49,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424987268] [2022-12-13 00:50:49,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:49,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:50:49,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:49,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:50:49,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:50:49,319 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-13 00:50:49,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:49,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:49,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-13 00:50:49,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:49,686 INFO L130 PetriNetUnfolder]: 1223/2112 cut-off events. [2022-12-13 00:50:49,686 INFO L131 PetriNetUnfolder]: For 673/673 co-relation queries the response was YES. [2022-12-13 00:50:49,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6400 conditions, 2112 events. 1223/2112 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12265 event pairs, 68 based on Foata normal form. 204/1685 useless extension candidates. Maximal degree in co-relation 6385. Up to 1024 conditions per place. [2022-12-13 00:50:49,696 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 57 selfloop transitions, 20 changer transitions 1/84 dead transitions. [2022-12-13 00:50:49,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 84 transitions, 466 flow [2022-12-13 00:50:49,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:50:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:50:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-13 00:50:49,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7103448275862069 [2022-12-13 00:50:49,697 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 166 flow. Second operand 5 states and 103 transitions. [2022-12-13 00:50:49,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 84 transitions, 466 flow [2022-12-13 00:50:49,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 84 transitions, 450 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:50:49,700 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 278 flow [2022-12-13 00:50:49,700 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2022-12-13 00:50:49,701 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2022-12-13 00:50:49,701 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:49,701 INFO L89 Accepts]: Start accepts. Operand has 48 places, 49 transitions, 278 flow [2022-12-13 00:50:49,701 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:49,702 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:49,702 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 49 transitions, 278 flow [2022-12-13 00:50:49,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 49 transitions, 278 flow [2022-12-13 00:50:49,749 INFO L130 PetriNetUnfolder]: 217/491 cut-off events. [2022-12-13 00:50:49,750 INFO L131 PetriNetUnfolder]: For 282/336 co-relation queries the response was YES. [2022-12-13 00:50:49,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 491 events. 217/491 cut-off events. For 282/336 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 3019 event pairs, 63 based on Foata normal form. 3/292 useless extension candidates. Maximal degree in co-relation 1551. Up to 337 conditions per place. [2022-12-13 00:50:49,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 49 transitions, 278 flow [2022-12-13 00:50:49,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 564 [2022-12-13 00:50:49,759 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:49,760 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-13 00:50:49,760 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 278 flow [2022-12-13 00:50:49,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:49,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:49,760 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:49,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:50:49,760 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:49,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:49,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1658447685, now seen corresponding path program 1 times [2022-12-13 00:50:49,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:49,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532346688] [2022-12-13 00:50:49,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:49,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:49,954 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 00:50:49,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:49,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532346688] [2022-12-13 00:50:49,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532346688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:49,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:49,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:50:49,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491407503] [2022-12-13 00:50:49,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:49,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:50:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:49,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:50:49,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:50:49,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 00:50:49,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:49,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:49,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 00:50:49,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:50,205 INFO L130 PetriNetUnfolder]: 1153/2175 cut-off events. [2022-12-13 00:50:50,206 INFO L131 PetriNetUnfolder]: For 2401/2604 co-relation queries the response was YES. [2022-12-13 00:50:50,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7997 conditions, 2175 events. 1153/2175 cut-off events. For 2401/2604 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14135 event pairs, 342 based on Foata normal form. 173/1958 useless extension candidates. Maximal degree in co-relation 7980. Up to 1208 conditions per place. [2022-12-13 00:50:50,216 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 49 selfloop transitions, 3 changer transitions 8/73 dead transitions. [2022-12-13 00:50:50,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 73 transitions, 552 flow [2022-12-13 00:50:50,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:50:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:50:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 00:50:50,218 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2022-12-13 00:50:50,218 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 278 flow. Second operand 3 states and 57 transitions. [2022-12-13 00:50:50,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 73 transitions, 552 flow [2022-12-13 00:50:50,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 73 transitions, 465 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-13 00:50:50,228 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 237 flow [2022-12-13 00:50:50,228 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2022-12-13 00:50:50,229 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2022-12-13 00:50:50,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:50,229 INFO L89 Accepts]: Start accepts. Operand has 47 places, 49 transitions, 237 flow [2022-12-13 00:50:50,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:50,229 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:50,229 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 49 transitions, 237 flow [2022-12-13 00:50:50,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 237 flow [2022-12-13 00:50:50,287 INFO L130 PetriNetUnfolder]: 324/711 cut-off events. [2022-12-13 00:50:50,288 INFO L131 PetriNetUnfolder]: For 281/314 co-relation queries the response was YES. [2022-12-13 00:50:50,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 711 events. 324/711 cut-off events. For 281/314 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 4949 event pairs, 54 based on Foata normal form. 4/386 useless extension candidates. Maximal degree in co-relation 2012. Up to 568 conditions per place. [2022-12-13 00:50:50,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 49 transitions, 237 flow [2022-12-13 00:50:50,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-13 00:50:50,299 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:50,300 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 00:50:50,300 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 237 flow [2022-12-13 00:50:50,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:50,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:50,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:50,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:50:50,301 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:50,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2079598199, now seen corresponding path program 2 times [2022-12-13 00:50:50,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:50,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291473065] [2022-12-13 00:50:50,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:50,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:51,195 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 00:50:51,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:51,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291473065] [2022-12-13 00:50:51,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291473065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:51,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:51,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:50:51,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236003253] [2022-12-13 00:50:51,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:51,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:50:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:51,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:50:51,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:50:51,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 00:50:51,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:51,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:51,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 00:50:51,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:51,693 INFO L130 PetriNetUnfolder]: 2141/4006 cut-off events. [2022-12-13 00:50:51,693 INFO L131 PetriNetUnfolder]: For 2647/2828 co-relation queries the response was YES. [2022-12-13 00:50:51,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12953 conditions, 4006 events. 2141/4006 cut-off events. For 2647/2828 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 28611 event pairs, 602 based on Foata normal form. 206/3487 useless extension candidates. Maximal degree in co-relation 12937. Up to 2265 conditions per place. [2022-12-13 00:50:51,712 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 52 selfloop transitions, 9 changer transitions 4/79 dead transitions. [2022-12-13 00:50:51,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 505 flow [2022-12-13 00:50:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-13 00:50:51,713 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5948275862068966 [2022-12-13 00:50:51,713 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 237 flow. Second operand 4 states and 69 transitions. [2022-12-13 00:50:51,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 505 flow [2022-12-13 00:50:51,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 500 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 00:50:51,717 INFO L231 Difference]: Finished difference. Result has 51 places, 56 transitions, 298 flow [2022-12-13 00:50:51,717 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=51, PETRI_TRANSITIONS=56} [2022-12-13 00:50:51,717 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2022-12-13 00:50:51,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:51,717 INFO L89 Accepts]: Start accepts. Operand has 51 places, 56 transitions, 298 flow [2022-12-13 00:50:51,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:51,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:51,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 56 transitions, 298 flow [2022-12-13 00:50:51,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 56 transitions, 298 flow [2022-12-13 00:50:51,901 INFO L130 PetriNetUnfolder]: 893/2261 cut-off events. [2022-12-13 00:50:51,901 INFO L131 PetriNetUnfolder]: For 983/1127 co-relation queries the response was YES. [2022-12-13 00:50:51,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6358 conditions, 2261 events. 893/2261 cut-off events. For 983/1127 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 20797 event pairs, 159 based on Foata normal form. 23/1281 useless extension candidates. Maximal degree in co-relation 6342. Up to 1603 conditions per place. [2022-12-13 00:50:51,913 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 56 transitions, 298 flow [2022-12-13 00:50:51,913 INFO L226 LiptonReduction]: Number of co-enabled transitions 708 [2022-12-13 00:50:51,950 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:51,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-13 00:50:51,951 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 56 transitions, 298 flow [2022-12-13 00:50:51,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:51,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:51,951 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:51,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:50:51,951 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash 57764283, now seen corresponding path program 3 times [2022-12-13 00:50:51,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:51,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711702646] [2022-12-13 00:50:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:51,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:52,962 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 00:50:52,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:52,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711702646] [2022-12-13 00:50:52,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711702646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:52,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:52,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:50:52,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550108650] [2022-12-13 00:50:52,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:52,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:50:52,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:52,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:50:52,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:50:52,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 00:50:52,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 56 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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 00:50:52,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:52,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 00:50:52,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:53,615 INFO L130 PetriNetUnfolder]: 2918/5415 cut-off events. [2022-12-13 00:50:53,616 INFO L131 PetriNetUnfolder]: For 5501/5841 co-relation queries the response was YES. [2022-12-13 00:50:53,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19248 conditions, 5415 events. 2918/5415 cut-off events. For 5501/5841 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 40928 event pairs, 631 based on Foata normal form. 269/4661 useless extension candidates. Maximal degree in co-relation 19229. Up to 3012 conditions per place. [2022-12-13 00:50:53,636 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 66 selfloop transitions, 12 changer transitions 14/106 dead transitions. [2022-12-13 00:50:53,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 106 transitions, 745 flow [2022-12-13 00:50:53,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:50:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:50:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 00:50:53,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6275862068965518 [2022-12-13 00:50:53,638 INFO L175 Difference]: Start difference. First operand has 51 places, 56 transitions, 298 flow. Second operand 5 states and 91 transitions. [2022-12-13 00:50:53,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 106 transitions, 745 flow [2022-12-13 00:50:53,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 106 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:50:53,642 INFO L231 Difference]: Finished difference. Result has 55 places, 59 transitions, 347 flow [2022-12-13 00:50:53,642 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=55, PETRI_TRANSITIONS=59} [2022-12-13 00:50:53,643 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2022-12-13 00:50:53,643 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:53,643 INFO L89 Accepts]: Start accepts. Operand has 55 places, 59 transitions, 347 flow [2022-12-13 00:50:53,643 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:53,644 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:53,644 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 59 transitions, 347 flow [2022-12-13 00:50:53,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 59 transitions, 347 flow [2022-12-13 00:50:53,904 INFO L130 PetriNetUnfolder]: 1245/3002 cut-off events. [2022-12-13 00:50:53,904 INFO L131 PetriNetUnfolder]: For 1492/1760 co-relation queries the response was YES. [2022-12-13 00:50:53,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8592 conditions, 3002 events. 1245/3002 cut-off events. For 1492/1760 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 28842 event pairs, 205 based on Foata normal form. 30/1642 useless extension candidates. Maximal degree in co-relation 8574. Up to 2242 conditions per place. [2022-12-13 00:50:53,924 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 59 transitions, 347 flow [2022-12-13 00:50:53,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 790 [2022-12-13 00:50:53,986 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:53,987 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 344 [2022-12-13 00:50:53,987 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 59 transitions, 347 flow [2022-12-13 00:50:53,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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 00:50:53,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:53,987 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 00:50:53,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:50:53,987 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:50:53,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:53,988 INFO L85 PathProgramCache]: Analyzing trace with hash 567527960, now seen corresponding path program 1 times [2022-12-13 00:50:53,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:53,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288756276] [2022-12-13 00:50:53,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:53,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:54,210 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 00:50:54,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:54,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288756276] [2022-12-13 00:50:54,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288756276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:54,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:54,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:50:54,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646682468] [2022-12-13 00:50:54,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:54,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:50:54,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:54,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:50:54,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:50:54,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-13 00:50:54,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 59 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:54,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:54,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-13 00:50:54,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:54,652 INFO L130 PetriNetUnfolder]: 2162/4296 cut-off events. [2022-12-13 00:50:54,652 INFO L131 PetriNetUnfolder]: For 5822/5890 co-relation queries the response was YES. [2022-12-13 00:50:54,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16106 conditions, 4296 events. 2162/4296 cut-off events. For 5822/5890 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 33099 event pairs, 67 based on Foata normal form. 607/3323 useless extension candidates. Maximal degree in co-relation 16085. Up to 2071 conditions per place. [2022-12-13 00:50:54,664 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 29 selfloop transitions, 29 changer transitions 28/93 dead transitions. [2022-12-13 00:50:54,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 734 flow [2022-12-13 00:50:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:50:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:50:54,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-13 00:50:54,666 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2022-12-13 00:50:54,666 INFO L175 Difference]: Start difference. First operand has 55 places, 59 transitions, 347 flow. Second operand 6 states and 93 transitions. [2022-12-13 00:50:54,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 734 flow [2022-12-13 00:50:54,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 93 transitions, 679 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 00:50:54,671 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 376 flow [2022-12-13 00:50:54,671 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2022-12-13 00:50:54,672 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2022-12-13 00:50:54,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:54,672 INFO L89 Accepts]: Start accepts. Operand has 58 places, 53 transitions, 376 flow [2022-12-13 00:50:54,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:54,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:54,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 53 transitions, 376 flow [2022-12-13 00:50:54,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 53 transitions, 376 flow [2022-12-13 00:50:54,737 INFO L130 PetriNetUnfolder]: 485/1227 cut-off events. [2022-12-13 00:50:54,738 INFO L131 PetriNetUnfolder]: For 1571/1832 co-relation queries the response was YES. [2022-12-13 00:50:54,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5036 conditions, 1227 events. 485/1227 cut-off events. For 1571/1832 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 10400 event pairs, 13 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 5017. Up to 856 conditions per place. [2022-12-13 00:50:54,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 53 transitions, 376 flow [2022-12-13 00:50:54,746 INFO L226 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-13 00:51:04,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [723] L778-->L783: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [846] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse15 (= (mod v_~x$r_buff0_thd0~0_232 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_603 256) 0))) (let ((.cse17 (not .cse16)) (.cse18 (not .cse15))) (let ((.cse19 (ite (and .cse17 .cse18) 0 v_~x$w_buff0_used~0_603))) (let ((.cse20 (= (mod .cse19 256) 0))) (let ((.cse30 (not .cse20))) (let ((.cse31 (and .cse18 .cse30))) (let ((.cse22 (ite .cse31 0 v_~x$r_buff0_thd0~0_232)) (.cse11 (= (mod v_~x$w_buff1_used~0_593 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd0~0_227 256) 0))) (let ((.cse12 (not .cse10)) (.cse13 (not .cse11)) (.cse23 (= (mod .cse22 256) 0))) (let ((.cse25 (not .cse23)) (.cse6 (ite (or .cse31 (and .cse12 .cse13)) 0 v_~x$w_buff1_used~0_593))) (let ((.cse29 (= (mod .cse6 256) 0)) (.cse21 (and .cse25 .cse30))) (let ((.cse26 (ite (or (and (not .cse29) .cse12) .cse21) 0 v_~x$r_buff1_thd0~0_227))) (let ((.cse1 (= (mod v_~weak$$choice2~0_267 256) 0)) (.cse27 (= (mod .cse26 256) 0))) (let ((.cse9 (and .cse23 .cse29)) (.cse7 (and .cse23 .cse27)) (.cse5 (select |v_#memory_int_785| |v_~#x~0.base_391|)) (.cse0 (not .cse1)) (.cse8 (= (mod v_~x$w_buff0_used~0_602 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_592 256) 0))) (and (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_147| |v_ULTIMATE.start_main_#t~mem52#1_145|) (= v_~x$mem_tmp~0_199 |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse0) (and (= |v_ULTIMATE.start_main_#t~mem52#1_145| v_~x$mem_tmp~0_199) (= |v_ULTIMATE.start_main_#t~mem52#1_145| |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_289 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_114) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem48#1_177| |v_ULTIMATE.start_main_#t~mem48#1_175|)) (.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_98 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_172| |v_ULTIMATE.start_main_#t~ite49#1_170|) (= v_~__unbuffered_p2_EAX~0_167 v_~__unbuffered_p2_EAX~0_166)) (and (let ((.cse4 (= (mod v_~weak$$choice1~0_153 256) 0))) (or (and (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_175| (select (select (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| v_~x$mem_tmp~0_199)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97)) (= |v_ULTIMATE.start_main_#t~mem48#1_175| |v_ULTIMATE.start_main_#t~ite49#1_170|)) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_167) .cse4))) (not .cse3) (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_166)))) (= v_~x$w_buff1_used~0_592 (ite .cse0 .cse6 (ite (or .cse7 .cse8 .cse9) .cse6 0))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_162| |v_ULTIMATE.start_main_#t~mem39#1_160|))) (or (and (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_160| (select .cse5 |v_~#x~0.offset_391|)) (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~mem39#1_160| |v_ULTIMATE.start_main_#t~ite40#1_159|)) (and .cse12 .cse13 .cse14 (= v_~x$w_buff1~0_425 |v_ULTIMATE.start_main_#t~ite40#1_159|))) (or .cse15 .cse16) (= |v_ULTIMATE.start_main_#t~ite40#1_159| v_~x$mem_tmp~0_199)) (and (= |v_ULTIMATE.start_main_#t~ite40#1_159| |v_ULTIMATE.start_main_#t~ite40#1_161|) .cse17 .cse18 (= v_~x$w_buff0~0_438 v_~x$mem_tmp~0_199) .cse14))) (= v_~weak$$choice1~0_153 |v_ULTIMATE.start_main_#t~nondet47#1_125|) (= v_~x$w_buff0_used~0_602 (ite .cse0 .cse19 (ite (or .cse20 .cse7 .cse9) .cse19 (ite .cse21 0 .cse19)))) (= |v_ULTIMATE.start_main_#t~nondet43#1_135| v_~weak$$choice2~0_267) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (mod v_~main$tmp_guard0~0_114 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (ite (= (ite (not (and (= 2 v_~x$mem_tmp~0_199) (= v_~__unbuffered_p0_EAX~0_114 0) (= 2 v_~__unbuffered_p2_EAX~0_166) (= v_~y~0_80 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= v_~x$w_buff0~0_438 v_~x$w_buff0~0_437) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| 0)) (= v_~x$w_buff1~0_425 v_~x$w_buff1~0_424) (= v_~x$r_buff0_thd0~0_231 (ite .cse0 .cse22 (ite (or .cse7 .cse8 (and .cse23 .cse24)) .cse22 (ite (and .cse25 (not .cse8)) 0 .cse22)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| |v_ULTIMATE.start_main_#t~ite53#1_131|)) |v_#memory_int_784|) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= v_~weak$$choice0~0_236 |v_ULTIMATE.start_main_#t~nondet42#1_123|) (= v_~x$flush_delayed~0_245 0) (= v_~x$r_buff1_thd0~0_226 (ite .cse0 .cse26 (ite (let ((.cse28 (= (mod v_~x$r_buff0_thd0~0_231 256) 0))) (or .cse8 (and .cse27 .cse28) (and .cse28 .cse24))) .cse26 0))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_438, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_172|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_125|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_123|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_135|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_177|, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_147|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_162|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_161|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_232, ~#x~0.offset=|v_~#x~0.offset_391|, ~x$w_buff1~0=v_~x$w_buff1~0_425, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_227, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_603, #memory_int=|v_#memory_int_785|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_437, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_93|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_245, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~x$mem_tmp~0=v_~x$mem_tmp~0_199, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_93|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_91|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~weak$$choice1~0=v_~weak$$choice1~0_153, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_136|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_77|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_166, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_130|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_231, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_113|, ~#x~0.offset=|v_~#x~0.offset_391|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_162|, ~x$w_buff1~0=v_~x$w_buff1~0_424, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_592, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_114, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_96|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_602, ~weak$$choice0~0=v_~weak$$choice0~0_236, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_149|, #memory_int=|v_#memory_int_784|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ~weak$$choice2~0=v_~weak$$choice2~0_267, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} AuxVars[|v_ULTIMATE.start_main_#t~mem52#1_145|, |v_ULTIMATE.start_main_#t~mem39#1_160|, |v_ULTIMATE.start_main_#t~ite53#1_131|, |v_ULTIMATE.start_main_#t~ite49#1_170|, |v_ULTIMATE.start_main_#t~mem48#1_175|, |v_ULTIMATE.start_main_#t~ite40#1_159|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:51:06,538 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] L778-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_5| 0) (= |v_P0Thread1of1ForFork1_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [846] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse15 (= (mod v_~x$r_buff0_thd0~0_232 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_603 256) 0))) (let ((.cse17 (not .cse16)) (.cse18 (not .cse15))) (let ((.cse19 (ite (and .cse17 .cse18) 0 v_~x$w_buff0_used~0_603))) (let ((.cse20 (= (mod .cse19 256) 0))) (let ((.cse30 (not .cse20))) (let ((.cse31 (and .cse18 .cse30))) (let ((.cse22 (ite .cse31 0 v_~x$r_buff0_thd0~0_232)) (.cse11 (= (mod v_~x$w_buff1_used~0_593 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd0~0_227 256) 0))) (let ((.cse12 (not .cse10)) (.cse13 (not .cse11)) (.cse23 (= (mod .cse22 256) 0))) (let ((.cse25 (not .cse23)) (.cse6 (ite (or .cse31 (and .cse12 .cse13)) 0 v_~x$w_buff1_used~0_593))) (let ((.cse29 (= (mod .cse6 256) 0)) (.cse21 (and .cse25 .cse30))) (let ((.cse26 (ite (or (and (not .cse29) .cse12) .cse21) 0 v_~x$r_buff1_thd0~0_227))) (let ((.cse1 (= (mod v_~weak$$choice2~0_267 256) 0)) (.cse27 (= (mod .cse26 256) 0))) (let ((.cse9 (and .cse23 .cse29)) (.cse7 (and .cse23 .cse27)) (.cse5 (select |v_#memory_int_785| |v_~#x~0.base_391|)) (.cse0 (not .cse1)) (.cse8 (= (mod v_~x$w_buff0_used~0_602 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_592 256) 0))) (and (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_147| |v_ULTIMATE.start_main_#t~mem52#1_145|) (= v_~x$mem_tmp~0_199 |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse0) (and (= |v_ULTIMATE.start_main_#t~mem52#1_145| v_~x$mem_tmp~0_199) (= |v_ULTIMATE.start_main_#t~mem52#1_145| |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_289 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_114) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem48#1_177| |v_ULTIMATE.start_main_#t~mem48#1_175|)) (.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_98 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_172| |v_ULTIMATE.start_main_#t~ite49#1_170|) (= v_~__unbuffered_p2_EAX~0_167 v_~__unbuffered_p2_EAX~0_166)) (and (let ((.cse4 (= (mod v_~weak$$choice1~0_153 256) 0))) (or (and (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_175| (select (select (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| v_~x$mem_tmp~0_199)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97)) (= |v_ULTIMATE.start_main_#t~mem48#1_175| |v_ULTIMATE.start_main_#t~ite49#1_170|)) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_167) .cse4))) (not .cse3) (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_166)))) (= v_~x$w_buff1_used~0_592 (ite .cse0 .cse6 (ite (or .cse7 .cse8 .cse9) .cse6 0))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_162| |v_ULTIMATE.start_main_#t~mem39#1_160|))) (or (and (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_160| (select .cse5 |v_~#x~0.offset_391|)) (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~mem39#1_160| |v_ULTIMATE.start_main_#t~ite40#1_159|)) (and .cse12 .cse13 .cse14 (= v_~x$w_buff1~0_425 |v_ULTIMATE.start_main_#t~ite40#1_159|))) (or .cse15 .cse16) (= |v_ULTIMATE.start_main_#t~ite40#1_159| v_~x$mem_tmp~0_199)) (and (= |v_ULTIMATE.start_main_#t~ite40#1_159| |v_ULTIMATE.start_main_#t~ite40#1_161|) .cse17 .cse18 (= v_~x$w_buff0~0_438 v_~x$mem_tmp~0_199) .cse14))) (= v_~weak$$choice1~0_153 |v_ULTIMATE.start_main_#t~nondet47#1_125|) (= v_~x$w_buff0_used~0_602 (ite .cse0 .cse19 (ite (or .cse20 .cse7 .cse9) .cse19 (ite .cse21 0 .cse19)))) (= |v_ULTIMATE.start_main_#t~nondet43#1_135| v_~weak$$choice2~0_267) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (mod v_~main$tmp_guard0~0_114 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (ite (= (ite (not (and (= 2 v_~x$mem_tmp~0_199) (= v_~__unbuffered_p0_EAX~0_114 0) (= 2 v_~__unbuffered_p2_EAX~0_166) (= v_~y~0_80 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= v_~x$w_buff0~0_438 v_~x$w_buff0~0_437) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| 0)) (= v_~x$w_buff1~0_425 v_~x$w_buff1~0_424) (= v_~x$r_buff0_thd0~0_231 (ite .cse0 .cse22 (ite (or .cse7 .cse8 (and .cse23 .cse24)) .cse22 (ite (and .cse25 (not .cse8)) 0 .cse22)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| |v_ULTIMATE.start_main_#t~ite53#1_131|)) |v_#memory_int_784|) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= v_~weak$$choice0~0_236 |v_ULTIMATE.start_main_#t~nondet42#1_123|) (= v_~x$flush_delayed~0_245 0) (= v_~x$r_buff1_thd0~0_226 (ite .cse0 .cse26 (ite (let ((.cse28 (= (mod v_~x$r_buff0_thd0~0_231 256) 0))) (or .cse8 (and .cse27 .cse28) (and .cse28 .cse24))) .cse26 0))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_438, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_172|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_125|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_123|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_135|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_177|, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_147|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_162|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_161|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_232, ~#x~0.offset=|v_~#x~0.offset_391|, ~x$w_buff1~0=v_~x$w_buff1~0_425, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_227, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_603, #memory_int=|v_#memory_int_785|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_437, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_93|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_245, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~x$mem_tmp~0=v_~x$mem_tmp~0_199, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_93|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_91|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~weak$$choice1~0=v_~weak$$choice1~0_153, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_136|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_77|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_166, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_130|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_231, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_113|, ~#x~0.offset=|v_~#x~0.offset_391|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_162|, ~x$w_buff1~0=v_~x$w_buff1~0_424, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_592, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_114, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_96|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_602, ~weak$$choice0~0=v_~weak$$choice0~0_236, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_149|, #memory_int=|v_#memory_int_784|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ~weak$$choice2~0=v_~weak$$choice2~0_267, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} AuxVars[|v_ULTIMATE.start_main_#t~mem52#1_145|, |v_ULTIMATE.start_main_#t~mem39#1_160|, |v_ULTIMATE.start_main_#t~ite53#1_131|, |v_ULTIMATE.start_main_#t~ite49#1_170|, |v_ULTIMATE.start_main_#t~mem48#1_175|, |v_ULTIMATE.start_main_#t~ite40#1_159|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:51:07,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [796] L778-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= v_~__unbuffered_cnt~0_55 (+ v_~__unbuffered_cnt~0_56 1)) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [846] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse15 (= (mod v_~x$r_buff0_thd0~0_232 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_603 256) 0))) (let ((.cse17 (not .cse16)) (.cse18 (not .cse15))) (let ((.cse19 (ite (and .cse17 .cse18) 0 v_~x$w_buff0_used~0_603))) (let ((.cse20 (= (mod .cse19 256) 0))) (let ((.cse30 (not .cse20))) (let ((.cse31 (and .cse18 .cse30))) (let ((.cse22 (ite .cse31 0 v_~x$r_buff0_thd0~0_232)) (.cse11 (= (mod v_~x$w_buff1_used~0_593 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd0~0_227 256) 0))) (let ((.cse12 (not .cse10)) (.cse13 (not .cse11)) (.cse23 (= (mod .cse22 256) 0))) (let ((.cse25 (not .cse23)) (.cse6 (ite (or .cse31 (and .cse12 .cse13)) 0 v_~x$w_buff1_used~0_593))) (let ((.cse29 (= (mod .cse6 256) 0)) (.cse21 (and .cse25 .cse30))) (let ((.cse26 (ite (or (and (not .cse29) .cse12) .cse21) 0 v_~x$r_buff1_thd0~0_227))) (let ((.cse1 (= (mod v_~weak$$choice2~0_267 256) 0)) (.cse27 (= (mod .cse26 256) 0))) (let ((.cse9 (and .cse23 .cse29)) (.cse7 (and .cse23 .cse27)) (.cse5 (select |v_#memory_int_785| |v_~#x~0.base_391|)) (.cse0 (not .cse1)) (.cse8 (= (mod v_~x$w_buff0_used~0_602 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_592 256) 0))) (and (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_147| |v_ULTIMATE.start_main_#t~mem52#1_145|) (= v_~x$mem_tmp~0_199 |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse0) (and (= |v_ULTIMATE.start_main_#t~mem52#1_145| v_~x$mem_tmp~0_199) (= |v_ULTIMATE.start_main_#t~mem52#1_145| |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_289 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_114) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem48#1_177| |v_ULTIMATE.start_main_#t~mem48#1_175|)) (.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_98 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_172| |v_ULTIMATE.start_main_#t~ite49#1_170|) (= v_~__unbuffered_p2_EAX~0_167 v_~__unbuffered_p2_EAX~0_166)) (and (let ((.cse4 (= (mod v_~weak$$choice1~0_153 256) 0))) (or (and (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_175| (select (select (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| v_~x$mem_tmp~0_199)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97)) (= |v_ULTIMATE.start_main_#t~mem48#1_175| |v_ULTIMATE.start_main_#t~ite49#1_170|)) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_167) .cse4))) (not .cse3) (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_166)))) (= v_~x$w_buff1_used~0_592 (ite .cse0 .cse6 (ite (or .cse7 .cse8 .cse9) .cse6 0))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_162| |v_ULTIMATE.start_main_#t~mem39#1_160|))) (or (and (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_160| (select .cse5 |v_~#x~0.offset_391|)) (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~mem39#1_160| |v_ULTIMATE.start_main_#t~ite40#1_159|)) (and .cse12 .cse13 .cse14 (= v_~x$w_buff1~0_425 |v_ULTIMATE.start_main_#t~ite40#1_159|))) (or .cse15 .cse16) (= |v_ULTIMATE.start_main_#t~ite40#1_159| v_~x$mem_tmp~0_199)) (and (= |v_ULTIMATE.start_main_#t~ite40#1_159| |v_ULTIMATE.start_main_#t~ite40#1_161|) .cse17 .cse18 (= v_~x$w_buff0~0_438 v_~x$mem_tmp~0_199) .cse14))) (= v_~weak$$choice1~0_153 |v_ULTIMATE.start_main_#t~nondet47#1_125|) (= v_~x$w_buff0_used~0_602 (ite .cse0 .cse19 (ite (or .cse20 .cse7 .cse9) .cse19 (ite .cse21 0 .cse19)))) (= |v_ULTIMATE.start_main_#t~nondet43#1_135| v_~weak$$choice2~0_267) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (mod v_~main$tmp_guard0~0_114 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (ite (= (ite (not (and (= 2 v_~x$mem_tmp~0_199) (= v_~__unbuffered_p0_EAX~0_114 0) (= 2 v_~__unbuffered_p2_EAX~0_166) (= v_~y~0_80 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= v_~x$w_buff0~0_438 v_~x$w_buff0~0_437) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| 0)) (= v_~x$w_buff1~0_425 v_~x$w_buff1~0_424) (= v_~x$r_buff0_thd0~0_231 (ite .cse0 .cse22 (ite (or .cse7 .cse8 (and .cse23 .cse24)) .cse22 (ite (and .cse25 (not .cse8)) 0 .cse22)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| |v_ULTIMATE.start_main_#t~ite53#1_131|)) |v_#memory_int_784|) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= v_~weak$$choice0~0_236 |v_ULTIMATE.start_main_#t~nondet42#1_123|) (= v_~x$flush_delayed~0_245 0) (= v_~x$r_buff1_thd0~0_226 (ite .cse0 .cse26 (ite (let ((.cse28 (= (mod v_~x$r_buff0_thd0~0_231 256) 0))) (or .cse8 (and .cse27 .cse28) (and .cse28 .cse24))) .cse26 0))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_438, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_172|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_125|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_123|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_135|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_177|, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_147|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_162|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_161|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_232, ~#x~0.offset=|v_~#x~0.offset_391|, ~x$w_buff1~0=v_~x$w_buff1~0_425, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_227, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_603, #memory_int=|v_#memory_int_785|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_437, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_93|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_245, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~x$mem_tmp~0=v_~x$mem_tmp~0_199, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_93|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_91|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~weak$$choice1~0=v_~weak$$choice1~0_153, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_136|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_77|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_166, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_130|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_231, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_113|, ~#x~0.offset=|v_~#x~0.offset_391|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_162|, ~x$w_buff1~0=v_~x$w_buff1~0_424, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_592, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_114, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_96|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_602, ~weak$$choice0~0=v_~weak$$choice0~0_236, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_149|, #memory_int=|v_#memory_int_784|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ~weak$$choice2~0=v_~weak$$choice2~0_267, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} AuxVars[|v_ULTIMATE.start_main_#t~mem52#1_145|, |v_ULTIMATE.start_main_#t~mem39#1_160|, |v_ULTIMATE.start_main_#t~ite53#1_131|, |v_ULTIMATE.start_main_#t~ite49#1_170|, |v_ULTIMATE.start_main_#t~mem48#1_175|, |v_ULTIMATE.start_main_#t~ite40#1_159|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:51:09,525 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [737] L836-->L839: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [846] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse15 (= (mod v_~x$r_buff0_thd0~0_232 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_603 256) 0))) (let ((.cse17 (not .cse16)) (.cse18 (not .cse15))) (let ((.cse19 (ite (and .cse17 .cse18) 0 v_~x$w_buff0_used~0_603))) (let ((.cse20 (= (mod .cse19 256) 0))) (let ((.cse30 (not .cse20))) (let ((.cse31 (and .cse18 .cse30))) (let ((.cse22 (ite .cse31 0 v_~x$r_buff0_thd0~0_232)) (.cse11 (= (mod v_~x$w_buff1_used~0_593 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd0~0_227 256) 0))) (let ((.cse12 (not .cse10)) (.cse13 (not .cse11)) (.cse23 (= (mod .cse22 256) 0))) (let ((.cse25 (not .cse23)) (.cse6 (ite (or .cse31 (and .cse12 .cse13)) 0 v_~x$w_buff1_used~0_593))) (let ((.cse29 (= (mod .cse6 256) 0)) (.cse21 (and .cse25 .cse30))) (let ((.cse26 (ite (or (and (not .cse29) .cse12) .cse21) 0 v_~x$r_buff1_thd0~0_227))) (let ((.cse1 (= (mod v_~weak$$choice2~0_267 256) 0)) (.cse27 (= (mod .cse26 256) 0))) (let ((.cse9 (and .cse23 .cse29)) (.cse7 (and .cse23 .cse27)) (.cse5 (select |v_#memory_int_785| |v_~#x~0.base_391|)) (.cse0 (not .cse1)) (.cse8 (= (mod v_~x$w_buff0_used~0_602 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_592 256) 0))) (and (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_147| |v_ULTIMATE.start_main_#t~mem52#1_145|) (= v_~x$mem_tmp~0_199 |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse0) (and (= |v_ULTIMATE.start_main_#t~mem52#1_145| v_~x$mem_tmp~0_199) (= |v_ULTIMATE.start_main_#t~mem52#1_145| |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_289 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_114) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem48#1_177| |v_ULTIMATE.start_main_#t~mem48#1_175|)) (.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_98 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_172| |v_ULTIMATE.start_main_#t~ite49#1_170|) (= v_~__unbuffered_p2_EAX~0_167 v_~__unbuffered_p2_EAX~0_166)) (and (let ((.cse4 (= (mod v_~weak$$choice1~0_153 256) 0))) (or (and (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_175| (select (select (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| v_~x$mem_tmp~0_199)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97)) (= |v_ULTIMATE.start_main_#t~mem48#1_175| |v_ULTIMATE.start_main_#t~ite49#1_170|)) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_167) .cse4))) (not .cse3) (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_166)))) (= v_~x$w_buff1_used~0_592 (ite .cse0 .cse6 (ite (or .cse7 .cse8 .cse9) .cse6 0))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_162| |v_ULTIMATE.start_main_#t~mem39#1_160|))) (or (and (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_160| (select .cse5 |v_~#x~0.offset_391|)) (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~mem39#1_160| |v_ULTIMATE.start_main_#t~ite40#1_159|)) (and .cse12 .cse13 .cse14 (= v_~x$w_buff1~0_425 |v_ULTIMATE.start_main_#t~ite40#1_159|))) (or .cse15 .cse16) (= |v_ULTIMATE.start_main_#t~ite40#1_159| v_~x$mem_tmp~0_199)) (and (= |v_ULTIMATE.start_main_#t~ite40#1_159| |v_ULTIMATE.start_main_#t~ite40#1_161|) .cse17 .cse18 (= v_~x$w_buff0~0_438 v_~x$mem_tmp~0_199) .cse14))) (= v_~weak$$choice1~0_153 |v_ULTIMATE.start_main_#t~nondet47#1_125|) (= v_~x$w_buff0_used~0_602 (ite .cse0 .cse19 (ite (or .cse20 .cse7 .cse9) .cse19 (ite .cse21 0 .cse19)))) (= |v_ULTIMATE.start_main_#t~nondet43#1_135| v_~weak$$choice2~0_267) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (mod v_~main$tmp_guard0~0_114 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (ite (= (ite (not (and (= 2 v_~x$mem_tmp~0_199) (= v_~__unbuffered_p0_EAX~0_114 0) (= 2 v_~__unbuffered_p2_EAX~0_166) (= v_~y~0_80 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= v_~x$w_buff0~0_438 v_~x$w_buff0~0_437) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| 0)) (= v_~x$w_buff1~0_425 v_~x$w_buff1~0_424) (= v_~x$r_buff0_thd0~0_231 (ite .cse0 .cse22 (ite (or .cse7 .cse8 (and .cse23 .cse24)) .cse22 (ite (and .cse25 (not .cse8)) 0 .cse22)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| |v_ULTIMATE.start_main_#t~ite53#1_131|)) |v_#memory_int_784|) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= v_~weak$$choice0~0_236 |v_ULTIMATE.start_main_#t~nondet42#1_123|) (= v_~x$flush_delayed~0_245 0) (= v_~x$r_buff1_thd0~0_226 (ite .cse0 .cse26 (ite (let ((.cse28 (= (mod v_~x$r_buff0_thd0~0_231 256) 0))) (or .cse8 (and .cse27 .cse28) (and .cse28 .cse24))) .cse26 0))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_438, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_172|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_125|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_123|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_135|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_177|, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_147|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_162|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_161|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_232, ~#x~0.offset=|v_~#x~0.offset_391|, ~x$w_buff1~0=v_~x$w_buff1~0_425, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_227, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_603, #memory_int=|v_#memory_int_785|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_437, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_93|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_245, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~x$mem_tmp~0=v_~x$mem_tmp~0_199, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_93|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_91|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~weak$$choice1~0=v_~weak$$choice1~0_153, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_136|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_77|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_166, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_130|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_231, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_113|, ~#x~0.offset=|v_~#x~0.offset_391|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_162|, ~x$w_buff1~0=v_~x$w_buff1~0_424, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_592, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_114, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_96|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_602, ~weak$$choice0~0=v_~weak$$choice0~0_236, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_149|, #memory_int=|v_#memory_int_784|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ~weak$$choice2~0=v_~weak$$choice2~0_267, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} AuxVars[|v_ULTIMATE.start_main_#t~mem52#1_145|, |v_ULTIMATE.start_main_#t~mem39#1_160|, |v_ULTIMATE.start_main_#t~ite53#1_131|, |v_ULTIMATE.start_main_#t~ite49#1_170|, |v_ULTIMATE.start_main_#t~mem48#1_175|, |v_ULTIMATE.start_main_#t~ite40#1_159|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:51:10,976 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [791] L836-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P2Thread1of1ForFork0_#res.offset_9| 0) (= |v_P2Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [846] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse15 (= (mod v_~x$r_buff0_thd0~0_232 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_603 256) 0))) (let ((.cse17 (not .cse16)) (.cse18 (not .cse15))) (let ((.cse19 (ite (and .cse17 .cse18) 0 v_~x$w_buff0_used~0_603))) (let ((.cse20 (= (mod .cse19 256) 0))) (let ((.cse30 (not .cse20))) (let ((.cse31 (and .cse18 .cse30))) (let ((.cse22 (ite .cse31 0 v_~x$r_buff0_thd0~0_232)) (.cse11 (= (mod v_~x$w_buff1_used~0_593 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd0~0_227 256) 0))) (let ((.cse12 (not .cse10)) (.cse13 (not .cse11)) (.cse23 (= (mod .cse22 256) 0))) (let ((.cse25 (not .cse23)) (.cse6 (ite (or .cse31 (and .cse12 .cse13)) 0 v_~x$w_buff1_used~0_593))) (let ((.cse29 (= (mod .cse6 256) 0)) (.cse21 (and .cse25 .cse30))) (let ((.cse26 (ite (or (and (not .cse29) .cse12) .cse21) 0 v_~x$r_buff1_thd0~0_227))) (let ((.cse1 (= (mod v_~weak$$choice2~0_267 256) 0)) (.cse27 (= (mod .cse26 256) 0))) (let ((.cse9 (and .cse23 .cse29)) (.cse7 (and .cse23 .cse27)) (.cse5 (select |v_#memory_int_785| |v_~#x~0.base_391|)) (.cse0 (not .cse1)) (.cse8 (= (mod v_~x$w_buff0_used~0_602 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_592 256) 0))) (and (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_147| |v_ULTIMATE.start_main_#t~mem52#1_145|) (= v_~x$mem_tmp~0_199 |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse0) (and (= |v_ULTIMATE.start_main_#t~mem52#1_145| v_~x$mem_tmp~0_199) (= |v_ULTIMATE.start_main_#t~mem52#1_145| |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_289 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_114) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem48#1_177| |v_ULTIMATE.start_main_#t~mem48#1_175|)) (.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_98 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_172| |v_ULTIMATE.start_main_#t~ite49#1_170|) (= v_~__unbuffered_p2_EAX~0_167 v_~__unbuffered_p2_EAX~0_166)) (and (let ((.cse4 (= (mod v_~weak$$choice1~0_153 256) 0))) (or (and (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_175| (select (select (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| v_~x$mem_tmp~0_199)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97)) (= |v_ULTIMATE.start_main_#t~mem48#1_175| |v_ULTIMATE.start_main_#t~ite49#1_170|)) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_167) .cse4))) (not .cse3) (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_166)))) (= v_~x$w_buff1_used~0_592 (ite .cse0 .cse6 (ite (or .cse7 .cse8 .cse9) .cse6 0))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_162| |v_ULTIMATE.start_main_#t~mem39#1_160|))) (or (and (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_160| (select .cse5 |v_~#x~0.offset_391|)) (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~mem39#1_160| |v_ULTIMATE.start_main_#t~ite40#1_159|)) (and .cse12 .cse13 .cse14 (= v_~x$w_buff1~0_425 |v_ULTIMATE.start_main_#t~ite40#1_159|))) (or .cse15 .cse16) (= |v_ULTIMATE.start_main_#t~ite40#1_159| v_~x$mem_tmp~0_199)) (and (= |v_ULTIMATE.start_main_#t~ite40#1_159| |v_ULTIMATE.start_main_#t~ite40#1_161|) .cse17 .cse18 (= v_~x$w_buff0~0_438 v_~x$mem_tmp~0_199) .cse14))) (= v_~weak$$choice1~0_153 |v_ULTIMATE.start_main_#t~nondet47#1_125|) (= v_~x$w_buff0_used~0_602 (ite .cse0 .cse19 (ite (or .cse20 .cse7 .cse9) .cse19 (ite .cse21 0 .cse19)))) (= |v_ULTIMATE.start_main_#t~nondet43#1_135| v_~weak$$choice2~0_267) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (mod v_~main$tmp_guard0~0_114 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (ite (= (ite (not (and (= 2 v_~x$mem_tmp~0_199) (= v_~__unbuffered_p0_EAX~0_114 0) (= 2 v_~__unbuffered_p2_EAX~0_166) (= v_~y~0_80 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= v_~x$w_buff0~0_438 v_~x$w_buff0~0_437) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| 0)) (= v_~x$w_buff1~0_425 v_~x$w_buff1~0_424) (= v_~x$r_buff0_thd0~0_231 (ite .cse0 .cse22 (ite (or .cse7 .cse8 (and .cse23 .cse24)) .cse22 (ite (and .cse25 (not .cse8)) 0 .cse22)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| |v_ULTIMATE.start_main_#t~ite53#1_131|)) |v_#memory_int_784|) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= v_~weak$$choice0~0_236 |v_ULTIMATE.start_main_#t~nondet42#1_123|) (= v_~x$flush_delayed~0_245 0) (= v_~x$r_buff1_thd0~0_226 (ite .cse0 .cse26 (ite (let ((.cse28 (= (mod v_~x$r_buff0_thd0~0_231 256) 0))) (or .cse8 (and .cse27 .cse28) (and .cse28 .cse24))) .cse26 0))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_438, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_172|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_125|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_123|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_135|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_177|, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_147|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_162|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_161|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_232, ~#x~0.offset=|v_~#x~0.offset_391|, ~x$w_buff1~0=v_~x$w_buff1~0_425, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_227, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_603, #memory_int=|v_#memory_int_785|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_437, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_93|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_245, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~x$mem_tmp~0=v_~x$mem_tmp~0_199, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_93|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_91|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~weak$$choice1~0=v_~weak$$choice1~0_153, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_136|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_77|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_166, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_130|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_231, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_113|, ~#x~0.offset=|v_~#x~0.offset_391|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_162|, ~x$w_buff1~0=v_~x$w_buff1~0_424, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_592, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_114, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_96|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_602, ~weak$$choice0~0=v_~weak$$choice0~0_236, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_149|, #memory_int=|v_#memory_int_784|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ~weak$$choice2~0=v_~weak$$choice2~0_267, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} AuxVars[|v_ULTIMATE.start_main_#t~mem52#1_145|, |v_ULTIMATE.start_main_#t~mem39#1_160|, |v_ULTIMATE.start_main_#t~ite53#1_131|, |v_ULTIMATE.start_main_#t~ite49#1_170|, |v_ULTIMATE.start_main_#t~mem48#1_175|, |v_ULTIMATE.start_main_#t~ite40#1_159|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:51:12,383 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [790] L836-->P2FINAL: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [846] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse15 (= (mod v_~x$r_buff0_thd0~0_232 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_603 256) 0))) (let ((.cse17 (not .cse16)) (.cse18 (not .cse15))) (let ((.cse19 (ite (and .cse17 .cse18) 0 v_~x$w_buff0_used~0_603))) (let ((.cse20 (= (mod .cse19 256) 0))) (let ((.cse30 (not .cse20))) (let ((.cse31 (and .cse18 .cse30))) (let ((.cse22 (ite .cse31 0 v_~x$r_buff0_thd0~0_232)) (.cse11 (= (mod v_~x$w_buff1_used~0_593 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd0~0_227 256) 0))) (let ((.cse12 (not .cse10)) (.cse13 (not .cse11)) (.cse23 (= (mod .cse22 256) 0))) (let ((.cse25 (not .cse23)) (.cse6 (ite (or .cse31 (and .cse12 .cse13)) 0 v_~x$w_buff1_used~0_593))) (let ((.cse29 (= (mod .cse6 256) 0)) (.cse21 (and .cse25 .cse30))) (let ((.cse26 (ite (or (and (not .cse29) .cse12) .cse21) 0 v_~x$r_buff1_thd0~0_227))) (let ((.cse1 (= (mod v_~weak$$choice2~0_267 256) 0)) (.cse27 (= (mod .cse26 256) 0))) (let ((.cse9 (and .cse23 .cse29)) (.cse7 (and .cse23 .cse27)) (.cse5 (select |v_#memory_int_785| |v_~#x~0.base_391|)) (.cse0 (not .cse1)) (.cse8 (= (mod v_~x$w_buff0_used~0_602 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_592 256) 0))) (and (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_147| |v_ULTIMATE.start_main_#t~mem52#1_145|) (= v_~x$mem_tmp~0_199 |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse0) (and (= |v_ULTIMATE.start_main_#t~mem52#1_145| v_~x$mem_tmp~0_199) (= |v_ULTIMATE.start_main_#t~mem52#1_145| |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_289 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_114) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem48#1_177| |v_ULTIMATE.start_main_#t~mem48#1_175|)) (.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_98 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_172| |v_ULTIMATE.start_main_#t~ite49#1_170|) (= v_~__unbuffered_p2_EAX~0_167 v_~__unbuffered_p2_EAX~0_166)) (and (let ((.cse4 (= (mod v_~weak$$choice1~0_153 256) 0))) (or (and (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_175| (select (select (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| v_~x$mem_tmp~0_199)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97)) (= |v_ULTIMATE.start_main_#t~mem48#1_175| |v_ULTIMATE.start_main_#t~ite49#1_170|)) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_167) .cse4))) (not .cse3) (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_166)))) (= v_~x$w_buff1_used~0_592 (ite .cse0 .cse6 (ite (or .cse7 .cse8 .cse9) .cse6 0))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_162| |v_ULTIMATE.start_main_#t~mem39#1_160|))) (or (and (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_160| (select .cse5 |v_~#x~0.offset_391|)) (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~mem39#1_160| |v_ULTIMATE.start_main_#t~ite40#1_159|)) (and .cse12 .cse13 .cse14 (= v_~x$w_buff1~0_425 |v_ULTIMATE.start_main_#t~ite40#1_159|))) (or .cse15 .cse16) (= |v_ULTIMATE.start_main_#t~ite40#1_159| v_~x$mem_tmp~0_199)) (and (= |v_ULTIMATE.start_main_#t~ite40#1_159| |v_ULTIMATE.start_main_#t~ite40#1_161|) .cse17 .cse18 (= v_~x$w_buff0~0_438 v_~x$mem_tmp~0_199) .cse14))) (= v_~weak$$choice1~0_153 |v_ULTIMATE.start_main_#t~nondet47#1_125|) (= v_~x$w_buff0_used~0_602 (ite .cse0 .cse19 (ite (or .cse20 .cse7 .cse9) .cse19 (ite .cse21 0 .cse19)))) (= |v_ULTIMATE.start_main_#t~nondet43#1_135| v_~weak$$choice2~0_267) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (mod v_~main$tmp_guard0~0_114 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (ite (= (ite (not (and (= 2 v_~x$mem_tmp~0_199) (= v_~__unbuffered_p0_EAX~0_114 0) (= 2 v_~__unbuffered_p2_EAX~0_166) (= v_~y~0_80 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= v_~x$w_buff0~0_438 v_~x$w_buff0~0_437) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| 0)) (= v_~x$w_buff1~0_425 v_~x$w_buff1~0_424) (= v_~x$r_buff0_thd0~0_231 (ite .cse0 .cse22 (ite (or .cse7 .cse8 (and .cse23 .cse24)) .cse22 (ite (and .cse25 (not .cse8)) 0 .cse22)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| |v_ULTIMATE.start_main_#t~ite53#1_131|)) |v_#memory_int_784|) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= v_~weak$$choice0~0_236 |v_ULTIMATE.start_main_#t~nondet42#1_123|) (= v_~x$flush_delayed~0_245 0) (= v_~x$r_buff1_thd0~0_226 (ite .cse0 .cse26 (ite (let ((.cse28 (= (mod v_~x$r_buff0_thd0~0_231 256) 0))) (or .cse8 (and .cse27 .cse28) (and .cse28 .cse24))) .cse26 0))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_438, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_172|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_125|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_123|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_135|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_177|, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_147|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_162|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_161|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_232, ~#x~0.offset=|v_~#x~0.offset_391|, ~x$w_buff1~0=v_~x$w_buff1~0_425, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_227, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_603, #memory_int=|v_#memory_int_785|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_437, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_93|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_245, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~x$mem_tmp~0=v_~x$mem_tmp~0_199, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_93|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_91|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~weak$$choice1~0=v_~weak$$choice1~0_153, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_136|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_77|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_166, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_130|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_231, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_113|, ~#x~0.offset=|v_~#x~0.offset_391|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_162|, ~x$w_buff1~0=v_~x$w_buff1~0_424, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_592, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_114, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_96|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_602, ~weak$$choice0~0=v_~weak$$choice0~0_236, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_149|, #memory_int=|v_#memory_int_784|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ~weak$$choice2~0=v_~weak$$choice2~0_267, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} AuxVars[|v_ULTIMATE.start_main_#t~mem52#1_145|, |v_ULTIMATE.start_main_#t~mem39#1_160|, |v_ULTIMATE.start_main_#t~ite53#1_131|, |v_ULTIMATE.start_main_#t~ite49#1_170|, |v_ULTIMATE.start_main_#t~mem48#1_175|, |v_ULTIMATE.start_main_#t~ite40#1_159|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:51:13,886 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [730] L800-->L803: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [846] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse15 (= (mod v_~x$r_buff0_thd0~0_232 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_603 256) 0))) (let ((.cse17 (not .cse16)) (.cse18 (not .cse15))) (let ((.cse19 (ite (and .cse17 .cse18) 0 v_~x$w_buff0_used~0_603))) (let ((.cse20 (= (mod .cse19 256) 0))) (let ((.cse30 (not .cse20))) (let ((.cse31 (and .cse18 .cse30))) (let ((.cse22 (ite .cse31 0 v_~x$r_buff0_thd0~0_232)) (.cse11 (= (mod v_~x$w_buff1_used~0_593 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd0~0_227 256) 0))) (let ((.cse12 (not .cse10)) (.cse13 (not .cse11)) (.cse23 (= (mod .cse22 256) 0))) (let ((.cse25 (not .cse23)) (.cse6 (ite (or .cse31 (and .cse12 .cse13)) 0 v_~x$w_buff1_used~0_593))) (let ((.cse29 (= (mod .cse6 256) 0)) (.cse21 (and .cse25 .cse30))) (let ((.cse26 (ite (or (and (not .cse29) .cse12) .cse21) 0 v_~x$r_buff1_thd0~0_227))) (let ((.cse1 (= (mod v_~weak$$choice2~0_267 256) 0)) (.cse27 (= (mod .cse26 256) 0))) (let ((.cse9 (and .cse23 .cse29)) (.cse7 (and .cse23 .cse27)) (.cse5 (select |v_#memory_int_785| |v_~#x~0.base_391|)) (.cse0 (not .cse1)) (.cse8 (= (mod v_~x$w_buff0_used~0_602 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_592 256) 0))) (and (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_147| |v_ULTIMATE.start_main_#t~mem52#1_145|) (= v_~x$mem_tmp~0_199 |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse0) (and (= |v_ULTIMATE.start_main_#t~mem52#1_145| v_~x$mem_tmp~0_199) (= |v_ULTIMATE.start_main_#t~mem52#1_145| |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_289 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_114) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem48#1_177| |v_ULTIMATE.start_main_#t~mem48#1_175|)) (.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_98 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_172| |v_ULTIMATE.start_main_#t~ite49#1_170|) (= v_~__unbuffered_p2_EAX~0_167 v_~__unbuffered_p2_EAX~0_166)) (and (let ((.cse4 (= (mod v_~weak$$choice1~0_153 256) 0))) (or (and (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_175| (select (select (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| v_~x$mem_tmp~0_199)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97)) (= |v_ULTIMATE.start_main_#t~mem48#1_175| |v_ULTIMATE.start_main_#t~ite49#1_170|)) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_167) .cse4))) (not .cse3) (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_166)))) (= v_~x$w_buff1_used~0_592 (ite .cse0 .cse6 (ite (or .cse7 .cse8 .cse9) .cse6 0))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_162| |v_ULTIMATE.start_main_#t~mem39#1_160|))) (or (and (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_160| (select .cse5 |v_~#x~0.offset_391|)) (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~mem39#1_160| |v_ULTIMATE.start_main_#t~ite40#1_159|)) (and .cse12 .cse13 .cse14 (= v_~x$w_buff1~0_425 |v_ULTIMATE.start_main_#t~ite40#1_159|))) (or .cse15 .cse16) (= |v_ULTIMATE.start_main_#t~ite40#1_159| v_~x$mem_tmp~0_199)) (and (= |v_ULTIMATE.start_main_#t~ite40#1_159| |v_ULTIMATE.start_main_#t~ite40#1_161|) .cse17 .cse18 (= v_~x$w_buff0~0_438 v_~x$mem_tmp~0_199) .cse14))) (= v_~weak$$choice1~0_153 |v_ULTIMATE.start_main_#t~nondet47#1_125|) (= v_~x$w_buff0_used~0_602 (ite .cse0 .cse19 (ite (or .cse20 .cse7 .cse9) .cse19 (ite .cse21 0 .cse19)))) (= |v_ULTIMATE.start_main_#t~nondet43#1_135| v_~weak$$choice2~0_267) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (mod v_~main$tmp_guard0~0_114 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (ite (= (ite (not (and (= 2 v_~x$mem_tmp~0_199) (= v_~__unbuffered_p0_EAX~0_114 0) (= 2 v_~__unbuffered_p2_EAX~0_166) (= v_~y~0_80 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= v_~x$w_buff0~0_438 v_~x$w_buff0~0_437) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| 0)) (= v_~x$w_buff1~0_425 v_~x$w_buff1~0_424) (= v_~x$r_buff0_thd0~0_231 (ite .cse0 .cse22 (ite (or .cse7 .cse8 (and .cse23 .cse24)) .cse22 (ite (and .cse25 (not .cse8)) 0 .cse22)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| |v_ULTIMATE.start_main_#t~ite53#1_131|)) |v_#memory_int_784|) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= v_~weak$$choice0~0_236 |v_ULTIMATE.start_main_#t~nondet42#1_123|) (= v_~x$flush_delayed~0_245 0) (= v_~x$r_buff1_thd0~0_226 (ite .cse0 .cse26 (ite (let ((.cse28 (= (mod v_~x$r_buff0_thd0~0_231 256) 0))) (or .cse8 (and .cse27 .cse28) (and .cse28 .cse24))) .cse26 0))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_438, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_172|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_125|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_123|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_135|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_177|, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_147|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_162|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_161|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_232, ~#x~0.offset=|v_~#x~0.offset_391|, ~x$w_buff1~0=v_~x$w_buff1~0_425, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_227, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_603, #memory_int=|v_#memory_int_785|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_437, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_93|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_245, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~x$mem_tmp~0=v_~x$mem_tmp~0_199, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_93|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_91|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~weak$$choice1~0=v_~weak$$choice1~0_153, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_136|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_77|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_166, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_130|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_231, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_113|, ~#x~0.offset=|v_~#x~0.offset_391|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_162|, ~x$w_buff1~0=v_~x$w_buff1~0_424, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_592, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_114, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_96|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_602, ~weak$$choice0~0=v_~weak$$choice0~0_236, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_149|, #memory_int=|v_#memory_int_784|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ~weak$$choice2~0=v_~weak$$choice2~0_267, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} AuxVars[|v_ULTIMATE.start_main_#t~mem52#1_145|, |v_ULTIMATE.start_main_#t~mem39#1_160|, |v_ULTIMATE.start_main_#t~ite53#1_131|, |v_ULTIMATE.start_main_#t~ite49#1_170|, |v_ULTIMATE.start_main_#t~mem48#1_175|, |v_ULTIMATE.start_main_#t~ite40#1_159|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:51:15,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [825] L800-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [846] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse15 (= (mod v_~x$r_buff0_thd0~0_232 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_603 256) 0))) (let ((.cse17 (not .cse16)) (.cse18 (not .cse15))) (let ((.cse19 (ite (and .cse17 .cse18) 0 v_~x$w_buff0_used~0_603))) (let ((.cse20 (= (mod .cse19 256) 0))) (let ((.cse30 (not .cse20))) (let ((.cse31 (and .cse18 .cse30))) (let ((.cse22 (ite .cse31 0 v_~x$r_buff0_thd0~0_232)) (.cse11 (= (mod v_~x$w_buff1_used~0_593 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd0~0_227 256) 0))) (let ((.cse12 (not .cse10)) (.cse13 (not .cse11)) (.cse23 (= (mod .cse22 256) 0))) (let ((.cse25 (not .cse23)) (.cse6 (ite (or .cse31 (and .cse12 .cse13)) 0 v_~x$w_buff1_used~0_593))) (let ((.cse29 (= (mod .cse6 256) 0)) (.cse21 (and .cse25 .cse30))) (let ((.cse26 (ite (or (and (not .cse29) .cse12) .cse21) 0 v_~x$r_buff1_thd0~0_227))) (let ((.cse1 (= (mod v_~weak$$choice2~0_267 256) 0)) (.cse27 (= (mod .cse26 256) 0))) (let ((.cse9 (and .cse23 .cse29)) (.cse7 (and .cse23 .cse27)) (.cse5 (select |v_#memory_int_785| |v_~#x~0.base_391|)) (.cse0 (not .cse1)) (.cse8 (= (mod v_~x$w_buff0_used~0_602 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_592 256) 0))) (and (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_147| |v_ULTIMATE.start_main_#t~mem52#1_145|) (= v_~x$mem_tmp~0_199 |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse0) (and (= |v_ULTIMATE.start_main_#t~mem52#1_145| v_~x$mem_tmp~0_199) (= |v_ULTIMATE.start_main_#t~mem52#1_145| |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_289 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_114) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem48#1_177| |v_ULTIMATE.start_main_#t~mem48#1_175|)) (.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_98 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_172| |v_ULTIMATE.start_main_#t~ite49#1_170|) (= v_~__unbuffered_p2_EAX~0_167 v_~__unbuffered_p2_EAX~0_166)) (and (let ((.cse4 (= (mod v_~weak$$choice1~0_153 256) 0))) (or (and (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_175| (select (select (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| v_~x$mem_tmp~0_199)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97)) (= |v_ULTIMATE.start_main_#t~mem48#1_175| |v_ULTIMATE.start_main_#t~ite49#1_170|)) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_167) .cse4))) (not .cse3) (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_166)))) (= v_~x$w_buff1_used~0_592 (ite .cse0 .cse6 (ite (or .cse7 .cse8 .cse9) .cse6 0))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_162| |v_ULTIMATE.start_main_#t~mem39#1_160|))) (or (and (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_160| (select .cse5 |v_~#x~0.offset_391|)) (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~mem39#1_160| |v_ULTIMATE.start_main_#t~ite40#1_159|)) (and .cse12 .cse13 .cse14 (= v_~x$w_buff1~0_425 |v_ULTIMATE.start_main_#t~ite40#1_159|))) (or .cse15 .cse16) (= |v_ULTIMATE.start_main_#t~ite40#1_159| v_~x$mem_tmp~0_199)) (and (= |v_ULTIMATE.start_main_#t~ite40#1_159| |v_ULTIMATE.start_main_#t~ite40#1_161|) .cse17 .cse18 (= v_~x$w_buff0~0_438 v_~x$mem_tmp~0_199) .cse14))) (= v_~weak$$choice1~0_153 |v_ULTIMATE.start_main_#t~nondet47#1_125|) (= v_~x$w_buff0_used~0_602 (ite .cse0 .cse19 (ite (or .cse20 .cse7 .cse9) .cse19 (ite .cse21 0 .cse19)))) (= |v_ULTIMATE.start_main_#t~nondet43#1_135| v_~weak$$choice2~0_267) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (mod v_~main$tmp_guard0~0_114 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (ite (= (ite (not (and (= 2 v_~x$mem_tmp~0_199) (= v_~__unbuffered_p0_EAX~0_114 0) (= 2 v_~__unbuffered_p2_EAX~0_166) (= v_~y~0_80 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= v_~x$w_buff0~0_438 v_~x$w_buff0~0_437) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| 0)) (= v_~x$w_buff1~0_425 v_~x$w_buff1~0_424) (= v_~x$r_buff0_thd0~0_231 (ite .cse0 .cse22 (ite (or .cse7 .cse8 (and .cse23 .cse24)) .cse22 (ite (and .cse25 (not .cse8)) 0 .cse22)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| |v_ULTIMATE.start_main_#t~ite53#1_131|)) |v_#memory_int_784|) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= v_~weak$$choice0~0_236 |v_ULTIMATE.start_main_#t~nondet42#1_123|) (= v_~x$flush_delayed~0_245 0) (= v_~x$r_buff1_thd0~0_226 (ite .cse0 .cse26 (ite (let ((.cse28 (= (mod v_~x$r_buff0_thd0~0_231 256) 0))) (or .cse8 (and .cse27 .cse28) (and .cse28 .cse24))) .cse26 0))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_438, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_172|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_125|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_123|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_135|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_177|, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_147|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_162|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_161|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_232, ~#x~0.offset=|v_~#x~0.offset_391|, ~x$w_buff1~0=v_~x$w_buff1~0_425, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_227, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_603, #memory_int=|v_#memory_int_785|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_437, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_93|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_245, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~x$mem_tmp~0=v_~x$mem_tmp~0_199, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_93|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_91|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~weak$$choice1~0=v_~weak$$choice1~0_153, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_136|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_77|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_166, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_130|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_231, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_113|, ~#x~0.offset=|v_~#x~0.offset_391|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_162|, ~x$w_buff1~0=v_~x$w_buff1~0_424, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_592, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_114, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_96|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_602, ~weak$$choice0~0=v_~weak$$choice0~0_236, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_149|, #memory_int=|v_#memory_int_784|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ~weak$$choice2~0=v_~weak$$choice2~0_267, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} AuxVars[|v_ULTIMATE.start_main_#t~mem52#1_145|, |v_ULTIMATE.start_main_#t~mem39#1_160|, |v_ULTIMATE.start_main_#t~ite53#1_131|, |v_ULTIMATE.start_main_#t~ite49#1_170|, |v_ULTIMATE.start_main_#t~mem48#1_175|, |v_ULTIMATE.start_main_#t~ite40#1_159|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:51:16,849 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [826] L800-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork2_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_88 1) v_~__unbuffered_cnt~0_87) (= |v_P1Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] and [846] L858-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse15 (= (mod v_~x$r_buff0_thd0~0_232 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_603 256) 0))) (let ((.cse17 (not .cse16)) (.cse18 (not .cse15))) (let ((.cse19 (ite (and .cse17 .cse18) 0 v_~x$w_buff0_used~0_603))) (let ((.cse20 (= (mod .cse19 256) 0))) (let ((.cse30 (not .cse20))) (let ((.cse31 (and .cse18 .cse30))) (let ((.cse22 (ite .cse31 0 v_~x$r_buff0_thd0~0_232)) (.cse11 (= (mod v_~x$w_buff1_used~0_593 256) 0)) (.cse10 (= (mod v_~x$r_buff1_thd0~0_227 256) 0))) (let ((.cse12 (not .cse10)) (.cse13 (not .cse11)) (.cse23 (= (mod .cse22 256) 0))) (let ((.cse25 (not .cse23)) (.cse6 (ite (or .cse31 (and .cse12 .cse13)) 0 v_~x$w_buff1_used~0_593))) (let ((.cse29 (= (mod .cse6 256) 0)) (.cse21 (and .cse25 .cse30))) (let ((.cse26 (ite (or (and (not .cse29) .cse12) .cse21) 0 v_~x$r_buff1_thd0~0_227))) (let ((.cse1 (= (mod v_~weak$$choice2~0_267 256) 0)) (.cse27 (= (mod .cse26 256) 0))) (let ((.cse9 (and .cse23 .cse29)) (.cse7 (and .cse23 .cse27)) (.cse5 (select |v_#memory_int_785| |v_~#x~0.base_391|)) (.cse0 (not .cse1)) (.cse8 (= (mod v_~x$w_buff0_used~0_602 256) 0)) (.cse24 (= (mod v_~x$w_buff1_used~0_592 256) 0))) (and (or (and (= |v_ULTIMATE.start_main_#t~mem52#1_147| |v_ULTIMATE.start_main_#t~mem52#1_145|) (= v_~x$mem_tmp~0_199 |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse0) (and (= |v_ULTIMATE.start_main_#t~mem52#1_145| v_~x$mem_tmp~0_199) (= |v_ULTIMATE.start_main_#t~mem52#1_145| |v_ULTIMATE.start_main_#t~ite53#1_131|) .cse1)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_289 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_114) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem48#1_177| |v_ULTIMATE.start_main_#t~mem48#1_175|)) (.cse3 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_98 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite49#1_172| |v_ULTIMATE.start_main_#t~ite49#1_170|) (= v_~__unbuffered_p2_EAX~0_167 v_~__unbuffered_p2_EAX~0_166)) (and (let ((.cse4 (= (mod v_~weak$$choice1~0_153 256) 0))) (or (and (not .cse4) (= |v_ULTIMATE.start_main_#t~mem48#1_175| (select (select (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| v_~x$mem_tmp~0_199)) v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97)) (= |v_ULTIMATE.start_main_#t~mem48#1_175| |v_ULTIMATE.start_main_#t~ite49#1_170|)) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_167) .cse4))) (not .cse3) (= |v_ULTIMATE.start_main_#t~ite49#1_170| v_~__unbuffered_p2_EAX~0_166)))) (= v_~x$w_buff1_used~0_592 (ite .cse0 .cse6 (ite (or .cse7 .cse8 .cse9) .cse6 0))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem39#1_162| |v_ULTIMATE.start_main_#t~mem39#1_160|))) (or (and (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_160| (select .cse5 |v_~#x~0.offset_391|)) (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~mem39#1_160| |v_ULTIMATE.start_main_#t~ite40#1_159|)) (and .cse12 .cse13 .cse14 (= v_~x$w_buff1~0_425 |v_ULTIMATE.start_main_#t~ite40#1_159|))) (or .cse15 .cse16) (= |v_ULTIMATE.start_main_#t~ite40#1_159| v_~x$mem_tmp~0_199)) (and (= |v_ULTIMATE.start_main_#t~ite40#1_159| |v_ULTIMATE.start_main_#t~ite40#1_161|) .cse17 .cse18 (= v_~x$w_buff0~0_438 v_~x$mem_tmp~0_199) .cse14))) (= v_~weak$$choice1~0_153 |v_ULTIMATE.start_main_#t~nondet47#1_125|) (= v_~x$w_buff0_used~0_602 (ite .cse0 .cse19 (ite (or .cse20 .cse7 .cse9) .cse19 (ite .cse21 0 .cse19)))) (= |v_ULTIMATE.start_main_#t~nondet43#1_135| v_~weak$$choice2~0_267) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (mod v_~main$tmp_guard0~0_114 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|) (= (ite (= (ite (not (and (= 2 v_~x$mem_tmp~0_199) (= v_~__unbuffered_p0_EAX~0_114 0) (= 2 v_~__unbuffered_p2_EAX~0_166) (= v_~y~0_80 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_86) (= v_~x$w_buff0~0_438 v_~x$w_buff0~0_437) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_77| 0)) (= v_~x$w_buff1~0_425 v_~x$w_buff1~0_424) (= v_~x$r_buff0_thd0~0_231 (ite .cse0 .cse22 (ite (or .cse7 .cse8 (and .cse23 .cse24)) .cse22 (ite (and .cse25 (not .cse8)) 0 .cse22)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|) (= (store |v_#memory_int_785| |v_~#x~0.base_391| (store .cse5 |v_~#x~0.offset_391| |v_ULTIMATE.start_main_#t~ite53#1_131|)) |v_#memory_int_784|) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|) (= v_~weak$$choice0~0_236 |v_ULTIMATE.start_main_#t~nondet42#1_123|) (= v_~x$flush_delayed~0_245 0) (= v_~x$r_buff1_thd0~0_226 (ite .cse0 .cse26 (ite (let ((.cse28 (= (mod v_~x$r_buff0_thd0~0_231 256) 0))) (or .cse8 (and .cse27 .cse28) (and .cse28 .cse24))) .cse26 0))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_438, ULTIMATE.start_main_#t~ite49#1=|v_ULTIMATE.start_main_#t~ite49#1_172|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ULTIMATE.start_main_#t~nondet47#1=|v_ULTIMATE.start_main_#t~nondet47#1_125|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_123|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_167, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_135|, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_177|, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~mem52#1=|v_ULTIMATE.start_main_#t~mem52#1_147|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_162|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_161|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_232, ~#x~0.offset=|v_~#x~0.offset_391|, ~x$w_buff1~0=v_~x$w_buff1~0_425, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_227, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_603, #memory_int=|v_#memory_int_785|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_437, ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_93|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_29|, ~x$flush_delayed~0=v_~x$flush_delayed~0_245, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_97, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_97, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~x$mem_tmp~0=v_~x$mem_tmp~0_199, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_93|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_91|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~weak$$choice1~0=v_~weak$$choice1~0_153, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_136|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_77|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_166, ~y~0=v_~y~0_80, ULTIMATE.start_main_#t~ite53#1=|v_ULTIMATE.start_main_#t~ite53#1_130|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_231, ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_113|, ~#x~0.offset=|v_~#x~0.offset_391|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_162|, ~x$w_buff1~0=v_~x$w_buff1~0_424, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_592, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_114, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite50#1=|v_ULTIMATE.start_main_#t~ite50#1_96|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_98, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_602, ~weak$$choice0~0=v_~weak$$choice0~0_236, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_23|, ULTIMATE.start_main_#t~ite46#1=|v_ULTIMATE.start_main_#t~ite46#1_149|, #memory_int=|v_#memory_int_784|, ~#x~0.base=|v_~#x~0.base_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_289, ~weak$$choice2~0=v_~weak$$choice2~0_267, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_57|} AuxVars[|v_ULTIMATE.start_main_#t~mem52#1_145|, |v_ULTIMATE.start_main_#t~mem39#1_160|, |v_ULTIMATE.start_main_#t~ite53#1_131|, |v_ULTIMATE.start_main_#t~ite49#1_170|, |v_ULTIMATE.start_main_#t~mem48#1_175|, |v_ULTIMATE.start_main_#t~ite40#1_159|] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~mem51#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite49#1, ULTIMATE.start_main_#t~nondet47#1, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_#t~mem44#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite41#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_#t~mem48#1, ULTIMATE.start_main_#t~mem52#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite53#1, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_main_#t~mem45#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite50#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite46#1, #memory_int, ~weak$$choice2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:51:18,391 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 00:51:18,391 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23719 [2022-12-13 00:51:18,392 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 450 flow [2022-12-13 00:51:18,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:51:18,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:51:18,392 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:51:18,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:51:18,392 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:51:18,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:51:18,393 INFO L85 PathProgramCache]: Analyzing trace with hash -439250944, now seen corresponding path program 1 times [2022-12-13 00:51:18,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:51:18,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998975518] [2022-12-13 00:51:18,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:51:18,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:51:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:51:19,731 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 00:51:19,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:51:19,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998975518] [2022-12-13 00:51:19,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998975518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:51:19,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:51:19,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:51:19,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292207243] [2022-12-13 00:51:19,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:51:19,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:51:19,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:51:19,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:51:19,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:51:19,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 00:51:19,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 450 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 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 00:51:19,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:51:19,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 00:51:19,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:51:20,232 INFO L130 PetriNetUnfolder]: 502/963 cut-off events. [2022-12-13 00:51:20,232 INFO L131 PetriNetUnfolder]: For 2797/2867 co-relation queries the response was YES. [2022-12-13 00:51:20,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4880 conditions, 963 events. 502/963 cut-off events. For 2797/2867 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 6050 event pairs, 94 based on Foata normal form. 50/730 useless extension candidates. Maximal degree in co-relation 4858. Up to 571 conditions per place. [2022-12-13 00:51:20,237 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 42 selfloop transitions, 6 changer transitions 31/86 dead transitions. [2022-12-13 00:51:20,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 875 flow [2022-12-13 00:51:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:51:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:51:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-13 00:51:20,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-13 00:51:20,239 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 450 flow. Second operand 6 states and 98 transitions. [2022-12-13 00:51:20,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 875 flow [2022-12-13 00:51:20,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 86 transitions, 567 flow, removed 30 selfloop flow, removed 13 redundant places. [2022-12-13 00:51:20,254 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 291 flow [2022-12-13 00:51:20,255 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2022-12-13 00:51:20,256 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2022-12-13 00:51:20,256 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:51:20,256 INFO L89 Accepts]: Start accepts. Operand has 48 places, 46 transitions, 291 flow [2022-12-13 00:51:20,258 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:51:20,258 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:51:20,258 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions, 291 flow [2022-12-13 00:51:20,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 46 transitions, 291 flow [2022-12-13 00:51:20,336 INFO L130 PetriNetUnfolder]: 205/476 cut-off events. [2022-12-13 00:51:20,336 INFO L131 PetriNetUnfolder]: For 306/333 co-relation queries the response was YES. [2022-12-13 00:51:20,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 476 events. 205/476 cut-off events. For 306/333 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 3263 event pairs, 11 based on Foata normal form. 18/204 useless extension candidates. Maximal degree in co-relation 1313. Up to 270 conditions per place. [2022-12-13 00:51:20,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 46 transitions, 291 flow [2022-12-13 00:51:20,339 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 00:51:20,340 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:51:20,341 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-13 00:51:20,341 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 291 flow [2022-12-13 00:51:20,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 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 00:51:20,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:51:20,342 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:51:20,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:51:20,342 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:51:20,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:51:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2104382293, now seen corresponding path program 1 times [2022-12-13 00:51:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:51:20,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725974520] [2022-12-13 00:51:20,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:51:20,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:51:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:51:21,635 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 00:51:21,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:51:21,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725974520] [2022-12-13 00:51:21,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725974520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:51:21,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:51:21,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:51:21,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533972177] [2022-12-13 00:51:21,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:51:21,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:51:21,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:51:21,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:51:21,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:51:21,637 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2022-12-13 00:51:21,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 00:51:21,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:51:21,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2022-12-13 00:51:21,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:51:22,198 INFO L130 PetriNetUnfolder]: 449/871 cut-off events. [2022-12-13 00:51:22,199 INFO L131 PetriNetUnfolder]: For 1093/1137 co-relation queries the response was YES. [2022-12-13 00:51:22,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3065 conditions, 871 events. 449/871 cut-off events. For 1093/1137 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 5362 event pairs, 16 based on Foata normal form. 55/658 useless extension candidates. Maximal degree in co-relation 3047. Up to 410 conditions per place. [2022-12-13 00:51:22,203 INFO L137 encePairwiseOnDemand]: 18/32 looper letters, 49 selfloop transitions, 4 changer transitions 35/95 dead transitions. [2022-12-13 00:51:22,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 95 transitions, 681 flow [2022-12-13 00:51:22,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:51:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:51:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-12-13 00:51:22,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4330357142857143 [2022-12-13 00:51:22,206 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 291 flow. Second operand 7 states and 97 transitions. [2022-12-13 00:51:22,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 95 transitions, 681 flow [2022-12-13 00:51:22,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 95 transitions, 644 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-13 00:51:22,215 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 266 flow [2022-12-13 00:51:22,215 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=266, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2022-12-13 00:51:22,217 INFO L295 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2022-12-13 00:51:22,217 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:51:22,217 INFO L89 Accepts]: Start accepts. Operand has 48 places, 42 transitions, 266 flow [2022-12-13 00:51:22,218 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:51:22,218 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:51:22,219 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 42 transitions, 266 flow [2022-12-13 00:51:22,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 266 flow [2022-12-13 00:51:22,288 INFO L130 PetriNetUnfolder]: 103/211 cut-off events. [2022-12-13 00:51:22,288 INFO L131 PetriNetUnfolder]: For 220/238 co-relation queries the response was YES. [2022-12-13 00:51:22,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 211 events. 103/211 cut-off events. For 220/238 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1109 event pairs, 3 based on Foata normal form. 2/72 useless extension candidates. Maximal degree in co-relation 740. Up to 97 conditions per place. [2022-12-13 00:51:22,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 266 flow [2022-12-13 00:51:22,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-13 00:51:22,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:51:22,321 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 00:51:22,321 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 268 flow [2022-12-13 00:51:22,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 00:51:22,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:51:22,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:51:22,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:51:22,321 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 00:51:22,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:51:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash 789551341, now seen corresponding path program 1 times [2022-12-13 00:51:22,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:51:22,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037641002] [2022-12-13 00:51:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:51:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:51:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:51:22,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:51:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:51:22,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:51:22,578 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:51:22,579 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 00:51:22,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 00:51:22,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 00:51:22,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 00:51:22,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:51:22,582 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:51:22,588 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:51:22,588 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:51:22,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:51:22 BasicIcfg [2022-12-13 00:51:22,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:51:22,708 INFO L158 Benchmark]: Toolchain (without parser) took 44963.88ms. Allocated memory was 172.0MB in the beginning and 1.2GB in the end (delta: 992.0MB). Free memory was 146.7MB in the beginning and 448.4MB in the end (delta: -301.7MB). Peak memory consumption was 691.3MB. Max. memory is 8.0GB. [2022-12-13 00:51:22,708 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:51:22,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.94ms. Allocated memory is still 172.0MB. Free memory was 146.7MB in the beginning and 117.2MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 00:51:22,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.60ms. Allocated memory is still 172.0MB. Free memory was 117.2MB in the beginning and 114.2MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:51:22,709 INFO L158 Benchmark]: Boogie Preprocessor took 31.31ms. Allocated memory is still 172.0MB. Free memory was 114.2MB in the beginning and 112.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:51:22,709 INFO L158 Benchmark]: RCFGBuilder took 774.67ms. Allocated memory is still 172.0MB. Free memory was 111.6MB in the beginning and 101.8MB in the end (delta: 9.8MB). Peak memory consumption was 52.3MB. Max. memory is 8.0GB. [2022-12-13 00:51:22,710 INFO L158 Benchmark]: TraceAbstraction took 43647.15ms. Allocated memory was 172.0MB in the beginning and 1.2GB in the end (delta: 992.0MB). Free memory was 100.7MB in the beginning and 448.4MB in the end (delta: -347.7MB). Peak memory consumption was 644.3MB. Max. memory is 8.0GB. [2022-12-13 00:51:22,711 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.13ms. Allocated memory is still 172.0MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 461.94ms. Allocated memory is still 172.0MB. Free memory was 146.7MB in the beginning and 117.2MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.60ms. Allocated memory is still 172.0MB. Free memory was 117.2MB in the beginning and 114.2MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.31ms. Allocated memory is still 172.0MB. Free memory was 114.2MB in the beginning and 112.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 774.67ms. Allocated memory is still 172.0MB. Free memory was 111.6MB in the beginning and 101.8MB in the end (delta: 9.8MB). Peak memory consumption was 52.3MB. Max. memory is 8.0GB. * TraceAbstraction took 43647.15ms. Allocated memory was 172.0MB in the beginning and 1.2GB in the end (delta: 992.0MB). Free memory was 100.7MB in the beginning and 448.4MB in the end (delta: -347.7MB). Peak memory consumption was 644.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 118 PlacesBefore, 39 PlacesAfterwards, 109 TransitionsBefore, 30 TransitionsAfterwards, 1212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 90 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1019, independent: 955, independent conditional: 955, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1019, independent: 955, independent conditional: 0, independent unconditional: 955, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1019, independent: 955, independent conditional: 0, independent unconditional: 955, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1019, independent: 955, independent conditional: 0, independent unconditional: 955, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 847, independent: 800, independent conditional: 0, independent unconditional: 800, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 847, independent: 779, independent conditional: 0, independent unconditional: 779, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 491, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 469, dependent conditional: 0, dependent unconditional: 469, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1019, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 847, unknown conditional: 0, unknown unconditional: 847] , Statistics on independence cache: Total cache size (in pairs): 1246, Positive cache size: 1199, Positive conditional cache size: 0, Positive unconditional cache size: 1199, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, independent: 129, independent conditional: 129, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 161, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 161, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 161, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 143, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 143, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 198, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 161, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 143, unknown conditional: 0, unknown unconditional: 143] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 157, independent: 128, independent conditional: 128, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 157, independent: 128, independent conditional: 15, independent unconditional: 113, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 157, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 157, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 157, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 137, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 137, independent: 109, independent conditional: 21, independent unconditional: 88, dependent: 28, dependent conditional: 1, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 137, independent: 109, independent conditional: 7, independent unconditional: 102, dependent: 28, dependent conditional: 1, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 137, independent: 109, independent conditional: 7, independent unconditional: 102, dependent: 28, dependent conditional: 1, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 137, independent: 107, independent conditional: 7, independent unconditional: 100, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 25, Negative conditional cache size: 1, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 28, independent conditional: 11, independent unconditional: 17, dependent: 29, dependent conditional: 4, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 26, Negative conditional cache size: 1, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 564 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 105, independent: 67, independent conditional: 44, independent unconditional: 23, dependent: 38, dependent conditional: 4, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 109, independent: 67, independent conditional: 30, independent unconditional: 37, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 109, independent: 67, independent conditional: 30, independent unconditional: 37, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, independent: 64, independent conditional: 27, independent unconditional: 37, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 124, Positive conditional cache size: 3, Positive unconditional cache size: 121, Negative cache size: 27, Negative conditional cache size: 1, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 123, independent: 83, independent conditional: 83, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 123, independent: 83, independent conditional: 58, independent unconditional: 25, dependent: 40, dependent conditional: 4, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 123, independent: 83, independent conditional: 24, independent unconditional: 59, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 123, independent: 83, independent conditional: 24, independent unconditional: 59, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 3, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 123, independent: 75, independent conditional: 21, independent unconditional: 54, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 132, Positive conditional cache size: 6, Positive unconditional cache size: 126, Negative cache size: 27, Negative conditional cache size: 1, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 708 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 68, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 64, independent conditional: 24, independent unconditional: 40, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68, independent: 64, independent conditional: 24, independent unconditional: 40, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 17, independent conditional: 6, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 47, independent conditional: 18, independent unconditional: 29, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 18, unknown conditional: 6, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 149, Positive conditional cache size: 12, Positive unconditional cache size: 137, Negative cache size: 28, Negative conditional cache size: 1, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 55 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 72, independent conditional: 32, independent unconditional: 40, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 72, independent conditional: 32, independent unconditional: 40, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 72, independent conditional: 32, independent unconditional: 40, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 149, Positive conditional cache size: 12, Positive unconditional cache size: 137, Negative cache size: 28, Negative conditional cache size: 1, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.6s, 58 PlacesBefore, 53 PlacesAfterwards, 53 TransitionsBefore, 48 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 54, independent conditional: 51, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 54, independent conditional: 33, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 54, independent conditional: 33, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 15, independent unconditional: 7, 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: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 54, independent: 32, independent conditional: 18, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 15, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 199, Positive conditional cache size: 29, Positive unconditional cache size: 170, Negative cache size: 28, Negative conditional cache size: 1, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 199, Positive conditional cache size: 29, Positive unconditional cache size: 170, Negative cache size: 28, Negative conditional cache size: 1, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 212, Positive conditional cache size: 30, Positive unconditional cache size: 182, Negative cache size: 28, Negative conditional cache size: 1, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L853] 0 pthread_t t2124; [L854] FCALL, FORK 0 pthread_create(&t2124, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2124, ((void *)0), P0, ((void *)0))=-2, t2124={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t2125; [L856] FCALL, FORK 0 pthread_create(&t2125, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2125, ((void *)0), P1, ((void *)0))=-1, t2124={6:0}, t2125={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L857] 0 pthread_t t2126; [L858] FCALL, FORK 0 pthread_create(&t2126, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2126, ((void *)0), P2, ((void *)0))=0, t2124={6:0}, t2125={7:0}, t2126={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L814] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L814] EXPR 3 \read(x) [L814] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L814] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L815] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L816] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L817] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L818] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L819] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L820] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L821] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L822] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L823] EXPR 3 \read(x) [L823] 3 __unbuffered_p2_EAX = x [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] EXPR 3 \read(x) [L824] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L824] 3 x = x$flush_delayed ? x$mem_tmp : x [L825] 3 x$flush_delayed = (_Bool)0 [L828] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 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) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 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 [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 y = 2 [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L792] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 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) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 2 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 2 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 2 !(!cond) [L862] RET 2 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 2 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 2 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 2 \read(x) [L864] EXPR 2 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 2 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 2 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 2 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 [L867] 2 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 2 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 [L871] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 2 x$flush_delayed = weak$$choice2 [L874] EXPR 2 \read(x) [L874] 2 x$mem_tmp = x [L875] EXPR 2 !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) [L875] EXPR 2 \read(x) [L875] EXPR 2 !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) [L875] 2 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) [L876] 2 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)) [L877] 2 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)) [L878] 2 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)) [L879] 2 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)) [L880] 2 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)) [L881] 2 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)) [L882] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L883] EXPR 2 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 2 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 2 \read(*__unbuffered_p2_EAX$read_delayed_var) [L883] EXPR 2 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L883] EXPR 2 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] 2 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L884] EXPR 2 \read(x) [L884] 2 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L885] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L885] 2 x = x$flush_delayed ? x$mem_tmp : x [L886] 2 x$flush_delayed = (_Bool)0 [L888] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 4 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: 43.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 389 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 851 IncrementalHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 4 mSDtfsCounter, 851 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=9, InterpolantAutomatonStates: 48, 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.6s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 1844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:51:22,759 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...