/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:24:41,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:24:41,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:24:41,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:24:41,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:24:41,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:24:41,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:24:41,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:24:41,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:24:41,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:24:41,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:24:41,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:24:41,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:24:41,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:24:41,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:24:41,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:24:41,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:24:41,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:24:41,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:24:41,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:24:41,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:24:41,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:24:41,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:24:41,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:24:41,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:24:41,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:24:41,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:24:41,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:24:41,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:24:41,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:24:41,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:24:41,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:24:41,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:24:41,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:24:41,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:24:41,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:24:41,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:24:41,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:24:41,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:24:41,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:24:41,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:24:41,915 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:24:41,938 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:24:41,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:24:41,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:24:41,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:24:41,942 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:24:41,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:24:41,943 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:24:41,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:24:41,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:24:41,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:24:41,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:24:41,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:24:41,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:24:41,944 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:24:41,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:24:41,945 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:24:41,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:24:41,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:24:41,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:24:41,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:24:41,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:24:41,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:24:41,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:24:41,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:24:41,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:24:41,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:24:41,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:24:41,947 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:24:41,947 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:24:42,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:24:42,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:24:42,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:24:42,275 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:24:42,276 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:24:42,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036.oepc.i [2022-12-06 06:24:43,498 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:24:43,842 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:24:43,843 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036.oepc.i [2022-12-06 06:24:43,862 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fde9b254/e279d14dd39b412ca29909c6a8cc80b5/FLAG7fd4310bc [2022-12-06 06:24:43,879 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fde9b254/e279d14dd39b412ca29909c6a8cc80b5 [2022-12-06 06:24:43,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:24:43,883 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:24:43,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:24:43,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:24:43,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:24:43,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:24:43" (1/1) ... [2022-12-06 06:24:43,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d4cdb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:43, skipping insertion in model container [2022-12-06 06:24:43,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:24:43" (1/1) ... [2022-12-06 06:24:43,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:24:43,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:24:44,119 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/mix036.oepc.i[945,958] [2022-12-06 06:24:44,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:24:44,333 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:24:44,345 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/mix036.oepc.i[945,958] [2022-12-06 06:24:44,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:24:44,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:24:44,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:24:44,431 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:24:44,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:44 WrapperNode [2022-12-06 06:24:44,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:24:44,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:24:44,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:24:44,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:24:44,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:44" (1/1) ... [2022-12-06 06:24:44,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:44" (1/1) ... [2022-12-06 06:24:44,479 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-12-06 06:24:44,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:24:44,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:24:44,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:24:44,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:24:44,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:44" (1/1) ... [2022-12-06 06:24:44,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:44" (1/1) ... [2022-12-06 06:24:44,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:44" (1/1) ... [2022-12-06 06:24:44,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:44" (1/1) ... [2022-12-06 06:24:44,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:44" (1/1) ... [2022-12-06 06:24:44,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:44" (1/1) ... [2022-12-06 06:24:44,509 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:44" (1/1) ... [2022-12-06 06:24:44,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:44" (1/1) ... [2022-12-06 06:24:44,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:24:44,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:24:44,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:24:44,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:24:44,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:44" (1/1) ... [2022-12-06 06:24:44,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:24:44,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:24:44,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:24:44,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:24:44,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:24:44,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:24:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:24:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:24:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:24:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:24:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:24:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:24:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:24:44,630 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:24:44,630 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:24:44,631 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:24:44,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:24:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:24:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:24:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:24:44,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:24:44,634 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:24:44,755 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:24:44,757 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:24:45,107 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:24:45,249 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:24:45,249 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:24:45,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:24:45 BoogieIcfgContainer [2022-12-06 06:24:45,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:24:45,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:24:45,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:24:45,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:24:45,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:24:43" (1/3) ... [2022-12-06 06:24:45,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7a6064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:24:45, skipping insertion in model container [2022-12-06 06:24:45,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:24:44" (2/3) ... [2022-12-06 06:24:45,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7a6064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:24:45, skipping insertion in model container [2022-12-06 06:24:45,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:24:45" (3/3) ... [2022-12-06 06:24:45,262 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2022-12-06 06:24:45,278 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:24:45,278 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:24:45,278 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:24:45,343 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:24:45,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2022-12-06 06:24:45,472 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-12-06 06:24:45,473 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:45,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:24:45,478 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2022-12-06 06:24:45,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2022-12-06 06:24:45,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:45,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2022-12-06 06:24:45,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2022-12-06 06:24:45,553 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-12-06 06:24:45,553 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:45,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:24:45,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2022-12-06 06:24:45,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 3270 [2022-12-06 06:24:51,116 INFO L203 LiptonReduction]: Total number of compositions: 100 [2022-12-06 06:24:51,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:24:51,144 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;@46686cc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:24:51,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:24:51,148 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 06:24:51,148 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:51,148 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:51,149 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:24:51,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:24:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash 559307, now seen corresponding path program 1 times [2022-12-06 06:24:51,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:51,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181168388] [2022-12-06 06:24:51,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:51,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:24:51,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:51,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181168388] [2022-12-06 06:24:51,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181168388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:51,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:51,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:24:51,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166257236] [2022-12-06 06:24:51,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:51,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:24:51,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:51,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:24:51,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:24:51,547 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 06:24:51,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:51,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:51,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 06:24:51,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:52,732 INFO L130 PetriNetUnfolder]: 6050/8334 cut-off events. [2022-12-06 06:24:52,732 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 06:24:52,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16733 conditions, 8334 events. 6050/8334 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 41693 event pairs, 3098 based on Foata normal form. 0/7579 useless extension candidates. Maximal degree in co-relation 16721. Up to 6574 conditions per place. [2022-12-06 06:24:52,787 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 2 changer transitions 10/57 dead transitions. [2022-12-06 06:24:52,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 241 flow [2022-12-06 06:24:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:24:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:24:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-06 06:24:52,798 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-06 06:24:52,799 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 70 transitions. [2022-12-06 06:24:52,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 241 flow [2022-12-06 06:24:52,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:24:52,806 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-06 06:24:52,807 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 06:24:52,811 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-06 06:24:52,811 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:52,812 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 68 flow [2022-12-06 06:24:52,814 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:52,814 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:52,814 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 68 flow [2022-12-06 06:24:52,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 06:24:52,821 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:24:52,821 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:52,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:24:52,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 06:24:52,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 06:24:52,921 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:24:52,923 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 06:24:52,923 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-06 06:24:52,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:52,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:52,924 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:52,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:24:52,925 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:24:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:52,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1364667957, now seen corresponding path program 1 times [2022-12-06 06:24:52,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:52,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437651295] [2022-12-06 06:24:52,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:52,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:24:53,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:53,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437651295] [2022-12-06 06:24:53,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437651295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:53,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:53,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:24:53,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182078736] [2022-12-06 06:24:53,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:53,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:24:53,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:53,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:24:53,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:24:53,156 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:24:53,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:53,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:53,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:24:53,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:53,923 INFO L130 PetriNetUnfolder]: 4279/5875 cut-off events. [2022-12-06 06:24:53,923 INFO L131 PetriNetUnfolder]: For 393/393 co-relation queries the response was YES. [2022-12-06 06:24:53,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12299 conditions, 5875 events. 4279/5875 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 27919 event pairs, 1463 based on Foata normal form. 128/5985 useless extension candidates. Maximal degree in co-relation 12289. Up to 4033 conditions per place. [2022-12-06 06:24:53,965 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 34 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-12-06 06:24:53,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 164 flow [2022-12-06 06:24:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:24:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:24:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 06:24:53,968 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2022-12-06 06:24:53,968 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 46 transitions. [2022-12-06 06:24:53,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 164 flow [2022-12-06 06:24:53,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:24:53,971 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 72 flow [2022-12-06 06:24:53,971 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-06 06:24:53,972 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2022-12-06 06:24:53,972 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:53,972 INFO L89 Accepts]: Start accepts. Operand has 40 places, 28 transitions, 72 flow [2022-12-06 06:24:53,973 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:53,973 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:53,973 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 72 flow [2022-12-06 06:24:53,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2022-12-06 06:24:53,979 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:24:53,979 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:24:53,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:24:53,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 72 flow [2022-12-06 06:24:53,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-06 06:24:54,065 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:24:54,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-06 06:24:54,068 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2022-12-06 06:24:54,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:54,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:54,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:54,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:24:54,076 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:24:54,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:54,077 INFO L85 PathProgramCache]: Analyzing trace with hash 645000162, now seen corresponding path program 1 times [2022-12-06 06:24:54,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:54,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030842556] [2022-12-06 06:24:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:54,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:24:54,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:54,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030842556] [2022-12-06 06:24:54,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030842556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:54,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:54,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:24:54,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436162588] [2022-12-06 06:24:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:54,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:24:54,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:54,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:24:54,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:24:54,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:24:54,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:54,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:54,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:24:54,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:54,912 INFO L130 PetriNetUnfolder]: 3295/4719 cut-off events. [2022-12-06 06:24:54,913 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2022-12-06 06:24:54,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10176 conditions, 4719 events. 3295/4719 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24349 event pairs, 623 based on Foata normal form. 320/5026 useless extension candidates. Maximal degree in co-relation 10165. Up to 3107 conditions per place. [2022-12-06 06:24:54,945 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 38 selfloop transitions, 5 changer transitions 27/73 dead transitions. [2022-12-06 06:24:54,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 73 transitions, 317 flow [2022-12-06 06:24:54,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:24:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:24:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 06:24:54,948 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2022-12-06 06:24:54,948 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 5 states and 87 transitions. [2022-12-06 06:24:54,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 73 transitions, 317 flow [2022-12-06 06:24:54,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 73 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:24:54,952 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 111 flow [2022-12-06 06:24:54,953 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2022-12-06 06:24:54,955 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-06 06:24:54,955 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:54,955 INFO L89 Accepts]: Start accepts. Operand has 44 places, 31 transitions, 111 flow [2022-12-06 06:24:54,956 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:54,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:54,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 111 flow [2022-12-06 06:24:54,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 111 flow [2022-12-06 06:24:54,971 INFO L130 PetriNetUnfolder]: 73/153 cut-off events. [2022-12-06 06:24:54,971 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2022-12-06 06:24:54,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 153 events. 73/153 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 578 event pairs, 40 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 394. Up to 104 conditions per place. [2022-12-06 06:24:54,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 111 flow [2022-12-06 06:24:54,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 06:24:54,983 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:24:54,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 06:24:54,984 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 111 flow [2022-12-06 06:24:54,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:54,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:54,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:54,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:24:54,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:24:54,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:54,986 INFO L85 PathProgramCache]: Analyzing trace with hash -774792068, now seen corresponding path program 1 times [2022-12-06 06:24:54,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:54,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651787965] [2022-12-06 06:24:54,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:54,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:24:55,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:55,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651787965] [2022-12-06 06:24:55,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651787965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:55,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:55,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:24:55,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973769033] [2022-12-06 06:24:55,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:55,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:24:55,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:55,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:24:55,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:24:55,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:24:55,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-06 06:24:55,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:55,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:24:55,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:55,720 INFO L130 PetriNetUnfolder]: 1864/2802 cut-off events. [2022-12-06 06:24:55,721 INFO L131 PetriNetUnfolder]: For 941/941 co-relation queries the response was YES. [2022-12-06 06:24:55,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7746 conditions, 2802 events. 1864/2802 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14096 event pairs, 372 based on Foata normal form. 212/3001 useless extension candidates. Maximal degree in co-relation 7732. Up to 965 conditions per place. [2022-12-06 06:24:55,735 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 51 selfloop transitions, 9 changer transitions 27/90 dead transitions. [2022-12-06 06:24:55,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 90 transitions, 467 flow [2022-12-06 06:24:55,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:24:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:24:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-06 06:24:55,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2022-12-06 06:24:55,737 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 111 flow. Second operand 6 states and 107 transitions. [2022-12-06 06:24:55,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 90 transitions, 467 flow [2022-12-06 06:24:55,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 90 transitions, 460 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:24:55,747 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 176 flow [2022-12-06 06:24:55,747 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2022-12-06 06:24:55,747 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2022-12-06 06:24:55,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:55,748 INFO L89 Accepts]: Start accepts. Operand has 48 places, 35 transitions, 176 flow [2022-12-06 06:24:55,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:55,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:55,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 35 transitions, 176 flow [2022-12-06 06:24:55,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 176 flow [2022-12-06 06:24:55,762 INFO L130 PetriNetUnfolder]: 49/117 cut-off events. [2022-12-06 06:24:55,762 INFO L131 PetriNetUnfolder]: For 207/222 co-relation queries the response was YES. [2022-12-06 06:24:55,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 117 events. 49/117 cut-off events. For 207/222 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 380 event pairs, 13 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 436. Up to 76 conditions per place. [2022-12-06 06:24:55,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 176 flow [2022-12-06 06:24:55,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-06 06:24:55,844 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:24:55,845 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 06:24:55,845 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 176 flow [2022-12-06 06:24:55,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-06 06:24:55,845 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:55,845 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:55,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:24:55,846 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:24:55,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:55,846 INFO L85 PathProgramCache]: Analyzing trace with hash -122214773, now seen corresponding path program 1 times [2022-12-06 06:24:55,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:55,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339865205] [2022-12-06 06:24:55,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:55,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:24:56,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:56,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339865205] [2022-12-06 06:24:56,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339865205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:56,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:56,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:24:56,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174805310] [2022-12-06 06:24:56,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:56,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:24:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:56,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:24:56,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:24:56,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:24:56,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:56,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:56,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:24:56,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:57,016 INFO L130 PetriNetUnfolder]: 2576/4091 cut-off events. [2022-12-06 06:24:57,016 INFO L131 PetriNetUnfolder]: For 5830/5830 co-relation queries the response was YES. [2022-12-06 06:24:57,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13378 conditions, 4091 events. 2576/4091 cut-off events. For 5830/5830 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 23444 event pairs, 749 based on Foata normal form. 41/4125 useless extension candidates. Maximal degree in co-relation 13361. Up to 2090 conditions per place. [2022-12-06 06:24:57,044 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 77 selfloop transitions, 13 changer transitions 31/124 dead transitions. [2022-12-06 06:24:57,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 124 transitions, 934 flow [2022-12-06 06:24:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:24:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:24:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-06 06:24:57,045 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-06 06:24:57,045 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 176 flow. Second operand 6 states and 105 transitions. [2022-12-06 06:24:57,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 124 transitions, 934 flow [2022-12-06 06:24:57,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 124 transitions, 768 flow, removed 64 selfloop flow, removed 4 redundant places. [2022-12-06 06:24:57,115 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 218 flow [2022-12-06 06:24:57,115 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2022-12-06 06:24:57,118 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2022-12-06 06:24:57,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:57,118 INFO L89 Accepts]: Start accepts. Operand has 50 places, 47 transitions, 218 flow [2022-12-06 06:24:57,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:57,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:57,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 47 transitions, 218 flow [2022-12-06 06:24:57,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 218 flow [2022-12-06 06:24:57,195 INFO L130 PetriNetUnfolder]: 355/760 cut-off events. [2022-12-06 06:24:57,196 INFO L131 PetriNetUnfolder]: For 860/1042 co-relation queries the response was YES. [2022-12-06 06:24:57,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2235 conditions, 760 events. 355/760 cut-off events. For 860/1042 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4622 event pairs, 97 based on Foata normal form. 24/734 useless extension candidates. Maximal degree in co-relation 2221. Up to 382 conditions per place. [2022-12-06 06:24:57,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 47 transitions, 218 flow [2022-12-06 06:24:57,205 INFO L188 LiptonReduction]: Number of co-enabled transitions 814 [2022-12-06 06:24:57,572 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:24:57,573 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 455 [2022-12-06 06:24:57,573 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 214 flow [2022-12-06 06:24:57,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:57,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:57,573 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:57,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:24:57,574 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:24:57,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:57,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1778964583, now seen corresponding path program 2 times [2022-12-06 06:24:57,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:57,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499082771] [2022-12-06 06:24:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:57,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:24:57,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:57,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499082771] [2022-12-06 06:24:57,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499082771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:57,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:57,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:24:57,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001164275] [2022-12-06 06:24:57,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:57,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:24:57,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:57,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:24:57,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:24:57,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:24:57,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:57,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:57,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:24:57,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:58,383 INFO L130 PetriNetUnfolder]: 1960/3098 cut-off events. [2022-12-06 06:24:58,383 INFO L131 PetriNetUnfolder]: For 3050/3050 co-relation queries the response was YES. [2022-12-06 06:24:58,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10151 conditions, 3098 events. 1960/3098 cut-off events. For 3050/3050 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 16743 event pairs, 334 based on Foata normal form. 143/3226 useless extension candidates. Maximal degree in co-relation 10134. Up to 1056 conditions per place. [2022-12-06 06:24:58,400 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 92 selfloop transitions, 13 changer transitions 45/153 dead transitions. [2022-12-06 06:24:58,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 153 transitions, 992 flow [2022-12-06 06:24:58,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:24:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:24:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2022-12-06 06:24:58,402 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6683673469387755 [2022-12-06 06:24:58,402 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 214 flow. Second operand 7 states and 131 transitions. [2022-12-06 06:24:58,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 153 transitions, 992 flow [2022-12-06 06:24:58,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 153 transitions, 976 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 06:24:58,416 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 299 flow [2022-12-06 06:24:58,417 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=299, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2022-12-06 06:24:58,417 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2022-12-06 06:24:58,417 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:58,417 INFO L89 Accepts]: Start accepts. Operand has 57 places, 49 transitions, 299 flow [2022-12-06 06:24:58,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:58,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:58,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 49 transitions, 299 flow [2022-12-06 06:24:58,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 49 transitions, 299 flow [2022-12-06 06:24:58,457 INFO L130 PetriNetUnfolder]: 170/397 cut-off events. [2022-12-06 06:24:58,457 INFO L131 PetriNetUnfolder]: For 1200/1403 co-relation queries the response was YES. [2022-12-06 06:24:58,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 397 events. 170/397 cut-off events. For 1200/1403 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2025 event pairs, 34 based on Foata normal form. 30/401 useless extension candidates. Maximal degree in co-relation 1352. Up to 176 conditions per place. [2022-12-06 06:24:58,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 49 transitions, 299 flow [2022-12-06 06:24:58,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 726 [2022-12-06 06:24:58,590 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:24:58,590 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 06:24:58,591 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 305 flow [2022-12-06 06:24:58,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:24:58,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:24:58,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:24:58,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:24:58,591 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:24:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:24:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1939166788, now seen corresponding path program 1 times [2022-12-06 06:24:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:24:58,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574015603] [2022-12-06 06:24:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:24:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:24:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:24:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:24:58,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:24:58,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574015603] [2022-12-06 06:24:58,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574015603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:24:58,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:24:58,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:24:58,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868279507] [2022-12-06 06:24:58,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:24:58,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:24:58,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:24:58,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:24:58,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:24:58,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:24:58,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 305 flow. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-06 06:24:58,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:24:58,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:24:58,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:24:59,637 INFO L130 PetriNetUnfolder]: 4583/6848 cut-off events. [2022-12-06 06:24:59,637 INFO L131 PetriNetUnfolder]: For 9765/9765 co-relation queries the response was YES. [2022-12-06 06:24:59,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22941 conditions, 6848 events. 4583/6848 cut-off events. For 9765/9765 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 36870 event pairs, 467 based on Foata normal form. 16/6864 useless extension candidates. Maximal degree in co-relation 22921. Up to 3901 conditions per place. [2022-12-06 06:24:59,674 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 120 selfloop transitions, 12 changer transitions 4/136 dead transitions. [2022-12-06 06:24:59,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 136 transitions, 1073 flow [2022-12-06 06:24:59,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:24:59,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:24:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-06 06:24:59,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2022-12-06 06:24:59,677 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 305 flow. Second operand 5 states and 82 transitions. [2022-12-06 06:24:59,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 136 transitions, 1073 flow [2022-12-06 06:24:59,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 136 transitions, 913 flow, removed 57 selfloop flow, removed 5 redundant places. [2022-12-06 06:24:59,773 INFO L231 Difference]: Finished difference. Result has 55 places, 59 transitions, 333 flow [2022-12-06 06:24:59,773 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=55, PETRI_TRANSITIONS=59} [2022-12-06 06:24:59,773 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2022-12-06 06:24:59,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:24:59,774 INFO L89 Accepts]: Start accepts. Operand has 55 places, 59 transitions, 333 flow [2022-12-06 06:24:59,776 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:24:59,776 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:24:59,776 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 59 transitions, 333 flow [2022-12-06 06:24:59,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 59 transitions, 333 flow [2022-12-06 06:24:59,919 INFO L130 PetriNetUnfolder]: 580/1312 cut-off events. [2022-12-06 06:24:59,919 INFO L131 PetriNetUnfolder]: For 1694/1915 co-relation queries the response was YES. [2022-12-06 06:24:59,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3717 conditions, 1312 events. 580/1312 cut-off events. For 1694/1915 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9212 event pairs, 79 based on Foata normal form. 102/1335 useless extension candidates. Maximal degree in co-relation 3699. Up to 366 conditions per place. [2022-12-06 06:24:59,937 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 59 transitions, 333 flow [2022-12-06 06:24:59,937 INFO L188 LiptonReduction]: Number of co-enabled transitions 924 [2022-12-06 06:25:00,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L833-->L849: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd4~0_58 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_140 256) 0)) (.cse5 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse9)) (.cse6 (and .cse4 .cse9))) (let ((.cse7 (or .cse11 .cse5 .cse6)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse1 (= (mod v_~b$w_buff0_used~0_139 256) 0))) (and (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse3 (= (mod v_~b$r_buff0_thd4~0_57 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3))) v_~b$r_buff1_thd4~0_56 0))) (= v_~b$flush_delayed~0_23 0) (= v_~b~0_98 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_14)) (= v_~b$mem_tmp~0_16 v_~b~0_99) (= v_~b$w_buff1_used~0_126 (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse5 .cse6) v_~b$w_buff1_used~0_127 0))) (= (ite .cse7 v_~b~0_99 (ite .cse8 v_~b$w_buff0~0_63 v_~b$w_buff1~0_54)) v_~__unbuffered_p3_EBX~0_14) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~b$w_buff0~0_63 v_~b$w_buff0~0_62) (= v_~b$w_buff0_used~0_139 (ite .cse0 v_~b$w_buff0_used~0_140 (ite .cse7 v_~b$w_buff0_used~0_140 (ite .cse8 0 v_~b$w_buff0_used~0_140)))) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse0 v_~b$r_buff0_thd4~0_58 (ite (or .cse1 (and .cse2 .cse9) .cse6) v_~b$r_buff0_thd4~0_58 (ite (and .cse10 (not .cse1)) 0 v_~b$r_buff0_thd4~0_58))) v_~b$r_buff0_thd4~0_57) (= v_~b$w_buff1~0_54 v_~b$w_buff1~0_53))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_140, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~b~0=v_~b~0_99, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_54, ~b$w_buff0~0=v_~b$w_buff0~0_63, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_58, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_139, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_98, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_53, ~b$w_buff0~0=v_~b$w_buff0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_57} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3] and [386] L767-->L770: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-06 06:25:00,226 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L767: Formula: (and (= v_~b$r_buff1_thd2~0_69 v_~b$r_buff0_thd2~0_65) (= v_~b$r_buff1_thd3~0_65 v_~b$r_buff0_thd3~0_63) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~b$w_buff0~0_176 1) (= v_~b$w_buff0_used~0_320 1) (= v_~b$r_buff0_thd4~0_125 v_~b$r_buff1_thd4~0_128) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~b$r_buff1_thd1~0_95 v_~b$r_buff0_thd1~0_101) (= v_~b$w_buff1~0_150 v_~b$w_buff0~0_177) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_290 256) 0)) (not (= (mod v_~b$w_buff0_used~0_320 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$r_buff0_thd1~0_100 1) (= v_~b$r_buff1_thd0~0_89 v_~b$r_buff0_thd0~0_82) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$w_buff0_used~0_321 v_~b$w_buff1_used~0_290)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_321, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~b$w_buff0~0=v_~b$w_buff0~0_177, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_95, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_89, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_320, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_290, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_128, ~b$w_buff1~0=v_~b$w_buff1~0_150, ~b$w_buff0~0=v_~b$w_buff0~0_176, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_65, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [543] L833-->L770: Formula: (let ((.cse3 (= (mod v_~b$r_buff1_thd4~0_238 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd4~0_228 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and .cse9 (= (mod v_~b$w_buff1_used~0_475 256) 0))) (.cse8 (and .cse3 .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_545 256) 0))) (let ((.cse5 (or .cse7 .cse8 .cse11)) (.cse6 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_72 256) 0))) (.cse1 (= (mod v_~b$w_buff1_used~0_474 256) 0)) (.cse4 (= (mod v_~b$w_buff0_used~0_544 256) 0))) (and (= v_~b~0_405 (ite .cse0 v_~b$mem_tmp~0_56 v_~__unbuffered_p3_EBX~0_105)) (= v_~b$w_buff0~0_325 v_~b$w_buff0~0_324) (= v_~b$r_buff1_thd4~0_237 (ite .cse0 v_~b$r_buff1_thd4~0_238 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_227 256) 0))) (or (and .cse1 .cse2) (and .cse2 .cse3) .cse4)) v_~b$r_buff1_thd4~0_238 0))) (= (ite .cse5 v_~b~0_406 (ite .cse6 v_~b$w_buff0~0_325 v_~b$w_buff1~0_269)) v_~__unbuffered_p3_EBX~0_105) (= (ite .cse0 v_~b$w_buff1_used~0_475 (ite (or .cse7 .cse4 .cse8) v_~b$w_buff1_used~0_475 0)) v_~b$w_buff1_used~0_474) (= (ite .cse0 v_~b$w_buff0_used~0_545 (ite .cse5 v_~b$w_buff0_used~0_545 (ite .cse6 0 v_~b$w_buff0_used~0_545))) v_~b$w_buff0_used~0_544) (= |v_P3Thread1of1ForFork2_#t~nondet3_62| v_~weak$$choice0~0_45) (= |v_P3Thread1of1ForFork2_#t~nondet4_62| v_~weak$$choice2~0_72) (= v_~b$flush_delayed~0_65 0) (= v_~b$w_buff1~0_269 v_~b$w_buff1~0_268) (= v_~b$r_buff0_thd4~0_227 (ite .cse0 v_~b$r_buff0_thd4~0_228 (ite (or .cse4 .cse8 (and .cse1 .cse9)) v_~b$r_buff0_thd4~0_228 (ite (and .cse10 (not .cse4)) 0 v_~b$r_buff0_thd4~0_228)))) (= v_~x~0_46 v_~__unbuffered_p0_EAX~0_87) (= v_~b$mem_tmp~0_56 v_~b~0_406))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_545, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_62|, ~b~0=v_~b~0_406, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_475, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_238, ~b$w_buff1~0=v_~b$w_buff1~0_269, ~b$w_buff0~0=v_~b$w_buff0~0_325, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_228, ~x~0=v_~x~0_46, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_62|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_56, ~b$flush_delayed~0=v_~b$flush_delayed~0_65, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_105, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_544, ~weak$$choice0~0=v_~weak$$choice0~0_45, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_87, ~b~0=v_~b~0_405, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_474, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_237, ~b$w_buff1~0=v_~b$w_buff1~0_268, ~b$w_buff0~0=v_~b$w_buff0~0_324, ~weak$$choice2~0=v_~weak$$choice2~0_72, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_227, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3] [2022-12-06 06:25:00,552 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:25:00,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 781 [2022-12-06 06:25:00,554 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 59 transitions, 339 flow [2022-12-06 06:25:00,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 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-06 06:25:00,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:00,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:00,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:25:00,555 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:00,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash -438149409, now seen corresponding path program 1 times [2022-12-06 06:25:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:00,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538243944] [2022-12-06 06:25:00,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:00,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:01,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-06 06:25:01,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:01,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538243944] [2022-12-06 06:25:01,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538243944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:01,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:01,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:25:01,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273832034] [2022-12-06 06:25:01,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:01,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:25:01,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:01,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:25:01,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:25:01,213 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 06:25:01,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 59 transitions, 339 flow. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 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-06 06:25:01,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:01,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 06:25:01,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:02,014 INFO L130 PetriNetUnfolder]: 3870/6281 cut-off events. [2022-12-06 06:25:02,015 INFO L131 PetriNetUnfolder]: For 7784/8026 co-relation queries the response was YES. [2022-12-06 06:25:02,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21971 conditions, 6281 events. 3870/6281 cut-off events. For 7784/8026 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 40181 event pairs, 737 based on Foata normal form. 173/6397 useless extension candidates. Maximal degree in co-relation 21950. Up to 2813 conditions per place. [2022-12-06 06:25:02,055 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 90 selfloop transitions, 20 changer transitions 37/154 dead transitions. [2022-12-06 06:25:02,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 154 transitions, 1145 flow [2022-12-06 06:25:02,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:25:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:25:02,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-12-06 06:25:02,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2022-12-06 06:25:02,056 INFO L175 Difference]: Start difference. First operand has 55 places, 59 transitions, 339 flow. Second operand 7 states and 104 transitions. [2022-12-06 06:25:02,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 154 transitions, 1145 flow [2022-12-06 06:25:02,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 154 transitions, 1143 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 06:25:02,178 INFO L231 Difference]: Finished difference. Result has 64 places, 67 transitions, 450 flow [2022-12-06 06:25:02,179 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=450, PETRI_PLACES=64, PETRI_TRANSITIONS=67} [2022-12-06 06:25:02,180 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2022-12-06 06:25:02,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:02,181 INFO L89 Accepts]: Start accepts. Operand has 64 places, 67 transitions, 450 flow [2022-12-06 06:25:02,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:02,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:02,185 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 67 transitions, 450 flow [2022-12-06 06:25:02,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 67 transitions, 450 flow [2022-12-06 06:25:02,339 INFO L130 PetriNetUnfolder]: 704/1619 cut-off events. [2022-12-06 06:25:02,339 INFO L131 PetriNetUnfolder]: For 2879/3261 co-relation queries the response was YES. [2022-12-06 06:25:02,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5310 conditions, 1619 events. 704/1619 cut-off events. For 2879/3261 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12122 event pairs, 76 based on Foata normal form. 149/1687 useless extension candidates. Maximal degree in co-relation 5287. Up to 486 conditions per place. [2022-12-06 06:25:02,363 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 67 transitions, 450 flow [2022-12-06 06:25:02,363 INFO L188 LiptonReduction]: Number of co-enabled transitions 1060 [2022-12-06 06:25:02,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L833-->L849: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd4~0_58 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_140 256) 0)) (.cse5 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse9)) (.cse6 (and .cse4 .cse9))) (let ((.cse7 (or .cse11 .cse5 .cse6)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse1 (= (mod v_~b$w_buff0_used~0_139 256) 0))) (and (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse3 (= (mod v_~b$r_buff0_thd4~0_57 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3))) v_~b$r_buff1_thd4~0_56 0))) (= v_~b$flush_delayed~0_23 0) (= v_~b~0_98 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_14)) (= v_~b$mem_tmp~0_16 v_~b~0_99) (= v_~b$w_buff1_used~0_126 (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse5 .cse6) v_~b$w_buff1_used~0_127 0))) (= (ite .cse7 v_~b~0_99 (ite .cse8 v_~b$w_buff0~0_63 v_~b$w_buff1~0_54)) v_~__unbuffered_p3_EBX~0_14) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~b$w_buff0~0_63 v_~b$w_buff0~0_62) (= v_~b$w_buff0_used~0_139 (ite .cse0 v_~b$w_buff0_used~0_140 (ite .cse7 v_~b$w_buff0_used~0_140 (ite .cse8 0 v_~b$w_buff0_used~0_140)))) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse0 v_~b$r_buff0_thd4~0_58 (ite (or .cse1 (and .cse2 .cse9) .cse6) v_~b$r_buff0_thd4~0_58 (ite (and .cse10 (not .cse1)) 0 v_~b$r_buff0_thd4~0_58))) v_~b$r_buff0_thd4~0_57) (= v_~b$w_buff1~0_54 v_~b$w_buff1~0_53))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_140, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~b~0=v_~b~0_99, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_54, ~b$w_buff0~0=v_~b$w_buff0~0_63, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_58, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_139, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_98, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_53, ~b$w_buff0~0=v_~b$w_buff0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_57} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3] and [386] L767-->L770: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-06 06:25:02,636 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:25:02,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 455 [2022-12-06 06:25:02,637 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 67 transitions, 458 flow [2022-12-06 06:25:02,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 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-06 06:25:02,637 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:02,637 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:02,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:25:02,637 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:02,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:02,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1386528146, now seen corresponding path program 1 times [2022-12-06 06:25:02,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:02,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119699735] [2022-12-06 06:25:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:25:03,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:03,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119699735] [2022-12-06 06:25:03,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119699735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:03,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:03,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:25:03,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452132636] [2022-12-06 06:25:03,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:03,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:25:03,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:03,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:25:03,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:25:03,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-06 06:25:03,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 67 transitions, 458 flow. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 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-06 06:25:03,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:03,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-06 06:25:03,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:04,302 INFO L130 PetriNetUnfolder]: 4766/7882 cut-off events. [2022-12-06 06:25:04,303 INFO L131 PetriNetUnfolder]: For 15224/15527 co-relation queries the response was YES. [2022-12-06 06:25:04,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31099 conditions, 7882 events. 4766/7882 cut-off events. For 15224/15527 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 52897 event pairs, 699 based on Foata normal form. 225/8042 useless extension candidates. Maximal degree in co-relation 31073. Up to 3247 conditions per place. [2022-12-06 06:25:04,355 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 133 selfloop transitions, 10 changer transitions 21/171 dead transitions. [2022-12-06 06:25:04,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 171 transitions, 1382 flow [2022-12-06 06:25:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:25:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:25:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-06 06:25:04,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5967741935483871 [2022-12-06 06:25:04,357 INFO L175 Difference]: Start difference. First operand has 62 places, 67 transitions, 458 flow. Second operand 6 states and 111 transitions. [2022-12-06 06:25:04,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 171 transitions, 1382 flow [2022-12-06 06:25:04,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 171 transitions, 1369 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 06:25:04,575 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 477 flow [2022-12-06 06:25:04,576 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=477, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2022-12-06 06:25:04,576 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2022-12-06 06:25:04,576 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:04,576 INFO L89 Accepts]: Start accepts. Operand has 67 places, 67 transitions, 477 flow [2022-12-06 06:25:04,577 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:04,577 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:04,577 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 67 transitions, 477 flow [2022-12-06 06:25:04,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 67 transitions, 477 flow [2022-12-06 06:25:04,748 INFO L130 PetriNetUnfolder]: 942/2226 cut-off events. [2022-12-06 06:25:04,748 INFO L131 PetriNetUnfolder]: For 5050/5622 co-relation queries the response was YES. [2022-12-06 06:25:04,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7430 conditions, 2226 events. 942/2226 cut-off events. For 5050/5622 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 18300 event pairs, 94 based on Foata normal form. 224/2324 useless extension candidates. Maximal degree in co-relation 7405. Up to 793 conditions per place. [2022-12-06 06:25:04,768 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 67 transitions, 477 flow [2022-12-06 06:25:04,768 INFO L188 LiptonReduction]: Number of co-enabled transitions 1072 [2022-12-06 06:25:04,772 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:04,772 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 196 [2022-12-06 06:25:04,773 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 477 flow [2022-12-06 06:25:04,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 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-06 06:25:04,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:04,773 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:04,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:25:04,773 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:04,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:04,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1047346949, now seen corresponding path program 2 times [2022-12-06 06:25:04,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:04,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398975295] [2022-12-06 06:25:04,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:04,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:25:05,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:05,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398975295] [2022-12-06 06:25:05,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398975295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:05,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:05,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:25:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888444064] [2022-12-06 06:25:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:05,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:25:05,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:05,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:25:05,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:25:05,023 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2022-12-06 06:25:05,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 477 flow. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 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-06 06:25:05,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:05,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2022-12-06 06:25:05,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:05,888 INFO L130 PetriNetUnfolder]: 4633/7518 cut-off events. [2022-12-06 06:25:05,888 INFO L131 PetriNetUnfolder]: For 19154/19345 co-relation queries the response was YES. [2022-12-06 06:25:05,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30066 conditions, 7518 events. 4633/7518 cut-off events. For 19154/19345 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 49395 event pairs, 653 based on Foata normal form. 150/7525 useless extension candidates. Maximal degree in co-relation 30038. Up to 2936 conditions per place. [2022-12-06 06:25:05,927 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 115 selfloop transitions, 18 changer transitions 32/172 dead transitions. [2022-12-06 06:25:05,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 172 transitions, 1558 flow [2022-12-06 06:25:05,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:25:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:25:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2022-12-06 06:25:05,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2022-12-06 06:25:05,929 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 477 flow. Second operand 8 states and 118 transitions. [2022-12-06 06:25:05,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 172 transitions, 1558 flow [2022-12-06 06:25:06,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 172 transitions, 1475 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 06:25:06,234 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 460 flow [2022-12-06 06:25:06,234 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=460, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2022-12-06 06:25:06,235 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 25 predicate places. [2022-12-06 06:25:06,235 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:06,235 INFO L89 Accepts]: Start accepts. Operand has 73 places, 64 transitions, 460 flow [2022-12-06 06:25:06,236 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:06,236 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:06,236 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 64 transitions, 460 flow [2022-12-06 06:25:06,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 64 transitions, 460 flow [2022-12-06 06:25:06,405 INFO L130 PetriNetUnfolder]: 784/1952 cut-off events. [2022-12-06 06:25:06,405 INFO L131 PetriNetUnfolder]: For 3970/4294 co-relation queries the response was YES. [2022-12-06 06:25:06,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7483 conditions, 1952 events. 784/1952 cut-off events. For 3970/4294 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 16437 event pairs, 75 based on Foata normal form. 11/1845 useless extension candidates. Maximal degree in co-relation 7458. Up to 712 conditions per place. [2022-12-06 06:25:06,425 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 64 transitions, 460 flow [2022-12-06 06:25:06,426 INFO L188 LiptonReduction]: Number of co-enabled transitions 982 [2022-12-06 06:25:06,745 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:25:06,746 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 511 [2022-12-06 06:25:06,746 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 462 flow [2022-12-06 06:25:06,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 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-06 06:25:06,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:06,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:06,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:25:06,747 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash -454527785, now seen corresponding path program 1 times [2022-12-06 06:25:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:06,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511915826] [2022-12-06 06:25:06,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:06,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:25:07,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:07,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511915826] [2022-12-06 06:25:07,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511915826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:07,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:07,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:25:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333785410] [2022-12-06 06:25:07,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:07,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:25:07,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:07,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:25:07,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:25:07,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:25:07,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 462 flow. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:07,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:07,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:25:07,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:09,360 INFO L130 PetriNetUnfolder]: 8866/13536 cut-off events. [2022-12-06 06:25:09,361 INFO L131 PetriNetUnfolder]: For 34590/34590 co-relation queries the response was YES. [2022-12-06 06:25:09,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57137 conditions, 13536 events. 8866/13536 cut-off events. For 34590/34590 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 84257 event pairs, 1871 based on Foata normal form. 1/13537 useless extension candidates. Maximal degree in co-relation 57107. Up to 8958 conditions per place. [2022-12-06 06:25:09,541 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 181 selfloop transitions, 40 changer transitions 24/245 dead transitions. [2022-12-06 06:25:09,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 245 transitions, 2136 flow [2022-12-06 06:25:09,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:25:09,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:25:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2022-12-06 06:25:09,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2022-12-06 06:25:09,543 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 462 flow. Second operand 10 states and 137 transitions. [2022-12-06 06:25:09,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 245 transitions, 2136 flow [2022-12-06 06:25:09,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 245 transitions, 1951 flow, removed 45 selfloop flow, removed 7 redundant places. [2022-12-06 06:25:09,939 INFO L231 Difference]: Finished difference. Result has 80 places, 99 transitions, 822 flow [2022-12-06 06:25:09,939 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=822, PETRI_PLACES=80, PETRI_TRANSITIONS=99} [2022-12-06 06:25:09,940 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 32 predicate places. [2022-12-06 06:25:09,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:09,940 INFO L89 Accepts]: Start accepts. Operand has 80 places, 99 transitions, 822 flow [2022-12-06 06:25:09,941 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:09,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:09,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 99 transitions, 822 flow [2022-12-06 06:25:09,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 99 transitions, 822 flow [2022-12-06 06:25:10,190 INFO L130 PetriNetUnfolder]: 1204/2708 cut-off events. [2022-12-06 06:25:10,190 INFO L131 PetriNetUnfolder]: For 5729/5950 co-relation queries the response was YES. [2022-12-06 06:25:10,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9725 conditions, 2708 events. 1204/2708 cut-off events. For 5729/5950 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 23028 event pairs, 117 based on Foata normal form. 26/2562 useless extension candidates. Maximal degree in co-relation 9693. Up to 772 conditions per place. [2022-12-06 06:25:10,225 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 99 transitions, 822 flow [2022-12-06 06:25:10,225 INFO L188 LiptonReduction]: Number of co-enabled transitions 1364 [2022-12-06 06:25:10,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_4 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [393] L787-->L790: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-06 06:25:10,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_4 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [386] L767-->L770: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-06 06:25:10,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_4 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [539] $Ultimate##0-->L833: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_15| v_P3Thread1of1ForFork2_~arg.base_15) (= v_~z~0_37 1) (= v_~a~0_42 1) (= v_P3Thread1of1ForFork2_~arg.offset_15 |v_P3Thread1of1ForFork2_#in~arg.offset_15|) (= v_~a~0_42 v_~__unbuffered_p3_EAX~0_70)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} OutVars{~a~0=v_~a~0_42, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, ~z~0=v_~z~0_37, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_15, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} AuxVars[] AssignedVars[~a~0, P3Thread1of1ForFork2_~arg.offset, ~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork2_~arg.base] [2022-12-06 06:25:10,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_4 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [539] $Ultimate##0-->L833: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_15| v_P3Thread1of1ForFork2_~arg.base_15) (= v_~z~0_37 1) (= v_~a~0_42 1) (= v_P3Thread1of1ForFork2_~arg.offset_15 |v_P3Thread1of1ForFork2_#in~arg.offset_15|) (= v_~a~0_42 v_~__unbuffered_p3_EAX~0_70)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} OutVars{~a~0=v_~a~0_42, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, ~z~0=v_~z~0_37, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_15, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} AuxVars[] AssignedVars[~a~0, P3Thread1of1ForFork2_~arg.offset, ~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork2_~arg.base] [2022-12-06 06:25:10,382 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L767: Formula: (and (= v_~b$r_buff1_thd2~0_69 v_~b$r_buff0_thd2~0_65) (= v_~b$r_buff1_thd3~0_65 v_~b$r_buff0_thd3~0_63) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~b$w_buff0~0_176 1) (= v_~b$w_buff0_used~0_320 1) (= v_~b$r_buff0_thd4~0_125 v_~b$r_buff1_thd4~0_128) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~b$r_buff1_thd1~0_95 v_~b$r_buff0_thd1~0_101) (= v_~b$w_buff1~0_150 v_~b$w_buff0~0_177) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_290 256) 0)) (not (= (mod v_~b$w_buff0_used~0_320 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$r_buff0_thd1~0_100 1) (= v_~b$r_buff1_thd0~0_89 v_~b$r_buff0_thd0~0_82) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$w_buff0_used~0_321 v_~b$w_buff1_used~0_290)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_321, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~b$w_buff0~0=v_~b$w_buff0~0_177, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_95, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_89, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_320, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_290, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_128, ~b$w_buff1~0=v_~b$w_buff1~0_150, ~b$w_buff0~0=v_~b$w_buff0~0_176, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_65, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [400] L807-->L810: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-06 06:25:10,471 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L767: Formula: (and (= v_~b$r_buff1_thd2~0_69 v_~b$r_buff0_thd2~0_65) (= v_~b$r_buff1_thd3~0_65 v_~b$r_buff0_thd3~0_63) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~b$w_buff0~0_176 1) (= v_~b$w_buff0_used~0_320 1) (= v_~b$r_buff0_thd4~0_125 v_~b$r_buff1_thd4~0_128) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~b$r_buff1_thd1~0_95 v_~b$r_buff0_thd1~0_101) (= v_~b$w_buff1~0_150 v_~b$w_buff0~0_177) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_290 256) 0)) (not (= (mod v_~b$w_buff0_used~0_320 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$r_buff0_thd1~0_100 1) (= v_~b$r_buff1_thd0~0_89 v_~b$r_buff0_thd0~0_82) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$w_buff0_used~0_321 v_~b$w_buff1_used~0_290)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_321, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~b$w_buff0~0=v_~b$w_buff0~0_177, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_95, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_89, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_320, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_290, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_128, ~b$w_buff1~0=v_~b$w_buff1~0_150, ~b$w_buff0~0=v_~b$w_buff0~0_176, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_65, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [549] $Ultimate##0-->L810: Formula: (and (= v_~z~0_49 v_~__unbuffered_p2_EAX~0_93) (= v_~y~0_44 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_15| v_P2Thread1of1ForFork0_~arg.base_15) (= |v_P2Thread1of1ForFork0_#in~arg.offset_15| v_P2Thread1of1ForFork0_~arg.offset_15)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, ~z~0=v_~z~0_49, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_15, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_15|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_93, ~z~0=v_~z~0_49, ~y~0=v_~y~0_44, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-06 06:25:10,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L767: Formula: (and (= v_~b$r_buff1_thd2~0_69 v_~b$r_buff0_thd2~0_65) (= v_~b$r_buff1_thd3~0_65 v_~b$r_buff0_thd3~0_63) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~b$w_buff0~0_176 1) (= v_~b$w_buff0_used~0_320 1) (= v_~b$r_buff0_thd4~0_125 v_~b$r_buff1_thd4~0_128) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~b$r_buff1_thd1~0_95 v_~b$r_buff0_thd1~0_101) (= v_~b$w_buff1~0_150 v_~b$w_buff0~0_177) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_290 256) 0)) (not (= (mod v_~b$w_buff0_used~0_320 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$r_buff0_thd1~0_100 1) (= v_~b$r_buff1_thd0~0_89 v_~b$r_buff0_thd0~0_82) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$w_buff0_used~0_321 v_~b$w_buff1_used~0_290)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_321, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~b$w_buff0~0=v_~b$w_buff0~0_177, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_95, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_89, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_320, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_290, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_128, ~b$w_buff1~0=v_~b$w_buff1~0_150, ~b$w_buff0~0=v_~b$w_buff0~0_176, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_65, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [550] $Ultimate##0-->L790: Formula: (and (= v_~y~0_46 v_~__unbuffered_p1_EAX~0_88) (= v_~y~0_46 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_17| v_P2Thread1of1ForFork0_~arg.base_17) (= |v_P2Thread1of1ForFork0_#in~arg.offset_17| v_P2Thread1of1ForFork0_~arg.offset_17)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_17, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_17, ~y~0=v_~y~0_46, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork0_~arg.offset, ~y~0] [2022-12-06 06:25:10,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L767: Formula: (and (= v_~b$r_buff1_thd2~0_69 v_~b$r_buff0_thd2~0_65) (= v_~b$r_buff1_thd3~0_65 v_~b$r_buff0_thd3~0_63) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~b$w_buff0~0_176 1) (= v_~b$w_buff0_used~0_320 1) (= v_~b$r_buff0_thd4~0_125 v_~b$r_buff1_thd4~0_128) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~b$r_buff1_thd1~0_95 v_~b$r_buff0_thd1~0_101) (= v_~b$w_buff1~0_150 v_~b$w_buff0~0_177) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_290 256) 0)) (not (= (mod v_~b$w_buff0_used~0_320 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$r_buff0_thd1~0_100 1) (= v_~b$r_buff1_thd0~0_89 v_~b$r_buff0_thd0~0_82) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$w_buff0_used~0_321 v_~b$w_buff1_used~0_290)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_321, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~b$w_buff0~0=v_~b$w_buff0~0_177, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_95, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_89, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_320, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_290, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_128, ~b$w_buff1~0=v_~b$w_buff1~0_150, ~b$w_buff0~0=v_~b$w_buff0~0_176, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_65, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [551] $Ultimate##0-->L810: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_19) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_19) (= v_~z~0_51 v_~__unbuffered_p2_EAX~0_95) (= v_~y~0_48 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, ~z~0=v_~z~0_51, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_19, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, ~z~0=v_~z~0_51, ~y~0=v_~y~0_48, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-06 06:25:10,849 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L767: Formula: (and (= v_~b$r_buff1_thd2~0_69 v_~b$r_buff0_thd2~0_65) (= v_~b$r_buff1_thd3~0_65 v_~b$r_buff0_thd3~0_63) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~b$w_buff0~0_176 1) (= v_~b$w_buff0_used~0_320 1) (= v_~b$r_buff0_thd4~0_125 v_~b$r_buff1_thd4~0_128) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~b$r_buff1_thd1~0_95 v_~b$r_buff0_thd1~0_101) (= v_~b$w_buff1~0_150 v_~b$w_buff0~0_177) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_290 256) 0)) (not (= (mod v_~b$w_buff0_used~0_320 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$r_buff0_thd1~0_100 1) (= v_~b$r_buff1_thd0~0_89 v_~b$r_buff0_thd0~0_82) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$w_buff0_used~0_321 v_~b$w_buff1_used~0_290)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_321, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~b$w_buff0~0=v_~b$w_buff0~0_177, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_95, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_89, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_320, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_290, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_128, ~b$w_buff1~0=v_~b$w_buff1~0_150, ~b$w_buff0~0=v_~b$w_buff0~0_176, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_65, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [552] $Ultimate##0-->L770: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.offset_21| v_P2Thread1of1ForFork0_~arg.offset_21) (= |v_P2Thread1of1ForFork0_#in~arg.base_21| v_P2Thread1of1ForFork0_~arg.base_21) (= v_~x~0_52 v_~__unbuffered_p0_EAX~0_97) (= v_~y~0_50 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, ~x~0=v_~x~0_52, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_97, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_21, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_21|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_21, ~y~0=v_~y~0_50, ~x~0=v_~x~0_52, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_21|} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] [2022-12-06 06:25:10,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L767: Formula: (and (= v_~b$r_buff1_thd2~0_69 v_~b$r_buff0_thd2~0_65) (= v_~b$r_buff1_thd3~0_65 v_~b$r_buff0_thd3~0_63) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~b$w_buff0~0_176 1) (= v_~b$w_buff0_used~0_320 1) (= v_~b$r_buff0_thd4~0_125 v_~b$r_buff1_thd4~0_128) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~b$r_buff1_thd1~0_95 v_~b$r_buff0_thd1~0_101) (= v_~b$w_buff1~0_150 v_~b$w_buff0~0_177) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_290 256) 0)) (not (= (mod v_~b$w_buff0_used~0_320 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$r_buff0_thd1~0_100 1) (= v_~b$r_buff1_thd0~0_89 v_~b$r_buff0_thd0~0_82) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$w_buff0_used~0_321 v_~b$w_buff1_used~0_290)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_321, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~b$w_buff0~0=v_~b$w_buff0~0_177, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_95, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_89, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_320, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_290, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_128, ~b$w_buff1~0=v_~b$w_buff1~0_150, ~b$w_buff0~0=v_~b$w_buff0~0_176, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_65, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [553] $Ultimate##0-->L833: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_21| v_P3Thread1of1ForFork2_~arg.base_21) (= v_~y~0_52 1) (= v_P3Thread1of1ForFork2_~arg.offset_21 |v_P3Thread1of1ForFork2_#in~arg.offset_21|) (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= v_~z~0_53 1) (= v_~a~0_48 1) (= v_~a~0_48 v_~__unbuffered_p3_EAX~0_84) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_21|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_21|} OutVars{~a~0=v_~a~0_48, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_21, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_84, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_21|, ~z~0=v_~z~0_53, ~y~0=v_~y~0_52, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_21, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_21|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_~arg.base, P3Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p3_EAX~0, ~z~0, ~y~0, P3Thread1of1ForFork2_~arg.base] [2022-12-06 06:25:11,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L767: Formula: (and (= v_~b$r_buff1_thd2~0_69 v_~b$r_buff0_thd2~0_65) (= v_~b$r_buff1_thd3~0_65 v_~b$r_buff0_thd3~0_63) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~b$w_buff0~0_176 1) (= v_~b$w_buff0_used~0_320 1) (= v_~b$r_buff0_thd4~0_125 v_~b$r_buff1_thd4~0_128) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~b$r_buff1_thd1~0_95 v_~b$r_buff0_thd1~0_101) (= v_~b$w_buff1~0_150 v_~b$w_buff0~0_177) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_290 256) 0)) (not (= (mod v_~b$w_buff0_used~0_320 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$r_buff0_thd1~0_100 1) (= v_~b$r_buff1_thd0~0_89 v_~b$r_buff0_thd0~0_82) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$w_buff0_used~0_321 v_~b$w_buff1_used~0_290)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_321, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~b$w_buff0~0=v_~b$w_buff0~0_177, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_95, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_89, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_320, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_290, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_128, ~b$w_buff1~0=v_~b$w_buff1~0_150, ~b$w_buff0~0=v_~b$w_buff0~0_176, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_65, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [554] $Ultimate##0-->L833: Formula: (and (= v_P3Thread1of1ForFork2_~arg.offset_23 |v_P3Thread1of1ForFork2_#in~arg.offset_23|) (= v_~y~0_54 1) (= |v_P3Thread1of1ForFork2_#in~arg.base_23| v_P3Thread1of1ForFork2_~arg.base_23) (= |v_P2Thread1of1ForFork0_#in~arg.base_25| v_P2Thread1of1ForFork0_~arg.base_25) (= |v_P2Thread1of1ForFork0_#in~arg.offset_25| v_P2Thread1of1ForFork0_~arg.offset_25) (= v_~a~0_50 1) (= v_~a~0_50 v_~__unbuffered_p3_EAX~0_86) (= v_~z~0_55 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_23|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_23|} OutVars{~a~0=v_~a~0_50, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_25, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_25|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_23, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_86, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_23|, ~z~0=v_~z~0_55, ~y~0=v_~y~0_54, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_23, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_25|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_23|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_~arg.base, P3Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork0_~arg.offset, ~__unbuffered_p3_EAX~0, ~z~0, ~y~0, P3Thread1of1ForFork2_~arg.base] [2022-12-06 06:25:11,286 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L767: Formula: (and (= v_~b$r_buff1_thd2~0_69 v_~b$r_buff0_thd2~0_65) (= v_~b$r_buff1_thd3~0_65 v_~b$r_buff0_thd3~0_63) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~b$w_buff0~0_176 1) (= v_~b$w_buff0_used~0_320 1) (= v_~b$r_buff0_thd4~0_125 v_~b$r_buff1_thd4~0_128) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~b$r_buff1_thd1~0_95 v_~b$r_buff0_thd1~0_101) (= v_~b$w_buff1~0_150 v_~b$w_buff0~0_177) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_290 256) 0)) (not (= (mod v_~b$w_buff0_used~0_320 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$r_buff0_thd1~0_100 1) (= v_~b$r_buff1_thd0~0_89 v_~b$r_buff0_thd0~0_82) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$w_buff0_used~0_321 v_~b$w_buff1_used~0_290)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_321, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~b$w_buff0~0=v_~b$w_buff0~0_177, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_95, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_89, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_320, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_290, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_128, ~b$w_buff1~0=v_~b$w_buff1~0_150, ~b$w_buff0~0=v_~b$w_buff0~0_176, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_65, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [393] L787-->L790: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-06 06:25:11,375 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L767: Formula: (and (= v_~b$r_buff1_thd2~0_69 v_~b$r_buff0_thd2~0_65) (= v_~b$r_buff1_thd3~0_65 v_~b$r_buff0_thd3~0_63) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~b$w_buff0~0_176 1) (= v_~b$w_buff0_used~0_320 1) (= v_~b$r_buff0_thd4~0_125 v_~b$r_buff1_thd4~0_128) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~b$r_buff1_thd1~0_95 v_~b$r_buff0_thd1~0_101) (= v_~b$w_buff1~0_150 v_~b$w_buff0~0_177) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_290 256) 0)) (not (= (mod v_~b$w_buff0_used~0_320 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$r_buff0_thd1~0_100 1) (= v_~b$r_buff1_thd0~0_89 v_~b$r_buff0_thd0~0_82) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$w_buff0_used~0_321 v_~b$w_buff1_used~0_290)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_321, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~b$w_buff0~0=v_~b$w_buff0~0_177, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_95, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_89, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_320, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_290, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_128, ~b$w_buff1~0=v_~b$w_buff1~0_150, ~b$w_buff0~0=v_~b$w_buff0~0_176, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_65, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [400] L807-->L810: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-06 06:25:11,558 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L767: Formula: (and (= v_~b$r_buff1_thd2~0_69 v_~b$r_buff0_thd2~0_65) (= v_~b$r_buff1_thd3~0_65 v_~b$r_buff0_thd3~0_63) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~b$w_buff0~0_176 1) (= v_~b$w_buff0_used~0_320 1) (= v_~b$r_buff0_thd4~0_125 v_~b$r_buff1_thd4~0_128) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~b$r_buff1_thd1~0_95 v_~b$r_buff0_thd1~0_101) (= v_~b$w_buff1~0_150 v_~b$w_buff0~0_177) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_290 256) 0)) (not (= (mod v_~b$w_buff0_used~0_320 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$r_buff0_thd1~0_100 1) (= v_~b$r_buff1_thd0~0_89 v_~b$r_buff0_thd0~0_82) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$w_buff0_used~0_321 v_~b$w_buff1_used~0_290)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_321, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~b$w_buff0~0=v_~b$w_buff0~0_177, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_95, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_89, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_320, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_290, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_128, ~b$w_buff1~0=v_~b$w_buff1~0_150, ~b$w_buff0~0=v_~b$w_buff0~0_176, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_65, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [539] $Ultimate##0-->L833: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_15| v_P3Thread1of1ForFork2_~arg.base_15) (= v_~z~0_37 1) (= v_~a~0_42 1) (= v_P3Thread1of1ForFork2_~arg.offset_15 |v_P3Thread1of1ForFork2_#in~arg.offset_15|) (= v_~a~0_42 v_~__unbuffered_p3_EAX~0_70)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} OutVars{~a~0=v_~a~0_42, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, ~z~0=v_~z~0_37, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_15, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} AuxVars[] AssignedVars[~a~0, P3Thread1of1ForFork2_~arg.offset, ~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork2_~arg.base] [2022-12-06 06:25:11,690 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L767: Formula: (and (= v_~b$r_buff1_thd2~0_69 v_~b$r_buff0_thd2~0_65) (= v_~b$r_buff1_thd3~0_65 v_~b$r_buff0_thd3~0_63) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~b$w_buff0~0_176 1) (= v_~b$w_buff0_used~0_320 1) (= v_~b$r_buff0_thd4~0_125 v_~b$r_buff1_thd4~0_128) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~b$r_buff1_thd1~0_95 v_~b$r_buff0_thd1~0_101) (= v_~b$w_buff1~0_150 v_~b$w_buff0~0_177) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_290 256) 0)) (not (= (mod v_~b$w_buff0_used~0_320 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$r_buff0_thd1~0_100 1) (= v_~b$r_buff1_thd0~0_89 v_~b$r_buff0_thd0~0_82) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$w_buff0_used~0_321 v_~b$w_buff1_used~0_290)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_321, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~b$w_buff0~0=v_~b$w_buff0~0_177, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_95, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_89, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_320, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_290, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_128, ~b$w_buff1~0=v_~b$w_buff1~0_150, ~b$w_buff0~0=v_~b$w_buff0~0_176, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_65, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [539] $Ultimate##0-->L833: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_15| v_P3Thread1of1ForFork2_~arg.base_15) (= v_~z~0_37 1) (= v_~a~0_42 1) (= v_P3Thread1of1ForFork2_~arg.offset_15 |v_P3Thread1of1ForFork2_#in~arg.offset_15|) (= v_~a~0_42 v_~__unbuffered_p3_EAX~0_70)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} OutVars{~a~0=v_~a~0_42, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, ~z~0=v_~z~0_37, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_15, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} AuxVars[] AssignedVars[~a~0, P3Thread1of1ForFork2_~arg.offset, ~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork2_~arg.base] [2022-12-06 06:25:11,910 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [393] L787-->L790: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [386] L767-->L770: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-06 06:25:11,920 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [393] L787-->L790: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [386] L767-->L770: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-06 06:25:11,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [561] $Ultimate##0-->L833: Formula: (and (= v_~b$r_buff0_thd0~0_204 v_~b$r_buff1_thd0~0_214) (= v_~a~0_54 v_~__unbuffered_p3_EAX~0_90) (= v_~b$r_buff0_thd3~0_153 v_~b$r_buff1_thd3~0_158) (= v_~b$r_buff0_thd1~0_250 1) (= v_~b$r_buff0_thd1~0_251 v_~b$r_buff1_thd1~0_175) (= v_~y~0_66 1) (= |v_P0Thread1of1ForFork1_~arg#1.base_77| |v_P0Thread1of1ForFork1_#in~arg#1.base_77|) (= v_~a~0_54 1) (= v_~b$w_buff0_used~0_594 1) (= |v_P0Thread1of1ForFork1_~arg#1.offset_77| |v_P0Thread1of1ForFork1_#in~arg#1.offset_77|) (= v_~b$r_buff0_thd4~0_251 v_~b$r_buff1_thd4~0_261) (= |v_P2Thread1of1ForFork0_#in~arg.base_37| v_P2Thread1of1ForFork0_~arg.base_37) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_85| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_85|) (= v_~b$r_buff0_thd2~0_155 v_~b$r_buff1_thd2~0_162) (= v_~b$w_buff0~0_368 1) (= v_~b$w_buff0_used~0_595 v_~b$w_buff1_used~0_510) (= v_~b$w_buff1~0_298 v_~b$w_buff0~0_369) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_85| 0)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_37| v_P2Thread1of1ForFork0_~arg.offset_37) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_510 256) 0)) (not (= (mod v_~b$w_buff0_used~0_594 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_85|) (= v_P3Thread1of1ForFork2_~arg.offset_27 |v_P3Thread1of1ForFork2_#in~arg.offset_27|) (= |v_P3Thread1of1ForFork2_#in~arg.base_27| v_P3Thread1of1ForFork2_~arg.base_27) (= v_~z~0_65 1)) InVars {~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_251, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_155, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_153, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_77|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_77|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_27|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_595, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_27|, ~b$w_buff0~0=v_~b$w_buff0~0_369, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_251, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_250, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_153, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_175, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_27, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_77|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_27, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_77|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_594, ~a~0=v_~a~0_54, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_510, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_85|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_27|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_261, ~b$w_buff0~0=v_~b$w_buff0~0_368, ~y~0=v_~y~0_66, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_85|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_251, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_162, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_155, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_37|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_214, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_77|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_27|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_77|, ~b$w_buff1~0=v_~b$w_buff1~0_298, ~z~0=v_~z~0_65, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_37|, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_158} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P3Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork0_~arg.offset, P3Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork1_~arg#1.base, ~b$w_buff0_used~0, ~a~0, P2Thread1of1ForFork0_~arg.base, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~__unbuffered_p3_EAX~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~z~0, ~y~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] and [386] L767-->L770: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-06 06:25:12,480 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:25:12,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2541 [2022-12-06 06:25:12,481 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 96 transitions, 950 flow [2022-12-06 06:25:12,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:12,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:12,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:12,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:25:12,482 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:12,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash -724149296, now seen corresponding path program 1 times [2022-12-06 06:25:12,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:12,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476686212] [2022-12-06 06:25:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:12,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:25:13,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:13,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476686212] [2022-12-06 06:25:13,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476686212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:13,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:13,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:25:13,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889017800] [2022-12-06 06:25:13,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:13,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:25:13,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:13,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:25:13,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:25:13,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 06:25:13,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 96 transitions, 950 flow. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:13,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:13,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 06:25:13,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:15,252 INFO L130 PetriNetUnfolder]: 11705/17907 cut-off events. [2022-12-06 06:25:15,252 INFO L131 PetriNetUnfolder]: For 68601/68601 co-relation queries the response was YES. [2022-12-06 06:25:15,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82258 conditions, 17907 events. 11705/17907 cut-off events. For 68601/68601 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 118273 event pairs, 3515 based on Foata normal form. 2/17909 useless extension candidates. Maximal degree in co-relation 82223. Up to 11009 conditions per place. [2022-12-06 06:25:15,349 INFO L137 encePairwiseOnDemand]: 16/41 looper letters, 105 selfloop transitions, 47 changer transitions 108/260 dead transitions. [2022-12-06 06:25:15,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 260 transitions, 2775 flow [2022-12-06 06:25:15,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 06:25:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 06:25:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-12-06 06:25:15,351 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3170731707317073 [2022-12-06 06:25:15,351 INFO L175 Difference]: Start difference. First operand has 76 places, 96 transitions, 950 flow. Second operand 11 states and 143 transitions. [2022-12-06 06:25:15,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 260 transitions, 2775 flow [2022-12-06 06:25:16,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 260 transitions, 2665 flow, removed 55 selfloop flow, removed 2 redundant places. [2022-12-06 06:25:16,354 INFO L231 Difference]: Finished difference. Result has 90 places, 119 transitions, 1315 flow [2022-12-06 06:25:16,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1315, PETRI_PLACES=90, PETRI_TRANSITIONS=119} [2022-12-06 06:25:16,354 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 42 predicate places. [2022-12-06 06:25:16,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:16,354 INFO L89 Accepts]: Start accepts. Operand has 90 places, 119 transitions, 1315 flow [2022-12-06 06:25:16,355 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:16,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:16,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 119 transitions, 1315 flow [2022-12-06 06:25:16,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 119 transitions, 1315 flow [2022-12-06 06:25:16,730 INFO L130 PetriNetUnfolder]: 1323/2954 cut-off events. [2022-12-06 06:25:16,730 INFO L131 PetriNetUnfolder]: For 17380/18255 co-relation queries the response was YES. [2022-12-06 06:25:16,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11989 conditions, 2954 events. 1323/2954 cut-off events. For 17380/18255 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 25263 event pairs, 80 based on Foata normal form. 246/3041 useless extension candidates. Maximal degree in co-relation 11951. Up to 781 conditions per place. [2022-12-06 06:25:16,779 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 119 transitions, 1315 flow [2022-12-06 06:25:16,779 INFO L188 LiptonReduction]: Number of co-enabled transitions 1388 [2022-12-06 06:25:16,796 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_4 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [539] $Ultimate##0-->L833: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_15| v_P3Thread1of1ForFork2_~arg.base_15) (= v_~z~0_37 1) (= v_~a~0_42 1) (= v_P3Thread1of1ForFork2_~arg.offset_15 |v_P3Thread1of1ForFork2_#in~arg.offset_15|) (= v_~a~0_42 v_~__unbuffered_p3_EAX~0_70)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} OutVars{~a~0=v_~a~0_42, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, ~z~0=v_~z~0_37, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_15, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} AuxVars[] AssignedVars[~a~0, P3Thread1of1ForFork2_~arg.offset, ~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork2_~arg.base] [2022-12-06 06:25:16,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_4 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [565] $Ultimate##0-->L833: Formula: (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_93| 0)) (= v_~b$r_buff0_thd4~0_259 v_~b$r_buff1_thd4~0_269) (= v_~z~0_69 1) (= v_~b$r_buff0_thd1~0_267 v_~b$r_buff1_thd1~0_183) (= v_P3Thread1of1ForFork2_~arg.offset_29 |v_P3Thread1of1ForFork2_#in~arg.offset_29|) (= v_~a~0_56 1) (= v_~a~0_56 v_~__unbuffered_p3_EAX~0_92) (= v_~b$r_buff0_thd2~0_163 v_~b$r_buff1_thd2~0_170) (= v_~b$w_buff0_used~0_611 v_~b$w_buff1_used~0_518) (= v_~b$w_buff0_used~0_610 1) (= |v_P3Thread1of1ForFork2_#in~arg.base_29| v_P3Thread1of1ForFork2_~arg.base_29) (= v_~b$w_buff1~0_306 v_~b$w_buff0~0_385) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_518 256) 0)) (not (= (mod v_~b$w_buff0_used~0_610 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_93|) (= v_~b$w_buff0~0_384 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_93| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_93|) (= v_~b$r_buff0_thd1~0_266 1) (= v_~b$r_buff0_thd3~0_161 v_~b$r_buff1_thd3~0_166) (= |v_P0Thread1of1ForFork1_~arg#1.base_85| |v_P0Thread1of1ForFork1_#in~arg#1.base_85|) (= v_~b$r_buff0_thd0~0_212 v_~b$r_buff1_thd0~0_222) (= |v_P0Thread1of1ForFork1_~arg#1.offset_85| |v_P0Thread1of1ForFork1_#in~arg#1.offset_85|)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_611, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_267, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_163, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_161, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_85|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_29|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_85|, ~b$w_buff0~0=v_~b$w_buff0~0_385, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_259, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_29|, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_212} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_266, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_161, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_183, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_29, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_85|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_29, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_85|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_610, ~a~0=v_~a~0_56, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_518, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_93|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_92, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_29|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_269, ~b$w_buff0~0=v_~b$w_buff0~0_384, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_93|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_259, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_170, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_212, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_163, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_222, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_85|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_29|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_85|, ~b$w_buff1~0=v_~b$w_buff1~0_306, ~z~0=v_~z~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_166} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P3Thread1of1ForFork2_~arg.offset, P3Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork1_~arg#1.base, ~b$w_buff0_used~0, ~a~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~__unbuffered_p3_EAX~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~z~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] [2022-12-06 06:25:16,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_4 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [542] $Ultimate##0-->L770: Formula: (and (= v_~b$w_buff1~0_266 v_~b$w_buff0~0_321) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_69| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_69|) (= v_~b$r_buff0_thd3~0_137 v_~b$r_buff1_thd3~0_142) (= v_~b$r_buff0_thd1~0_219 v_~b$r_buff1_thd1~0_159) (= v_~b$r_buff0_thd2~0_139 v_~b$r_buff1_thd2~0_146) (= v_~b$r_buff0_thd4~0_225 v_~b$r_buff1_thd4~0_235) (= v_~b$w_buff0~0_320 1) (= v_~b$w_buff0_used~0_541 v_~b$w_buff1_used~0_472) (= v_~b$w_buff0_used~0_540 1) (= v_~b$r_buff0_thd1~0_218 1) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_69| 0)) (= v_~x~0_44 v_~__unbuffered_p0_EAX~0_85) (= |v_P0Thread1of1ForFork1_~arg#1.offset_61| |v_P0Thread1of1ForFork1_#in~arg#1.offset_61|) (= |v_P0Thread1of1ForFork1_~arg#1.base_61| |v_P0Thread1of1ForFork1_#in~arg#1.base_61|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_69| (ite (not (and (not (= (mod v_~b$w_buff0_used~0_540 256) 0)) (not (= 0 (mod v_~b$w_buff1_used~0_472 256))))) 1 0)) (= v_~b$r_buff0_thd0~0_176 v_~b$r_buff1_thd0~0_186)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_541, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_219, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_139, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_137, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_61|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_61|, ~b$w_buff0~0=v_~b$w_buff0~0_321, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_225, ~x~0=v_~x~0_44, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_176} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_218, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_139, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_137, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_159, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_186, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_61|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_61|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_61|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_61|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_540, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_472, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_69|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_235, ~b$w_buff1~0=v_~b$w_buff1~0_266, ~b$w_buff0~0=v_~b$w_buff0~0_320, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_69|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_225, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_146, ~x~0=v_~x~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_142, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_176} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] [2022-12-06 06:25:17,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_4 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [539] $Ultimate##0-->L833: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_15| v_P3Thread1of1ForFork2_~arg.base_15) (= v_~z~0_37 1) (= v_~a~0_42 1) (= v_P3Thread1of1ForFork2_~arg.offset_15 |v_P3Thread1of1ForFork2_#in~arg.offset_15|) (= v_~a~0_42 v_~__unbuffered_p3_EAX~0_70)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} OutVars{~a~0=v_~a~0_42, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, ~z~0=v_~z~0_37, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_15, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} AuxVars[] AssignedVars[~a~0, P3Thread1of1ForFork2_~arg.offset, ~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork2_~arg.base] [2022-12-06 06:25:17,162 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_4 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [564] $Ultimate##0-->L770: Formula: (and (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_91| (ite (not (and (not (= (mod v_~b$w_buff1_used~0_516 256) 0)) (not (= (mod v_~b$w_buff0_used~0_606 256) 0)))) 1 0)) (= v_~b$r_buff0_thd3~0_159 v_~b$r_buff1_thd3~0_164) (= v_~b$w_buff0~0_380 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_91| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_91|) (= v_~b$w_buff0_used~0_607 v_~b$w_buff1_used~0_516) (= v_~b$w_buff1~0_304 v_~b$w_buff0~0_381) (= v_~x~0_56 v_~__unbuffered_p0_EAX~0_101) (= v_~b$r_buff0_thd2~0_161 v_~b$r_buff1_thd2~0_168) (= |v_P0Thread1of1ForFork1_~arg#1.offset_83| |v_P0Thread1of1ForFork1_#in~arg#1.offset_83|) (= |v_P0Thread1of1ForFork1_~arg#1.base_83| |v_P0Thread1of1ForFork1_#in~arg#1.base_83|) (= v_~b$r_buff0_thd4~0_257 v_~b$r_buff1_thd4~0_267) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_91| 0)) (= v_~b$w_buff0_used~0_606 1) (= v_~b$r_buff0_thd1~0_263 v_~b$r_buff1_thd1~0_181) (= v_~b$r_buff0_thd1~0_262 1) (= v_~b$r_buff0_thd0~0_210 v_~b$r_buff1_thd0~0_220)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_607, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_263, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_161, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_159, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_83|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_83|, ~b$w_buff0~0=v_~b$w_buff0~0_381, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_257, ~x~0=v_~x~0_56, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_210} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_262, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_161, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_159, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_181, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_220, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_83|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_83|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_83|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_83|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_606, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_516, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_91|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_267, ~b$w_buff1~0=v_~b$w_buff1~0_304, ~b$w_buff0~0=v_~b$w_buff0~0_380, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_91|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_257, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_168, ~x~0=v_~x~0_56, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_164, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_210} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] [2022-12-06 06:25:17,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_4 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [563] $Ultimate##0-->L810: Formula: (and (= v_~b$r_buff0_thd4~0_255 v_~b$r_buff1_thd4~0_265) (= v_~b$w_buff1~0_302 v_~b$w_buff0~0_377) (= v_~b$r_buff0_thd0~0_208 v_~b$r_buff1_thd0~0_218) (= v_~b$r_buff0_thd1~0_258 1) (= v_~z~0_67 v_~__unbuffered_p2_EAX~0_103) (= v_~b$w_buff0_used~0_603 v_~b$w_buff1_used~0_514) (= v_~b$r_buff0_thd1~0_259 v_~b$r_buff1_thd1~0_179) (= v_~b$r_buff0_thd2~0_159 v_~b$r_buff1_thd2~0_166) (= v_~b$w_buff0~0_376 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_89| (ite (not (and (not (= (mod v_~b$w_buff1_used~0_514 256) 0)) (not (= (mod v_~b$w_buff0_used~0_602 256) 0)))) 1 0)) (= |v_P0Thread1of1ForFork1_~arg#1.offset_81| |v_P0Thread1of1ForFork1_#in~arg#1.offset_81|) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_89| 0)) (= v_~b$r_buff0_thd3~0_157 v_~b$r_buff1_thd3~0_162) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_89| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_89|) (= |v_P0Thread1of1ForFork1_~arg#1.base_81| |v_P0Thread1of1ForFork1_#in~arg#1.base_81|) (= v_~b$w_buff0_used~0_602 1)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_603, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_259, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_159, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_157, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_81|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_81|, ~b$w_buff0~0=v_~b$w_buff0~0_377, ~z~0=v_~z~0_67, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_255, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_208} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_258, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_159, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_157, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_179, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_218, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_81|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_81|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_81|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_81|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_602, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_514, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_89|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_265, ~b$w_buff1~0=v_~b$w_buff1~0_302, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_103, ~b$w_buff0~0=v_~b$w_buff0~0_376, ~z~0=v_~z~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_89|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_255, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_166, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_162, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_208} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~__unbuffered_p2_EAX~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] [2022-12-06 06:25:17,404 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_4 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [566] $Ultimate##0-->L833: Formula: (and (= v_~b$r_buff0_thd4~0_261 v_~b$r_buff1_thd4~0_271) (= v_~a~0_58 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_95| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_95|) (= v_~a~0_58 v_~__unbuffered_p3_EAX~0_94) (= v_~b$r_buff0_thd3~0_163 v_~b$r_buff1_thd3~0_168) (= v_~b$r_buff0_thd2~0_165 v_~b$r_buff1_thd2~0_172) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_95| 0)) (= |v_P0Thread1of1ForFork1_~arg#1.offset_87| |v_P0Thread1of1ForFork1_#in~arg#1.offset_87|) (= v_~z~0_71 1) (= v_~b$w_buff0_used~0_614 1) (= |v_P3Thread1of1ForFork2_#in~arg.base_31| v_P3Thread1of1ForFork2_~arg.base_31) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_95| (ite (not (and (not (= (mod v_~b$w_buff0_used~0_614 256) 0)) (not (= (mod v_~b$w_buff1_used~0_520 256) 0)))) 1 0)) (= |v_P0Thread1of1ForFork1_~arg#1.base_87| |v_P0Thread1of1ForFork1_#in~arg#1.base_87|) (= v_P3Thread1of1ForFork2_~arg.offset_31 |v_P3Thread1of1ForFork2_#in~arg.offset_31|) (= v_~b$w_buff1~0_308 v_~b$w_buff0~0_389) (= v_~b$w_buff0_used~0_615 v_~b$w_buff1_used~0_520) (= v_~b$r_buff0_thd0~0_214 v_~b$r_buff1_thd0~0_224) (= v_~b$r_buff0_thd1~0_271 v_~b$r_buff1_thd1~0_185) (= v_~b$w_buff0~0_388 1) (= v_~b$r_buff0_thd1~0_270 1)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_615, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_271, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_165, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_163, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_87|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_31|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_87|, ~b$w_buff0~0=v_~b$w_buff0~0_389, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_261, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_31|, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_214} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_270, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_163, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_185, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_31, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_87|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_31, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_87|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_614, ~a~0=v_~a~0_58, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_520, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_95|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_94, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_31|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_271, ~b$w_buff0~0=v_~b$w_buff0~0_388, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_95|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_261, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_172, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_214, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_165, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_224, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_87|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_31|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_87|, ~b$w_buff1~0=v_~b$w_buff1~0_308, ~z~0=v_~z~0_71, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_168} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P3Thread1of1ForFork2_~arg.offset, P3Thread1of1ForFork2_~arg.base, P0Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork1_~arg#1.base, ~b$w_buff0_used~0, ~a~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~__unbuffered_p3_EAX~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~z~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] [2022-12-06 06:25:17,563 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y~0_4 1) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~y~0=v_~y~0_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~y~0] and [555] $Ultimate##0-->L810: Formula: (and (= v_~b$r_buff0_thd1~0_227 v_~b$r_buff1_thd1~0_163) (= v_~b$r_buff0_thd3~0_141 v_~b$r_buff1_thd3~0_146) (= v_~b$w_buff1~0_286 v_~b$w_buff0~0_345) (= |v_P0Thread1of1ForFork1_~arg#1.offset_65| |v_P0Thread1of1ForFork1_#in~arg#1.offset_65|) (= v_~b$r_buff0_thd2~0_143 v_~b$r_buff1_thd2~0_150) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_73| 0)) (= v_~b$r_buff0_thd4~0_239 v_~b$r_buff1_thd4~0_249) (= v_~b$r_buff0_thd1~0_226 1) (= v_~z~0_57 v_~__unbuffered_p2_EAX~0_97) (= v_~b$w_buff0~0_344 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_73| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_73|) (= (ite (not (and (not (= (mod v_~b$w_buff0_used~0_570 256) 0)) (not (= (mod v_~b$w_buff1_used~0_498 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_73|) (= v_~b$w_buff0_used~0_571 v_~b$w_buff1_used~0_498) (= v_~b$r_buff0_thd0~0_192 v_~b$r_buff1_thd0~0_202) (= |v_P0Thread1of1ForFork1_~arg#1.base_65| |v_P0Thread1of1ForFork1_#in~arg#1.base_65|) (= v_~b$w_buff0_used~0_570 1)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_571, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_227, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_143, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_141, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_65|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_65|, ~b$w_buff0~0=v_~b$w_buff0~0_345, ~z~0=v_~z~0_57, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_239, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_192} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_226, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_143, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_141, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_163, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_202, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_65|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_65|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_65|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_65|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_570, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_498, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_73|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_249, ~b$w_buff1~0=v_~b$w_buff1~0_286, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_97, ~b$w_buff0~0=v_~b$w_buff0~0_344, ~z~0=v_~z~0_57, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_73|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_239, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_150, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_146, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_192} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~__unbuffered_p2_EAX~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] [2022-12-06 06:25:17,700 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:25:17,701 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1347 [2022-12-06 06:25:17,702 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 118 transitions, 1337 flow [2022-12-06 06:25:17,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:17,702 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:17,702 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:17,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:25:17,702 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:17,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:17,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2049766203, now seen corresponding path program 1 times [2022-12-06 06:25:17,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:17,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883411590] [2022-12-06 06:25:17,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:17,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:25:17,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:17,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883411590] [2022-12-06 06:25:17,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883411590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:17,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:17,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:25:17,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855234289] [2022-12-06 06:25:17,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:17,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:25:17,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:17,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:25:17,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:25:17,906 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-06 06:25:17,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 118 transitions, 1337 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:17,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:17,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-06 06:25:17,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:19,767 INFO L130 PetriNetUnfolder]: 9433/14436 cut-off events. [2022-12-06 06:25:19,767 INFO L131 PetriNetUnfolder]: For 72477/72477 co-relation queries the response was YES. [2022-12-06 06:25:19,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71447 conditions, 14436 events. 9433/14436 cut-off events. For 72477/72477 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 94478 event pairs, 1495 based on Foata normal form. 4/14437 useless extension candidates. Maximal degree in co-relation 71406. Up to 8048 conditions per place. [2022-12-06 06:25:19,827 INFO L137 encePairwiseOnDemand]: 19/46 looper letters, 114 selfloop transitions, 12 changer transitions 107/233 dead transitions. [2022-12-06 06:25:19,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 233 transitions, 2778 flow [2022-12-06 06:25:19,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:25:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:25:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-12-06 06:25:19,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3442028985507246 [2022-12-06 06:25:19,829 INFO L175 Difference]: Start difference. First operand has 85 places, 118 transitions, 1337 flow. Second operand 6 states and 95 transitions. [2022-12-06 06:25:19,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 233 transitions, 2778 flow [2022-12-06 06:25:20,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 233 transitions, 2566 flow, removed 94 selfloop flow, removed 5 redundant places. [2022-12-06 06:25:20,535 INFO L231 Difference]: Finished difference. Result has 86 places, 87 transitions, 832 flow [2022-12-06 06:25:20,535 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=832, PETRI_PLACES=86, PETRI_TRANSITIONS=87} [2022-12-06 06:25:20,536 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 38 predicate places. [2022-12-06 06:25:20,536 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:20,536 INFO L89 Accepts]: Start accepts. Operand has 86 places, 87 transitions, 832 flow [2022-12-06 06:25:20,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:20,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:20,538 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 87 transitions, 832 flow [2022-12-06 06:25:20,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 87 transitions, 832 flow [2022-12-06 06:25:20,649 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([409] L833-->L849: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse9 (= (mod v_~b$r_buff0_thd4~0_58 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~b$w_buff0_used~0_140 256) 0)) (.cse5 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse9)) (.cse6 (and .cse4 .cse9))) (let ((.cse7 (or .cse11 .cse5 .cse6)) (.cse8 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse1 (= (mod v_~b$w_buff0_used~0_139 256) 0))) (and (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse3 (= (mod v_~b$r_buff0_thd4~0_57 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse4 .cse3))) v_~b$r_buff1_thd4~0_56 0))) (= v_~b$flush_delayed~0_23 0) (= v_~b~0_98 (ite .cse0 v_~b$mem_tmp~0_16 v_~__unbuffered_p3_EBX~0_14)) (= v_~b$mem_tmp~0_16 v_~b~0_99) (= v_~b$w_buff1_used~0_126 (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse5 .cse6) v_~b$w_buff1_used~0_127 0))) (= (ite .cse7 v_~b~0_99 (ite .cse8 v_~b$w_buff0~0_63 v_~b$w_buff1~0_54)) v_~__unbuffered_p3_EBX~0_14) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork2_#t~nondet4_1|) (= v_~b$w_buff0~0_63 v_~b$w_buff0~0_62) (= v_~b$w_buff0_used~0_139 (ite .cse0 v_~b$w_buff0_used~0_140 (ite .cse7 v_~b$w_buff0_used~0_140 (ite .cse8 0 v_~b$w_buff0_used~0_140)))) (= |v_P3Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_7) (= (ite .cse0 v_~b$r_buff0_thd4~0_58 (ite (or .cse1 (and .cse2 .cse9) .cse6) v_~b$r_buff0_thd4~0_58 (ite (and .cse10 (not .cse1)) 0 v_~b$r_buff0_thd4~0_58))) v_~b$r_buff0_thd4~0_57) (= v_~b$w_buff1~0_54 v_~b$w_buff1~0_53))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_140, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~b~0=v_~b~0_99, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_54, ~b$w_buff0~0=v_~b$w_buff0~0_63, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_58, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_16, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_139, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_98, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_53, ~b$w_buff0~0=v_~b$w_buff0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_57} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][58], [247#true, Black: 193#(<= ~__unbuffered_cnt~0 2), 274#true, Black: 265#(and (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~y~0) (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (<= 0 ~b$r_buff0_thd4~0) (= ~b$w_buff0~0 ~__unbuffered_p1_EAX~0) (= ~b$w_buff0~0 1) (<= ~b$r_buff0_thd4~0 (* (div ~b$r_buff0_thd4~0 256) 256))), 300#(= ~x~0 1), Black: 255#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), P3Thread1of1ForFork2InUse, Black: 250#(and (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (<= 0 ~b$r_buff0_thd4~0) (= ~b$w_buff0~0 1) (<= ~b$r_buff0_thd4~0 (* (div ~b$r_buff0_thd4~0 256) 256))), Black: 257#(and (= 0 ~b$r_buff1_thd3~0) (= ~b$w_buff0~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b$w_buff1~0 ~b~0) (<= 0 ~b$r_buff0_thd4~0) (<= ~b$r_buff0_thd4~0 (* (div ~b$r_buff0_thd4~0 256) 256)) (= ~b$w_buff0~0 ~b~0)), Black: 259#(and (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (<= 0 ~b$r_buff0_thd4~0) (= ~b$w_buff0~0 1) (<= ~b$r_buff0_thd4~0 (* (div ~b$r_buff0_thd4~0 256) 256))), 237#(= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork1InUse, Black: 205#(and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~x~0 1)), Black: 249#(and (= ~b$w_buff0~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (<= 0 ~b$r_buff0_thd4~0) (<= ~b$r_buff0_thd4~0 (* (div ~b$r_buff0_thd4~0 256) 256)) (= ~b$w_buff0~0 ~b~0)), Black: 203#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), P1Thread1of1ForFork3InUse, Black: 263#(and (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= ~b$w_buff0~0 ~y~0) (= ~b$w_buff1~0 0) (= ~b$w_buff1~0 ~b~0) (<= 0 ~b$r_buff0_thd4~0) (= ~b$w_buff0~0 1) (<= ~b$r_buff0_thd4~0 (* (div ~b$r_buff0_thd4~0 256) 256))), P2Thread1of1ForFork0InUse, 49#L817true, Black: 214#(and (<= ~b$w_buff0_used~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 1) (= 0 ~b$r_buff1_thd2~0) (<= 0 ~b$w_buff0_used~0)), 121#L797true, 202#(= ~x~0 1), Black: 213#(and (= ~b$r_buff0_thd1~0 1) (= ~b$r_buff0_thd2~0 0) (<= (div ~b$w_buff0_used~0 256) 0) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0) (<= 1 ~b$w_buff0_used~0)), 9#L880-3true, Black: 278#(and (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 ~b~0)) (= ~b$w_buff1_used~0 0) (= ~b$w_buff0~0 ~y~0)), Black: 277#(and (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$w_buff0_used~0 0) (= ~y~0 1) (= ~b$w_buff0~0 ~b~0)), Black: 228#(and (<= ~b$w_buff0_used~0 0) (= ~b$w_buff1_used~0 0) (not (= ~b~0 0)) (<= 0 ~b$w_buff0_used~0)), Black: 172#(<= ~__unbuffered_cnt~0 1), 17#L849true, Black: 240#(<= ~__unbuffered_cnt~0 3), 179#true, Black: 307#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), 76#L777true, Black: 181#(and (= ~b$r_buff0_thd1~0 1) (<= (div ~b$w_buff0_used~0 256) 0) (= ~b$w_buff0~0 1) (<= 1 ~b$w_buff0_used~0)), 212#(= ~b$r_buff0_thd2~0 0)]) [2022-12-06 06:25:20,650 INFO L382 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2022-12-06 06:25:20,650 INFO L385 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2022-12-06 06:25:20,650 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 06:25:20,650 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-06 06:25:20,704 INFO L130 PetriNetUnfolder]: 688/1587 cut-off events. [2022-12-06 06:25:20,704 INFO L131 PetriNetUnfolder]: For 10210/10773 co-relation queries the response was YES. [2022-12-06 06:25:20,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6074 conditions, 1587 events. 688/1587 cut-off events. For 10210/10773 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 12490 event pairs, 72 based on Foata normal form. 185/1671 useless extension candidates. Maximal degree in co-relation 6038. Up to 445 conditions per place. [2022-12-06 06:25:20,725 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 87 transitions, 832 flow [2022-12-06 06:25:20,725 INFO L188 LiptonReduction]: Number of co-enabled transitions 930 [2022-12-06 06:25:20,726 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] $Ultimate##0-->L833: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_15| v_P3Thread1of1ForFork2_~arg.base_15) (= v_~z~0_37 1) (= v_~a~0_42 1) (= v_P3Thread1of1ForFork2_~arg.offset_15 |v_P3Thread1of1ForFork2_#in~arg.offset_15|) (= v_~a~0_42 v_~__unbuffered_p3_EAX~0_70)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} OutVars{~a~0=v_~a~0_42, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, ~z~0=v_~z~0_37, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_15, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} AuxVars[] AssignedVars[~a~0, P3Thread1of1ForFork2_~arg.offset, ~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork2_~arg.base] and [533] $Ultimate##0-->L767: Formula: (and (= v_~b$r_buff1_thd2~0_69 v_~b$r_buff0_thd2~0_65) (= v_~b$r_buff1_thd3~0_65 v_~b$r_buff0_thd3~0_63) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= v_~b$w_buff0~0_176 1) (= v_~b$w_buff0_used~0_320 1) (= v_~b$r_buff0_thd4~0_125 v_~b$r_buff1_thd4~0_128) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~b$r_buff1_thd1~0_95 v_~b$r_buff0_thd1~0_101) (= v_~b$w_buff1~0_150 v_~b$w_buff0~0_177) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| 0)) (= (ite (not (and (not (= (mod v_~b$w_buff1_used~0_290 256) 0)) (not (= (mod v_~b$w_buff0_used~0_320 256) 0)))) 1 0) |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$r_buff0_thd1~0_100 1) (= v_~b$r_buff1_thd0~0_89 v_~b$r_buff0_thd0~0_82) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|) (= v_~b$w_buff0_used~0_321 v_~b$w_buff1_used~0_290)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_321, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_101, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~b$w_buff0~0=v_~b$w_buff0~0_177, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_100, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_65, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_63, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_95, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_89, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_320, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_290, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_15|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_128, ~b$w_buff1~0=v_~b$w_buff1~0_150, ~b$w_buff0~0=v_~b$w_buff0~0_176, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_15|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_125, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_69, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_65, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_82} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] [2022-12-06 06:25:21,044 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:25:21,045 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 509 [2022-12-06 06:25:21,045 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 847 flow [2022-12-06 06:25:21,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:21,046 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:21,046 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:21,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:25:21,046 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:21,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:21,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1707639268, now seen corresponding path program 1 times [2022-12-06 06:25:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:21,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485872099] [2022-12-06 06:25:21,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:21,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:25:21,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:21,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485872099] [2022-12-06 06:25:21,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485872099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:21,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:21,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:25:21,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321297740] [2022-12-06 06:25:21,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:21,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:25:21,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:21,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:25:21,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:25:21,279 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 06:25:21,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 847 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:21,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:21,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 06:25:21,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:21,998 INFO L130 PetriNetUnfolder]: 3328/5498 cut-off events. [2022-12-06 06:25:21,998 INFO L131 PetriNetUnfolder]: For 28221/28275 co-relation queries the response was YES. [2022-12-06 06:25:22,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26980 conditions, 5498 events. 3328/5498 cut-off events. For 28221/28275 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 35335 event pairs, 528 based on Foata normal form. 16/5474 useless extension candidates. Maximal degree in co-relation 26941. Up to 2906 conditions per place. [2022-12-06 06:25:22,037 INFO L137 encePairwiseOnDemand]: 24/36 looper letters, 83 selfloop transitions, 2 changer transitions 67/154 dead transitions. [2022-12-06 06:25:22,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 154 transitions, 1655 flow [2022-12-06 06:25:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:25:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:25:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-12-06 06:25:22,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-06 06:25:22,039 INFO L175 Difference]: Start difference. First operand has 82 places, 86 transitions, 847 flow. Second operand 4 states and 68 transitions. [2022-12-06 06:25:22,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 154 transitions, 1655 flow [2022-12-06 06:25:22,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 154 transitions, 1602 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 06:25:22,167 INFO L231 Difference]: Finished difference. Result has 83 places, 62 transitions, 509 flow [2022-12-06 06:25:22,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=509, PETRI_PLACES=83, PETRI_TRANSITIONS=62} [2022-12-06 06:25:22,167 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 35 predicate places. [2022-12-06 06:25:22,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:22,167 INFO L89 Accepts]: Start accepts. Operand has 83 places, 62 transitions, 509 flow [2022-12-06 06:25:22,168 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:22,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:22,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 62 transitions, 509 flow [2022-12-06 06:25:22,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 62 transitions, 509 flow [2022-12-06 06:25:22,231 INFO L130 PetriNetUnfolder]: 294/749 cut-off events. [2022-12-06 06:25:22,231 INFO L131 PetriNetUnfolder]: For 4635/4859 co-relation queries the response was YES. [2022-12-06 06:25:22,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 749 events. 294/749 cut-off events. For 4635/4859 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5273 event pairs, 30 based on Foata normal form. 78/790 useless extension candidates. Maximal degree in co-relation 2838. Up to 219 conditions per place. [2022-12-06 06:25:22,239 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 62 transitions, 509 flow [2022-12-06 06:25:22,239 INFO L188 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-06 06:25:22,240 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:22,241 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 06:25:22,241 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 62 transitions, 509 flow [2022-12-06 06:25:22,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:22,241 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:22,241 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:22,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:25:22,241 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:22,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:22,242 INFO L85 PathProgramCache]: Analyzing trace with hash -737357445, now seen corresponding path program 1 times [2022-12-06 06:25:22,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:22,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213645708] [2022-12-06 06:25:22,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:22,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:25:22,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:22,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213645708] [2022-12-06 06:25:22,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213645708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:22,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:22,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:25:22,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522246849] [2022-12-06 06:25:22,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:22,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:25:22,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:22,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:25:22,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:25:22,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:25:22,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 62 transitions, 509 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:22,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:22,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:25:22,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:22,919 INFO L130 PetriNetUnfolder]: 1708/2791 cut-off events. [2022-12-06 06:25:22,919 INFO L131 PetriNetUnfolder]: For 13508/13508 co-relation queries the response was YES. [2022-12-06 06:25:22,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13684 conditions, 2791 events. 1708/2791 cut-off events. For 13508/13508 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 15301 event pairs, 352 based on Foata normal form. 2/2792 useless extension candidates. Maximal degree in co-relation 13646. Up to 1213 conditions per place. [2022-12-06 06:25:22,936 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 63 selfloop transitions, 3 changer transitions 61/127 dead transitions. [2022-12-06 06:25:22,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 127 transitions, 1245 flow [2022-12-06 06:25:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:25:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:25:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 06:25:22,938 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2022-12-06 06:25:22,938 INFO L175 Difference]: Start difference. First operand has 78 places, 62 transitions, 509 flow. Second operand 5 states and 55 transitions. [2022-12-06 06:25:22,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 127 transitions, 1245 flow [2022-12-06 06:25:22,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 127 transitions, 1204 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-06 06:25:22,990 INFO L231 Difference]: Finished difference. Result has 77 places, 44 transitions, 326 flow [2022-12-06 06:25:22,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=77, PETRI_TRANSITIONS=44} [2022-12-06 06:25:22,991 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 29 predicate places. [2022-12-06 06:25:22,991 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:22,991 INFO L89 Accepts]: Start accepts. Operand has 77 places, 44 transitions, 326 flow [2022-12-06 06:25:22,993 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:22,993 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:22,993 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 44 transitions, 326 flow [2022-12-06 06:25:22,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 44 transitions, 326 flow [2022-12-06 06:25:23,016 INFO L130 PetriNetUnfolder]: 74/206 cut-off events. [2022-12-06 06:25:23,016 INFO L131 PetriNetUnfolder]: For 1125/1270 co-relation queries the response was YES. [2022-12-06 06:25:23,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 206 events. 74/206 cut-off events. For 1125/1270 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 983 event pairs, 4 based on Foata normal form. 26/218 useless extension candidates. Maximal degree in co-relation 740. Up to 62 conditions per place. [2022-12-06 06:25:23,019 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 44 transitions, 326 flow [2022-12-06 06:25:23,019 INFO L188 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-06 06:25:23,219 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:25:23,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 229 [2022-12-06 06:25:23,220 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 44 transitions, 331 flow [2022-12-06 06:25:23,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:23,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:23,220 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:23,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:25:23,220 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:23,221 INFO L85 PathProgramCache]: Analyzing trace with hash -625879697, now seen corresponding path program 1 times [2022-12-06 06:25:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:23,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033994524] [2022-12-06 06:25:23,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:23,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:25:24,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:24,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033994524] [2022-12-06 06:25:24,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033994524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:24,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:24,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:25:24,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836025743] [2022-12-06 06:25:24,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:24,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:25:24,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:24,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:25:24,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:25:24,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 06:25:24,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 44 transitions, 331 flow. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:24,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:24,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 06:25:24,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:24,414 INFO L130 PetriNetUnfolder]: 719/1231 cut-off events. [2022-12-06 06:25:24,414 INFO L131 PetriNetUnfolder]: For 4689/4705 co-relation queries the response was YES. [2022-12-06 06:25:24,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5645 conditions, 1231 events. 719/1231 cut-off events. For 4689/4705 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6025 event pairs, 84 based on Foata normal form. 2/1225 useless extension candidates. Maximal degree in co-relation 5610. Up to 526 conditions per place. [2022-12-06 06:25:24,421 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 74 selfloop transitions, 5 changer transitions 44/124 dead transitions. [2022-12-06 06:25:24,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 124 transitions, 1059 flow [2022-12-06 06:25:24,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:25:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:25:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-06 06:25:24,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4226190476190476 [2022-12-06 06:25:24,423 INFO L175 Difference]: Start difference. First operand has 71 places, 44 transitions, 331 flow. Second operand 7 states and 71 transitions. [2022-12-06 06:25:24,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 124 transitions, 1059 flow [2022-12-06 06:25:24,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 1015 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-12-06 06:25:24,437 INFO L231 Difference]: Finished difference. Result has 71 places, 42 transitions, 316 flow [2022-12-06 06:25:24,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=316, PETRI_PLACES=71, PETRI_TRANSITIONS=42} [2022-12-06 06:25:24,437 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 23 predicate places. [2022-12-06 06:25:24,437 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:24,437 INFO L89 Accepts]: Start accepts. Operand has 71 places, 42 transitions, 316 flow [2022-12-06 06:25:24,438 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:24,438 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:24,438 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 42 transitions, 316 flow [2022-12-06 06:25:24,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 42 transitions, 316 flow [2022-12-06 06:25:24,457 INFO L130 PetriNetUnfolder]: 95/243 cut-off events. [2022-12-06 06:25:24,457 INFO L131 PetriNetUnfolder]: For 2008/2138 co-relation queries the response was YES. [2022-12-06 06:25:24,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 243 events. 95/243 cut-off events. For 2008/2138 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1226 event pairs, 6 based on Foata normal form. 37/267 useless extension candidates. Maximal degree in co-relation 837. Up to 77 conditions per place. [2022-12-06 06:25:24,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 42 transitions, 316 flow [2022-12-06 06:25:24,459 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-06 06:25:24,476 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L880-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~b$r_buff1_thd0~0_229 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd0~0_219 256) 0))) (.cse4 (not (= (mod v_~b$w_buff0_used~0_622 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~b$w_buff1_used~0_525 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~b$w_buff0_used~0_623 256) 0))))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_71| 0)) (= v_~main$tmp_guard1~0_86 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EAX~0_109 0) (= v_~__unbuffered_p3_EAX~0_98 1) (= v_~__unbuffered_p3_EBX~0_115 0) (= v_~__unbuffered_p1_EAX~0_98 0) (= v_~__unbuffered_p2_EAX~0_105 0))) 1 0)) 0 1)) (= v_~b$w_buff1_used~0_524 (ite (or .cse0 .cse1) 0 v_~b$w_buff1_used~0_525)) (= (ite .cse0 0 v_~b$r_buff0_thd0~0_219) v_~b$r_buff0_thd0~0_218) (= (ite .cse2 v_~b$w_buff0~0_396 (ite .cse1 v_~b$w_buff1~0_312 v_~b~0_430)) v_~b~0_429) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73| (mod v_~main$tmp_guard0~0_70 256)) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|) (= (ite .cse2 0 v_~b$w_buff0_used~0_623) v_~b$w_buff0_used~0_622) (= (ite (= (ite (= v_~__unbuffered_cnt~0_297 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_70) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|) (= v_~b$r_buff1_thd0~0_228 (ite (or (and .cse3 (not (= (mod v_~b$w_buff1_used~0_524 256) 0))) (and (not (= (mod v_~b$r_buff0_thd0~0_218 256) 0)) .cse4)) 0 v_~b$r_buff1_thd0~0_229))))) InVars {~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_229, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_115, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_623, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_109, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_525, ~b~0=v_~b~0_430, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_98, ~b$w_buff1~0=v_~b$w_buff1~0_312, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~b$w_buff0~0=v_~b$w_buff0~0_396, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_297, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_219} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_63|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_228, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_115, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_70, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_47|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_622, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_109, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_524, ~b~0=v_~b~0_429, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_71|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_98, ~b$w_buff1~0=v_~b$w_buff1~0_312, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~b$w_buff0~0=v_~b$w_buff0~0_396, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_297, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_218, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~b$r_buff1_thd0~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~b$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~b$w_buff1_used~0, ~b~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~b$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [542] $Ultimate##0-->L770: Formula: (and (= v_~b$w_buff1~0_266 v_~b$w_buff0~0_321) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_69| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_69|) (= v_~b$r_buff0_thd3~0_137 v_~b$r_buff1_thd3~0_142) (= v_~b$r_buff0_thd1~0_219 v_~b$r_buff1_thd1~0_159) (= v_~b$r_buff0_thd2~0_139 v_~b$r_buff1_thd2~0_146) (= v_~b$r_buff0_thd4~0_225 v_~b$r_buff1_thd4~0_235) (= v_~b$w_buff0~0_320 1) (= v_~b$w_buff0_used~0_541 v_~b$w_buff1_used~0_472) (= v_~b$w_buff0_used~0_540 1) (= v_~b$r_buff0_thd1~0_218 1) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_69| 0)) (= v_~x~0_44 v_~__unbuffered_p0_EAX~0_85) (= |v_P0Thread1of1ForFork1_~arg#1.offset_61| |v_P0Thread1of1ForFork1_#in~arg#1.offset_61|) (= |v_P0Thread1of1ForFork1_~arg#1.base_61| |v_P0Thread1of1ForFork1_#in~arg#1.base_61|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_69| (ite (not (and (not (= (mod v_~b$w_buff0_used~0_540 256) 0)) (not (= 0 (mod v_~b$w_buff1_used~0_472 256))))) 1 0)) (= v_~b$r_buff0_thd0~0_176 v_~b$r_buff1_thd0~0_186)) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_541, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_219, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_139, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_137, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_61|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_61|, ~b$w_buff0~0=v_~b$w_buff0~0_321, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_225, ~x~0=v_~x~0_44, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_176} OutVars{~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_218, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_139, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_137, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_159, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_186, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_61|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_61|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_61|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_61|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_540, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_472, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_69|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_235, ~b$w_buff1~0=v_~b$w_buff1~0_266, ~b$w_buff0~0=v_~b$w_buff0~0_320, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_69|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_225, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_146, ~x~0=v_~x~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_142, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_176} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, ~b$w_buff0_used~0, ~__unbuffered_p0_EAX~0, ~b$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] [2022-12-06 06:25:24,765 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:25:24,766 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 329 [2022-12-06 06:25:24,767 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 42 transitions, 342 flow [2022-12-06 06:25:24,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:24,767 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:24,767 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:24,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:25:24,768 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:25:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash 379424205, now seen corresponding path program 1 times [2022-12-06 06:25:24,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:24,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161054208] [2022-12-06 06:25:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:24,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:25:24,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:25:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:25:24,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:25:24,878 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:25:24,879 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:25:24,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:25:24,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:25:24,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:25:24,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:25:24,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:25:24,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:25:24,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 06:25:24,882 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:24,887 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:25:24,887 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:25:24,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:25:24 BasicIcfg [2022-12-06 06:25:24,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:25:24,949 INFO L158 Benchmark]: Toolchain (without parser) took 41066.48ms. Allocated memory was 203.4MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 178.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 655.6MB. Max. memory is 8.0GB. [2022-12-06 06:25:24,949 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory is still 180.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:25:24,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.08ms. Allocated memory is still 203.4MB. Free memory was 178.8MB in the beginning and 150.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:25:24,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.27ms. Allocated memory is still 203.4MB. Free memory was 150.0MB in the beginning and 147.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:25:24,950 INFO L158 Benchmark]: Boogie Preprocessor took 33.97ms. Allocated memory is still 203.4MB. Free memory was 147.9MB in the beginning and 145.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:25:24,950 INFO L158 Benchmark]: RCFGBuilder took 739.29ms. Allocated memory is still 203.4MB. Free memory was 145.8MB in the beginning and 107.5MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-06 06:25:24,951 INFO L158 Benchmark]: TraceAbstraction took 39693.37ms. Allocated memory was 203.4MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 107.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 584.3MB. Max. memory is 8.0GB. [2022-12-06 06:25:24,952 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory is still 180.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 546.08ms. Allocated memory is still 203.4MB. Free memory was 178.8MB in the beginning and 150.5MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.27ms. Allocated memory is still 203.4MB. Free memory was 150.0MB in the beginning and 147.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.97ms. Allocated memory is still 203.4MB. Free memory was 147.9MB in the beginning and 145.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 739.29ms. Allocated memory is still 203.4MB. Free memory was 145.8MB in the beginning and 107.5MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 39693.37ms. Allocated memory was 203.4MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 107.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 584.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 141 PlacesBefore, 48 PlacesAfterwards, 130 TransitionsBefore, 36 TransitionsAfterwards, 3270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 45 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2522, independent: 2447, independent conditional: 2447, independent unconditional: 0, dependent: 75, dependent conditional: 75, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2522, independent: 2447, independent conditional: 0, independent unconditional: 2447, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2522, independent: 2447, independent conditional: 0, independent unconditional: 2447, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2522, independent: 2447, independent conditional: 0, independent unconditional: 2447, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2063, independent: 2018, independent conditional: 0, independent unconditional: 2018, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2063, independent: 1989, independent conditional: 0, independent unconditional: 1989, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 333, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 293, dependent conditional: 0, dependent unconditional: 293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2522, independent: 429, independent conditional: 0, independent unconditional: 429, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 2063, unknown conditional: 0, unknown unconditional: 2063] , Statistics on independence cache: Total cache size (in pairs): 3373, Positive cache size: 3328, Positive conditional cache size: 0, Positive unconditional cache size: 3328, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, independent: 156, independent conditional: 156, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 186, independent: 156, independent conditional: 22, independent unconditional: 134, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 186, independent: 156, independent conditional: 22, independent unconditional: 134, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 186, independent: 156, independent conditional: 22, independent unconditional: 134, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 173, independent: 148, independent conditional: 21, independent unconditional: 127, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 173, independent: 142, independent conditional: 0, independent unconditional: 142, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 95, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 89, dependent conditional: 56, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 186, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 173, unknown conditional: 31, unknown unconditional: 142] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 148, Positive conditional cache size: 21, Positive unconditional cache size: 127, Negative cache size: 25, Negative conditional cache size: 10, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 319, independent: 266, independent conditional: 266, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 319, independent: 266, independent conditional: 14, independent unconditional: 252, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 319, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 319, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 319, independent: 241, independent conditional: 0, independent unconditional: 241, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 37, unknown conditional: 0, unknown unconditional: 37] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 181, Positive conditional cache size: 22, Positive unconditional cache size: 159, Negative cache size: 37, Negative conditional cache size: 10, Negative unconditional cache size: 27, 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, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108, independent: 85, independent conditional: 7, independent unconditional: 78, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 85, independent conditional: 7, independent unconditional: 78, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 85, independent conditional: 7, independent unconditional: 78, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, independent: 85, independent conditional: 7, independent unconditional: 78, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 181, Positive conditional cache size: 22, Positive unconditional cache size: 159, Negative cache size: 39, Negative conditional cache size: 10, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 77, independent conditional: 3, independent unconditional: 74, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 77, independent conditional: 3, independent unconditional: 74, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 77, independent conditional: 3, independent unconditional: 74, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 73, independent conditional: 3, independent unconditional: 70, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 185, Positive conditional cache size: 22, Positive unconditional cache size: 163, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 50 PlacesBefore, 49 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 814 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 232, independent: 206, independent conditional: 206, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 232, independent: 206, independent conditional: 74, independent unconditional: 132, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 232, independent: 206, independent conditional: 74, independent unconditional: 132, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 232, independent: 206, independent conditional: 74, independent unconditional: 132, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 232, independent: 199, independent conditional: 67, independent unconditional: 132, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 194, Positive conditional cache size: 29, Positive unconditional cache size: 165, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 53 PlacesBefore, 53 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 236, independent: 208, independent conditional: 208, 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: 236, independent: 208, independent conditional: 62, independent unconditional: 146, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 236, independent: 208, independent conditional: 62, independent unconditional: 146, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 236, independent: 208, independent conditional: 62, independent unconditional: 146, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 1, independent unconditional: 8, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 236, independent: 199, independent conditional: 61, independent unconditional: 138, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 9, unknown conditional: 1, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 207, Positive conditional cache size: 30, Positive unconditional cache size: 177, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 55 PlacesBefore, 55 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 924 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 142, independent conditional: 142, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 151, independent: 142, independent conditional: 89, independent unconditional: 53, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 142, independent conditional: 68, independent unconditional: 74, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 142, independent conditional: 68, independent unconditional: 74, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 20, independent unconditional: 4, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 151, independent: 118, independent conditional: 48, independent unconditional: 70, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 24, unknown conditional: 20, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 252, Positive conditional cache size: 50, Positive unconditional cache size: 202, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 62 PlacesBefore, 62 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1060 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 94, independent: 88, independent conditional: 74, independent unconditional: 14, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 94, independent: 88, independent conditional: 56, independent unconditional: 32, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, independent: 88, independent conditional: 56, independent unconditional: 32, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 94, independent: 84, independent conditional: 52, independent unconditional: 32, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 263, Positive conditional cache size: 54, Positive unconditional cache size: 209, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1072 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, 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: 21, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 263, Positive conditional cache size: 54, Positive unconditional cache size: 209, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 71 PlacesBefore, 70 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 982 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 36, independent conditional: 30, independent unconditional: 6, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 36, independent conditional: 18, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 36, independent conditional: 18, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 42, independent: 36, independent conditional: 18, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 265, Positive conditional cache size: 54, Positive unconditional cache size: 211, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, 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: 2.3s, 79 PlacesBefore, 76 PlacesAfterwards, 99 TransitionsBefore, 96 TransitionsAfterwards, 1364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 171, independent conditional: 171, 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: 171, independent: 171, independent conditional: 171, 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: 171, independent: 171, independent conditional: 150, 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: 171, independent: 171, independent conditional: 150, 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: 11, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 171, independent: 160, independent conditional: 141, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 9, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 512, Positive cache size: 467, Positive conditional cache size: 72, Positive unconditional cache size: 395, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 86 PlacesBefore, 85 PlacesAfterwards, 119 TransitionsBefore, 118 TransitionsAfterwards, 1388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 30, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 30, independent: 30, independent conditional: 0, independent unconditional: 30, 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): 600, Positive cache size: 555, Positive conditional cache size: 78, Positive unconditional cache size: 477, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 83 PlacesBefore, 82 PlacesAfterwards, 87 TransitionsBefore, 86 TransitionsAfterwards, 930 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 104, independent conditional: 104, 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: 104, independent: 104, independent conditional: 83, independent unconditional: 21, 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: 104, independent: 104, independent conditional: 72, independent unconditional: 32, 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: 104, independent: 104, independent conditional: 72, independent unconditional: 32, 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: 25, independent: 25, independent conditional: 11, independent unconditional: 14, 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: 25, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 104, independent: 79, independent conditional: 61, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 25, unknown conditional: 11, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 684, Positive cache size: 639, Positive conditional cache size: 95, Positive unconditional cache size: 544, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 546 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): 684, Positive cache size: 639, Positive conditional cache size: 95, Positive unconditional cache size: 544, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, 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, 71 PlacesBefore, 71 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 17, independent unconditional: 2, 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: 19, independent: 19, independent conditional: 16, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 16, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 19, independent: 10, independent conditional: 7, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 696, Positive cache size: 651, Positive conditional cache size: 104, Positive unconditional cache size: 547, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 68 PlacesBefore, 68 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 11, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 11, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 11, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 11, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 728, Positive cache size: 683, Positive conditional cache size: 117, Positive unconditional cache size: 566, Negative cache size: 45, Negative conditional cache size: 10, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t937, ((void *)0), P0, ((void *)0))=-1, t937={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t938, ((void *)0), P1, ((void *)0))=0, t937={5:0}, t938={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t939; [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t939, ((void *)0), P2, ((void *)0))=1, t937={5:0}, t938={6:0}, t939={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t940; [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t940, ((void *)0), P3, ((void *)0))=2, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = a [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 880]: 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: 874]: 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: 876]: 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: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 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: 39.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 892 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 892 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2869 IncrementalHoareTripleChecker+Invalid, 3042 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 29 mSDtfsCounter, 2869 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1337occurred in iteration=12, InterpolantAutomatonStates: 99, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 2690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:25:24,989 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...