/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:54:21,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:54:21,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:54:21,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:54:21,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:54:21,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:54:21,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:54:21,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:54:21,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:54:21,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:54:21,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:54:21,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:54:21,124 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:54:21,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:54:21,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:54:21,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:54:21,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:54:21,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:54:21,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:54:21,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:54:21,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:54:21,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:54:21,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:54:21,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:54:21,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:54:21,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:54:21,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:54:21,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:54:21,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:54:21,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:54:21,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:54:21,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:54:21,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:54:21,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:54:21,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:54:21,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:54:21,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:54:21,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:54:21,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:54:21,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:54:21,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:54:21,148 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:54:21,175 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:54:21,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:54:21,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:54:21,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:54:21,178 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:54:21,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:54:21,178 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:54:21,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:54:21,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:54:21,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:54:21,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:54:21,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:54:21,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:54:21,179 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:54:21,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:54:21,180 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:54:21,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:54:21,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:54:21,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:54:21,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:54:21,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:54:21,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:54:21,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:54:21,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:54:21,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:54:21,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:54:21,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:54:21,181 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:54:21,181 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:54:21,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:54:21,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:54:21,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:54:21,465 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:54:21,466 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:54:21,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2022-12-13 00:54:22,633 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:54:22,870 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:54:22,871 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2022-12-13 00:54:22,899 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bde486547/e94d1757d68e4306b6639346da84303d/FLAG459f6b2d1 [2022-12-13 00:54:22,912 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bde486547/e94d1757d68e4306b6639346da84303d [2022-12-13 00:54:22,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:54:22,916 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:54:22,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:54:22,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:54:22,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:54:22,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:54:22" (1/1) ... [2022-12-13 00:54:22,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f57a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:22, skipping insertion in model container [2022-12-13 00:54:22,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:54:22" (1/1) ... [2022-12-13 00:54:22,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:54:22,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:54:23,073 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/thin002_power.oepc.i[995,1008] [2022-12-13 00:54:23,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:54:23,268 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:54:23,276 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/thin002_power.oepc.i[995,1008] [2022-12-13 00:54:23,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:54:23,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:54:23,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:54:23,391 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:54:23,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:23 WrapperNode [2022-12-13 00:54:23,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:54:23,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:54:23,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:54:23,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:54:23,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:23" (1/1) ... [2022-12-13 00:54:23,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:23" (1/1) ... [2022-12-13 00:54:23,472 INFO L138 Inliner]: procedures = 177, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 154 [2022-12-13 00:54:23,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:54:23,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:54:23,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:54:23,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:54:23,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:23" (1/1) ... [2022-12-13 00:54:23,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:23" (1/1) ... [2022-12-13 00:54:23,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:23" (1/1) ... [2022-12-13 00:54:23,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:23" (1/1) ... [2022-12-13 00:54:23,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:23" (1/1) ... [2022-12-13 00:54:23,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:23" (1/1) ... [2022-12-13 00:54:23,502 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:23" (1/1) ... [2022-12-13 00:54:23,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:23" (1/1) ... [2022-12-13 00:54:23,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:54:23,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:54:23,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:54:23,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:54:23,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:23" (1/1) ... [2022-12-13 00:54:23,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:54:23,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:54:23,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:54:23,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:54:23,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 00:54:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:54:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:54:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:54:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:54:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:54:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:54:23,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:54:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:54:23,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:54:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:54:23,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:54:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 00:54:23,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 00:54:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:54:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:54:23,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:54:23,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:54:23,576 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:54:23,696 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:54:23,697 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:54:24,082 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:54:24,302 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:54:24,302 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:54:24,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:54:24 BoogieIcfgContainer [2022-12-13 00:54:24,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:54:24,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:54:24,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:54:24,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:54:24,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:54:22" (1/3) ... [2022-12-13 00:54:24,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be3654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:54:24, skipping insertion in model container [2022-12-13 00:54:24,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:54:23" (2/3) ... [2022-12-13 00:54:24,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be3654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:54:24, skipping insertion in model container [2022-12-13 00:54:24,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:54:24" (3/3) ... [2022-12-13 00:54:24,316 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.oepc.i [2022-12-13 00:54:24,363 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:54:24,363 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 00:54:24,364 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:54:24,458 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:54:24,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 314 flow [2022-12-13 00:54:24,533 INFO L130 PetriNetUnfolder]: 2/143 cut-off events. [2022-12-13 00:54:24,533 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:24,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 2/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-12-13 00:54:24,538 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 147 transitions, 314 flow [2022-12-13 00:54:24,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 129 transitions, 270 flow [2022-12-13 00:54:24,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:24,554 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 129 transitions, 270 flow [2022-12-13 00:54:24,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 129 transitions, 270 flow [2022-12-13 00:54:24,581 INFO L130 PetriNetUnfolder]: 1/129 cut-off events. [2022-12-13 00:54:24,581 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:24,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 1/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 00:54:24,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 129 transitions, 270 flow [2022-12-13 00:54:24,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 1822 [2022-12-13 00:54:31,313 INFO L241 LiptonReduction]: Total number of compositions: 106 [2022-12-13 00:54:31,325 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:54:31,329 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;@76182b8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:54:31,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 00:54:31,334 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 00:54:31,334 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:31,334 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:31,335 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:31,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1769412039, now seen corresponding path program 1 times [2022-12-13 00:54:31,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:31,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940574653] [2022-12-13 00:54:31,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:31,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:31,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:31,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:31,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940574653] [2022-12-13 00:54:31,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940574653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:31,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:31,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:54:31,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261734974] [2022-12-13 00:54:31,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:31,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 00:54:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:31,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 00:54:31,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 00:54:31,546 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2022-12-13 00:54:31,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 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-13 00:54:31,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:31,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2022-12-13 00:54:31,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:32,317 INFO L130 PetriNetUnfolder]: 3927/5663 cut-off events. [2022-12-13 00:54:32,317 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-13 00:54:32,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11215 conditions, 5663 events. 3927/5663 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 32148 event pairs, 3927 based on Foata normal form. 0/4248 useless extension candidates. Maximal degree in co-relation 11203. Up to 5377 conditions per place. [2022-12-13 00:54:32,350 INFO L137 encePairwiseOnDemand]: 36/37 looper letters, 24 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2022-12-13 00:54:32,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 36 transitions, 132 flow [2022-12-13 00:54:32,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 00:54:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 00:54:32,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2022-12-13 00:54:32,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6621621621621622 [2022-12-13 00:54:32,362 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 2 states and 49 transitions. [2022-12-13 00:54:32,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 36 transitions, 132 flow [2022-12-13 00:54:32,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 36 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:54:32,368 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 80 flow [2022-12-13 00:54:32,369 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2022-12-13 00:54:32,374 INFO L295 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2022-12-13 00:54:32,374 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:32,375 INFO L89 Accepts]: Start accepts. Operand has 46 places, 36 transitions, 80 flow [2022-12-13 00:54:32,377 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:32,377 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:32,377 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 36 transitions, 80 flow [2022-12-13 00:54:32,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 80 flow [2022-12-13 00:54:32,390 INFO L130 PetriNetUnfolder]: 0/36 cut-off events. [2022-12-13 00:54:32,390 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:32,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 00:54:32,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 80 flow [2022-12-13 00:54:32,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 762 [2022-12-13 00:54:32,620 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:32,621 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 247 [2022-12-13 00:54:32,622 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 80 flow [2022-12-13 00:54:32,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 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-13 00:54:32,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:32,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:32,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:54:32,622 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:32,623 INFO L85 PathProgramCache]: Analyzing trace with hash -402077319, now seen corresponding path program 1 times [2022-12-13 00:54:32,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:32,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434027583] [2022-12-13 00:54:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:32,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:32,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434027583] [2022-12-13 00:54:32,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434027583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:32,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:32,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:54:32,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013397669] [2022-12-13 00:54:32,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:32,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:32,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:32,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:32,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:32,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2022-12-13 00:54:32,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:32,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:32,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2022-12-13 00:54:32,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:33,541 INFO L130 PetriNetUnfolder]: 3663/5655 cut-off events. [2022-12-13 00:54:33,541 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:33,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10859 conditions, 5655 events. 3663/5655 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 36391 event pairs, 735 based on Foata normal form. 80/4440 useless extension candidates. Maximal degree in co-relation 10851. Up to 4145 conditions per place. [2022-12-13 00:54:33,569 INFO L137 encePairwiseOnDemand]: 33/36 looper letters, 36 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-13 00:54:33,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 186 flow [2022-12-13 00:54:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-13 00:54:33,572 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2022-12-13 00:54:33,573 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 80 flow. Second operand 3 states and 75 transitions. [2022-12-13 00:54:33,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 186 flow [2022-12-13 00:54:33,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:54:33,574 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 88 flow [2022-12-13 00:54:33,575 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2022-12-13 00:54:33,575 INFO L295 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2022-12-13 00:54:33,575 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:33,575 INFO L89 Accepts]: Start accepts. Operand has 48 places, 36 transitions, 88 flow [2022-12-13 00:54:33,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:33,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:33,576 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 88 flow [2022-12-13 00:54:33,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 88 flow [2022-12-13 00:54:33,583 INFO L130 PetriNetUnfolder]: 0/36 cut-off events. [2022-12-13 00:54:33,584 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:54:33,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:54:33,584 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 88 flow [2022-12-13 00:54:33,584 INFO L226 LiptonReduction]: Number of co-enabled transitions 758 [2022-12-13 00:54:33,586 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:33,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 00:54:33,588 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 88 flow [2022-12-13 00:54:33,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:33,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:33,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:33,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:54:33,589 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:33,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:33,590 INFO L85 PathProgramCache]: Analyzing trace with hash 420505774, now seen corresponding path program 1 times [2022-12-13 00:54:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:33,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37457860] [2022-12-13 00:54:33,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:33,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:33,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:33,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37457860] [2022-12-13 00:54:33,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37457860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:33,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:33,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:54:33,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298334060] [2022-12-13 00:54:33,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:33,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:33,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:33,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:33,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:33,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2022-12-13 00:54:33,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:33,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:33,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2022-12-13 00:54:33,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:34,280 INFO L130 PetriNetUnfolder]: 3511/5375 cut-off events. [2022-12-13 00:54:34,280 INFO L131 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2022-12-13 00:54:34,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11118 conditions, 5375 events. 3511/5375 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 33408 event pairs, 855 based on Foata normal form. 48/4168 useless extension candidates. Maximal degree in co-relation 11107. Up to 3761 conditions per place. [2022-12-13 00:54:34,306 INFO L137 encePairwiseOnDemand]: 33/36 looper letters, 33 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2022-12-13 00:54:34,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 183 flow [2022-12-13 00:54:34,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:34,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:34,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-13 00:54:34,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:54:34,308 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 88 flow. Second operand 3 states and 72 transitions. [2022-12-13 00:54:34,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 183 flow [2022-12-13 00:54:34,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 177 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:54:34,310 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 92 flow [2022-12-13 00:54:34,310 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-12-13 00:54:34,310 INFO L295 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2022-12-13 00:54:34,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:34,310 INFO L89 Accepts]: Start accepts. Operand has 49 places, 36 transitions, 92 flow [2022-12-13 00:54:34,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:34,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:34,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 92 flow [2022-12-13 00:54:34,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 92 flow [2022-12-13 00:54:34,315 INFO L130 PetriNetUnfolder]: 0/36 cut-off events. [2022-12-13 00:54:34,315 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:54:34,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 36 events. 0/36 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:54:34,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 36 transitions, 92 flow [2022-12-13 00:54:34,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 754 [2022-12-13 00:54:34,362 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:34,363 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 00:54:34,363 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 92 flow [2022-12-13 00:54:34,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:34,363 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:34,363 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:34,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:54:34,363 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:34,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1051627369, now seen corresponding path program 1 times [2022-12-13 00:54:34,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:34,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621782588] [2022-12-13 00:54:34,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:34,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:34,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:34,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621782588] [2022-12-13 00:54:34,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621782588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:34,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:34,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:54:34,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080046298] [2022-12-13 00:54:34,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:34,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:54:34,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:34,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:54:34,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:54:34,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2022-12-13 00:54:34,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:34,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:34,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2022-12-13 00:54:34,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:35,033 INFO L130 PetriNetUnfolder]: 3359/4995 cut-off events. [2022-12-13 00:54:35,034 INFO L131 PetriNetUnfolder]: For 704/704 co-relation queries the response was YES. [2022-12-13 00:54:35,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10747 conditions, 4995 events. 3359/4995 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 28300 event pairs, 1465 based on Foata normal form. 48/3828 useless extension candidates. Maximal degree in co-relation 10735. Up to 3811 conditions per place. [2022-12-13 00:54:35,058 INFO L137 encePairwiseOnDemand]: 33/36 looper letters, 38 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2022-12-13 00:54:35,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 212 flow [2022-12-13 00:54:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:54:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:54:35,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-13 00:54:35,060 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7129629629629629 [2022-12-13 00:54:35,060 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 92 flow. Second operand 3 states and 77 transitions. [2022-12-13 00:54:35,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 212 flow [2022-12-13 00:54:35,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:54:35,063 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 96 flow [2022-12-13 00:54:35,063 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2022-12-13 00:54:35,064 INFO L295 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2022-12-13 00:54:35,064 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:35,064 INFO L89 Accepts]: Start accepts. Operand has 50 places, 36 transitions, 96 flow [2022-12-13 00:54:35,065 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:35,065 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:35,065 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 36 transitions, 96 flow [2022-12-13 00:54:35,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 36 transitions, 96 flow [2022-12-13 00:54:35,070 INFO L130 PetriNetUnfolder]: 0/36 cut-off events. [2022-12-13 00:54:35,071 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 00:54:35,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 0/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:54:35,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 36 transitions, 96 flow [2022-12-13 00:54:35,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 750 [2022-12-13 00:54:35,073 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:35,074 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 00:54:35,074 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 96 flow [2022-12-13 00:54:35,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:35,074 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:35,074 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:35,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:54:35,074 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:35,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:35,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1680584401, now seen corresponding path program 1 times [2022-12-13 00:54:35,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:35,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163631073] [2022-12-13 00:54:35,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:35,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:35,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:35,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163631073] [2022-12-13 00:54:35,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163631073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:35,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:35,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:35,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089280699] [2022-12-13 00:54:35,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:35,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:35,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:35,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:35,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:35,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2022-12-13 00:54:35,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:35,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:35,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2022-12-13 00:54:35,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:36,129 INFO L130 PetriNetUnfolder]: 5639/8447 cut-off events. [2022-12-13 00:54:36,129 INFO L131 PetriNetUnfolder]: For 2324/2324 co-relation queries the response was YES. [2022-12-13 00:54:36,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18344 conditions, 8447 events. 5639/8447 cut-off events. For 2324/2324 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 54500 event pairs, 1475 based on Foata normal form. 192/6600 useless extension candidates. Maximal degree in co-relation 18331. Up to 3048 conditions per place. [2022-12-13 00:54:36,169 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 42 selfloop transitions, 3 changer transitions 7/63 dead transitions. [2022-12-13 00:54:36,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 263 flow [2022-12-13 00:54:36,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-13 00:54:36,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6805555555555556 [2022-12-13 00:54:36,171 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 96 flow. Second operand 4 states and 98 transitions. [2022-12-13 00:54:36,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 263 flow [2022-12-13 00:54:36,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 255 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:54:36,175 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 106 flow [2022-12-13 00:54:36,175 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2022-12-13 00:54:36,177 INFO L295 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2022-12-13 00:54:36,177 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:36,177 INFO L89 Accepts]: Start accepts. Operand has 53 places, 36 transitions, 106 flow [2022-12-13 00:54:36,179 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:36,179 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:36,179 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 36 transitions, 106 flow [2022-12-13 00:54:36,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 36 transitions, 106 flow [2022-12-13 00:54:36,186 INFO L130 PetriNetUnfolder]: 0/36 cut-off events. [2022-12-13 00:54:36,186 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 00:54:36,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 36 events. 0/36 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:54:36,188 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 36 transitions, 106 flow [2022-12-13 00:54:36,188 INFO L226 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-13 00:54:36,223 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:54:36,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 00:54:36,226 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 104 flow [2022-12-13 00:54:36,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:36,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:36,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:36,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:54:36,226 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:36,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:36,227 INFO L85 PathProgramCache]: Analyzing trace with hash 945703528, now seen corresponding path program 1 times [2022-12-13 00:54:36,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:36,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978638963] [2022-12-13 00:54:36,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:36,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:36,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:36,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978638963] [2022-12-13 00:54:36,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978638963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:36,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:36,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:36,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642038435] [2022-12-13 00:54:36,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:36,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:36,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:36,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:36,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:36,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2022-12-13 00:54:36,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:36,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:36,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2022-12-13 00:54:36,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:37,012 INFO L130 PetriNetUnfolder]: 4511/7037 cut-off events. [2022-12-13 00:54:37,012 INFO L131 PetriNetUnfolder]: For 4632/4632 co-relation queries the response was YES. [2022-12-13 00:54:37,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15708 conditions, 7037 events. 4511/7037 cut-off events. For 4632/4632 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 46424 event pairs, 1127 based on Foata normal form. 180/5430 useless extension candidates. Maximal degree in co-relation 15693. Up to 2460 conditions per place. [2022-12-13 00:54:37,041 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 52 selfloop transitions, 3 changer transitions 5/70 dead transitions. [2022-12-13 00:54:37,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 323 flow [2022-12-13 00:54:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-12-13 00:54:37,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7285714285714285 [2022-12-13 00:54:37,042 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 104 flow. Second operand 4 states and 102 transitions. [2022-12-13 00:54:37,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 323 flow [2022-12-13 00:54:37,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 295 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 00:54:37,045 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 102 flow [2022-12-13 00:54:37,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2022-12-13 00:54:37,046 INFO L295 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2022-12-13 00:54:37,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:37,046 INFO L89 Accepts]: Start accepts. Operand has 52 places, 35 transitions, 102 flow [2022-12-13 00:54:37,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:37,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:37,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 35 transitions, 102 flow [2022-12-13 00:54:37,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 35 transitions, 102 flow [2022-12-13 00:54:37,051 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 00:54:37,051 INFO L131 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-12-13 00:54:37,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 35 events. 0/35 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 84 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:54:37,052 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 35 transitions, 102 flow [2022-12-13 00:54:37,052 INFO L226 LiptonReduction]: Number of co-enabled transitions 642 [2022-12-13 00:54:38,260 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:54:38,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1214 [2022-12-13 00:54:38,260 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 100 flow [2022-12-13 00:54:38,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:38,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:38,261 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:38,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:54:38,261 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:38,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:38,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1308795571, now seen corresponding path program 1 times [2022-12-13 00:54:38,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:38,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155310949] [2022-12-13 00:54:38,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:38,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:38,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:38,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155310949] [2022-12-13 00:54:38,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155310949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:38,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:38,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:54:38,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786272212] [2022-12-13 00:54:38,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:38,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:38,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:38,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:38,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:38,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 00:54:38,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:38,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:38,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 00:54:38,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:38,817 INFO L130 PetriNetUnfolder]: 3689/5699 cut-off events. [2022-12-13 00:54:38,818 INFO L131 PetriNetUnfolder]: For 2880/2880 co-relation queries the response was YES. [2022-12-13 00:54:38,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12503 conditions, 5699 events. 3689/5699 cut-off events. For 2880/2880 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 32534 event pairs, 1253 based on Foata normal form. 144/4265 useless extension candidates. Maximal degree in co-relation 12489. Up to 2017 conditions per place. [2022-12-13 00:54:38,839 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 38 selfloop transitions, 3 changer transitions 14/63 dead transitions. [2022-12-13 00:54:38,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 277 flow [2022-12-13 00:54:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 00:54:38,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2022-12-13 00:54:38,841 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 100 flow. Second operand 4 states and 92 transitions. [2022-12-13 00:54:38,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 277 flow [2022-12-13 00:54:38,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 265 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 00:54:38,844 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 100 flow [2022-12-13 00:54:38,844 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2022-12-13 00:54:38,844 INFO L295 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2022-12-13 00:54:38,844 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:38,845 INFO L89 Accepts]: Start accepts. Operand has 52 places, 33 transitions, 100 flow [2022-12-13 00:54:38,845 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:38,845 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:38,845 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 33 transitions, 100 flow [2022-12-13 00:54:38,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 33 transitions, 100 flow [2022-12-13 00:54:38,850 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 00:54:38,850 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 00:54:38,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 33 events. 0/33 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:54:38,851 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 33 transitions, 100 flow [2022-12-13 00:54:38,851 INFO L226 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-13 00:54:38,905 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:54:38,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 00:54:38,905 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 98 flow [2022-12-13 00:54:38,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:38,906 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:38,906 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:38,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:54:38,906 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:38,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:38,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1562209317, now seen corresponding path program 1 times [2022-12-13 00:54:38,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:38,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780844469] [2022-12-13 00:54:38,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:38,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:39,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:39,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780844469] [2022-12-13 00:54:39,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780844469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:39,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:39,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:54:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229338318] [2022-12-13 00:54:39,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:39,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:54:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:39,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:54:39,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:54:39,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 00:54:39,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 32 transitions, 98 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:39,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:39,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 00:54:39,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:40,107 INFO L130 PetriNetUnfolder]: 1785/2692 cut-off events. [2022-12-13 00:54:40,107 INFO L131 PetriNetUnfolder]: For 1431/1431 co-relation queries the response was YES. [2022-12-13 00:54:40,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6069 conditions, 2692 events. 1785/2692 cut-off events. For 1431/1431 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12189 event pairs, 465 based on Foata normal form. 27/1912 useless extension candidates. Maximal degree in co-relation 6055. Up to 1594 conditions per place. [2022-12-13 00:54:40,119 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 38 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-13 00:54:40,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 218 flow [2022-12-13 00:54:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:54:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:54:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-13 00:54:40,132 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.546875 [2022-12-13 00:54:40,132 INFO L175 Difference]: Start difference. First operand has 50 places, 32 transitions, 98 flow. Second operand 4 states and 70 transitions. [2022-12-13 00:54:40,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 218 flow [2022-12-13 00:54:40,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 202 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 00:54:40,135 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 92 flow [2022-12-13 00:54:40,135 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2022-12-13 00:54:40,135 INFO L295 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2022-12-13 00:54:40,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:40,135 INFO L89 Accepts]: Start accepts. Operand has 49 places, 32 transitions, 92 flow [2022-12-13 00:54:40,136 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:40,136 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:40,136 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 32 transitions, 92 flow [2022-12-13 00:54:40,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 32 transitions, 92 flow [2022-12-13 00:54:40,140 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 00:54:40,140 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:54:40,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 32 events. 0/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:54:40,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 32 transitions, 92 flow [2022-12-13 00:54:40,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-13 00:54:40,312 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:54:40,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-13 00:54:40,313 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 90 flow [2022-12-13 00:54:40,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:40,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:40,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:40,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:54:40,314 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:40,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1127473515, now seen corresponding path program 1 times [2022-12-13 00:54:40,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:40,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477537378] [2022-12-13 00:54:40,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:40,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:40,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:40,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477537378] [2022-12-13 00:54:40,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477537378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:40,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:40,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:54:40,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561406010] [2022-12-13 00:54:40,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:40,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:54:40,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:40,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:54:40,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:54:40,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-13 00:54:40,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:40,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:40,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-13 00:54:40,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:40,882 INFO L130 PetriNetUnfolder]: 5447/7604 cut-off events. [2022-12-13 00:54:40,882 INFO L131 PetriNetUnfolder]: For 1600/1600 co-relation queries the response was YES. [2022-12-13 00:54:40,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16968 conditions, 7604 events. 5447/7604 cut-off events. For 1600/1600 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 37747 event pairs, 2676 based on Foata normal form. 405/4311 useless extension candidates. Maximal degree in co-relation 16956. Up to 6322 conditions per place. [2022-12-13 00:54:40,915 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 37 selfloop transitions, 13 changer transitions 34/87 dead transitions. [2022-12-13 00:54:40,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 87 transitions, 407 flow [2022-12-13 00:54:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:54:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:54:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-13 00:54:40,917 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2022-12-13 00:54:40,917 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 90 flow. Second operand 5 states and 101 transitions. [2022-12-13 00:54:40,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 87 transitions, 407 flow [2022-12-13 00:54:40,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 87 transitions, 385 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-13 00:54:40,923 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 197 flow [2022-12-13 00:54:40,923 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2022-12-13 00:54:40,924 INFO L295 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2022-12-13 00:54:40,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:40,924 INFO L89 Accepts]: Start accepts. Operand has 51 places, 43 transitions, 197 flow [2022-12-13 00:54:40,925 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:40,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:40,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 43 transitions, 197 flow [2022-12-13 00:54:40,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 43 transitions, 197 flow [2022-12-13 00:54:41,086 INFO L130 PetriNetUnfolder]: 2025/3061 cut-off events. [2022-12-13 00:54:41,086 INFO L131 PetriNetUnfolder]: For 732/6450 co-relation queries the response was YES. [2022-12-13 00:54:41,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8660 conditions, 3061 events. 2025/3061 cut-off events. For 732/6450 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 19461 event pairs, 1296 based on Foata normal form. 0/1423 useless extension candidates. Maximal degree in co-relation 8649. Up to 2536 conditions per place. [2022-12-13 00:54:41,101 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 43 transitions, 197 flow [2022-12-13 00:54:41,102 INFO L226 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-13 00:54:44,150 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:54:44,151 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3227 [2022-12-13 00:54:44,151 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 200 flow [2022-12-13 00:54:44,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:44,152 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:44,152 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:44,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:54:44,152 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:44,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:44,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1159449412, now seen corresponding path program 1 times [2022-12-13 00:54:44,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:44,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26391133] [2022-12-13 00:54:44,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:44,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:44,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:44,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26391133] [2022-12-13 00:54:44,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26391133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:44,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:44,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:54:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101363849] [2022-12-13 00:54:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:44,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:54:44,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:44,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:54:44,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:54:44,310 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-13 00:54:44,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 200 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-13 00:54:44,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:44,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-13 00:54:44,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:44,862 INFO L130 PetriNetUnfolder]: 4719/6771 cut-off events. [2022-12-13 00:54:44,862 INFO L131 PetriNetUnfolder]: For 2623/2623 co-relation queries the response was YES. [2022-12-13 00:54:44,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25245 conditions, 6771 events. 4719/6771 cut-off events. For 2623/2623 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 34888 event pairs, 1119 based on Foata normal form. 399/3938 useless extension candidates. Maximal degree in co-relation 25231. Up to 5320 conditions per place. [2022-12-13 00:54:44,892 INFO L137 encePairwiseOnDemand]: 16/34 looper letters, 44 selfloop transitions, 25 changer transitions 32/104 dead transitions. [2022-12-13 00:54:44,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 104 transitions, 700 flow [2022-12-13 00:54:44,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:54:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:54:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2022-12-13 00:54:44,894 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5931372549019608 [2022-12-13 00:54:44,894 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 200 flow. Second operand 6 states and 121 transitions. [2022-12-13 00:54:44,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 104 transitions, 700 flow [2022-12-13 00:54:44,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 104 transitions, 685 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:54:44,953 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 385 flow [2022-12-13 00:54:44,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2022-12-13 00:54:44,954 INFO L295 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2022-12-13 00:54:44,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:44,954 INFO L89 Accepts]: Start accepts. Operand has 55 places, 55 transitions, 385 flow [2022-12-13 00:54:44,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:44,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:44,955 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 55 transitions, 385 flow [2022-12-13 00:54:44,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 385 flow [2022-12-13 00:54:45,149 INFO L130 PetriNetUnfolder]: 1809/2821 cut-off events. [2022-12-13 00:54:45,149 INFO L131 PetriNetUnfolder]: For 2534/6797 co-relation queries the response was YES. [2022-12-13 00:54:45,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12545 conditions, 2821 events. 1809/2821 cut-off events. For 2534/6797 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 17685 event pairs, 621 based on Foata normal form. 1/1342 useless extension candidates. Maximal degree in co-relation 12531. Up to 2308 conditions per place. [2022-12-13 00:54:45,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 55 transitions, 385 flow [2022-12-13 00:54:45,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-13 00:54:45,267 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:54:45,268 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 314 [2022-12-13 00:54:45,268 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 55 transitions, 391 flow [2022-12-13 00:54:45,268 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-13 00:54:45,268 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:45,269 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:45,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:54:45,269 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:45,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:45,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1279913437, now seen corresponding path program 1 times [2022-12-13 00:54:45,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:45,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349615088] [2022-12-13 00:54:45,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:45,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:45,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:45,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:45,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349615088] [2022-12-13 00:54:45,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349615088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:45,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:45,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:54:45,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54259320] [2022-12-13 00:54:45,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:45,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:54:45,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:45,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:54:45,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:54:45,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-13 00:54:45,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 55 transitions, 391 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:45,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:45,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-13 00:54:45,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:45,835 INFO L130 PetriNetUnfolder]: 3030/4728 cut-off events. [2022-12-13 00:54:45,835 INFO L131 PetriNetUnfolder]: For 4480/4480 co-relation queries the response was YES. [2022-12-13 00:54:45,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24420 conditions, 4728 events. 3030/4728 cut-off events. For 4480/4480 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 26778 event pairs, 255 based on Foata normal form. 360/2940 useless extension candidates. Maximal degree in co-relation 24403. Up to 3583 conditions per place. [2022-12-13 00:54:45,859 INFO L137 encePairwiseOnDemand]: 16/37 looper letters, 48 selfloop transitions, 37 changer transitions 30/118 dead transitions. [2022-12-13 00:54:45,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 118 transitions, 1069 flow [2022-12-13 00:54:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:54:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:54:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-12-13 00:54:45,861 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5328185328185329 [2022-12-13 00:54:45,861 INFO L175 Difference]: Start difference. First operand has 53 places, 55 transitions, 391 flow. Second operand 7 states and 138 transitions. [2022-12-13 00:54:45,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 118 transitions, 1069 flow [2022-12-13 00:54:45,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 118 transitions, 895 flow, removed 74 selfloop flow, removed 4 redundant places. [2022-12-13 00:54:45,974 INFO L231 Difference]: Finished difference. Result has 58 places, 67 transitions, 537 flow [2022-12-13 00:54:45,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=537, PETRI_PLACES=58, PETRI_TRANSITIONS=67} [2022-12-13 00:54:45,975 INFO L295 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2022-12-13 00:54:45,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:45,975 INFO L89 Accepts]: Start accepts. Operand has 58 places, 67 transitions, 537 flow [2022-12-13 00:54:45,976 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:45,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:45,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 67 transitions, 537 flow [2022-12-13 00:54:45,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 67 transitions, 537 flow [2022-12-13 00:54:46,124 INFO L130 PetriNetUnfolder]: 1161/2020 cut-off events. [2022-12-13 00:54:46,125 INFO L131 PetriNetUnfolder]: For 2419/4012 co-relation queries the response was YES. [2022-12-13 00:54:46,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10119 conditions, 2020 events. 1161/2020 cut-off events. For 2419/4012 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 13210 event pairs, 162 based on Foata normal form. 8/1022 useless extension candidates. Maximal degree in co-relation 10104. Up to 1594 conditions per place. [2022-12-13 00:54:46,135 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 67 transitions, 537 flow [2022-12-13 00:54:46,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-13 00:54:46,142 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:54:46,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-13 00:54:46,143 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 67 transitions, 537 flow [2022-12-13 00:54:46,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:46,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:46,143 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:46,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:54:46,143 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:46,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:46,144 INFO L85 PathProgramCache]: Analyzing trace with hash -990957483, now seen corresponding path program 1 times [2022-12-13 00:54:46,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:46,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461722877] [2022-12-13 00:54:46,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:46,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:54:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:54:46,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:54:46,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461722877] [2022-12-13 00:54:46,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461722877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:54:46,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:54:46,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:54:46,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680911916] [2022-12-13 00:54:46,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:54:46,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:54:46,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:54:46,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:54:46,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:54:46,290 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-13 00:54:46,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 67 transitions, 537 flow. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:46,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:54:46,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-13 00:54:46,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:54:46,608 INFO L130 PetriNetUnfolder]: 1536/2658 cut-off events. [2022-12-13 00:54:46,608 INFO L131 PetriNetUnfolder]: For 2608/2608 co-relation queries the response was YES. [2022-12-13 00:54:46,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14269 conditions, 2658 events. 1536/2658 cut-off events. For 2608/2608 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 15465 event pairs, 12 based on Foata normal form. 243/1725 useless extension candidates. Maximal degree in co-relation 14251. Up to 1954 conditions per place. [2022-12-13 00:54:46,620 INFO L137 encePairwiseOnDemand]: 16/37 looper letters, 36 selfloop transitions, 49 changer transitions 15/103 dead transitions. [2022-12-13 00:54:46,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 103 transitions, 961 flow [2022-12-13 00:54:46,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:54:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:54:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2022-12-13 00:54:46,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42567567567567566 [2022-12-13 00:54:46,622 INFO L175 Difference]: Start difference. First operand has 56 places, 67 transitions, 537 flow. Second operand 8 states and 126 transitions. [2022-12-13 00:54:46,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 103 transitions, 961 flow [2022-12-13 00:54:46,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 103 transitions, 779 flow, removed 63 selfloop flow, removed 6 redundant places. [2022-12-13 00:54:46,671 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 511 flow [2022-12-13 00:54:46,671 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=511, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2022-12-13 00:54:46,671 INFO L295 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2022-12-13 00:54:46,671 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:54:46,671 INFO L89 Accepts]: Start accepts. Operand has 60 places, 67 transitions, 511 flow [2022-12-13 00:54:46,672 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:54:46,672 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:54:46,672 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 67 transitions, 511 flow [2022-12-13 00:54:46,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 67 transitions, 511 flow [2022-12-13 00:54:46,726 INFO L130 PetriNetUnfolder]: 513/1048 cut-off events. [2022-12-13 00:54:46,726 INFO L131 PetriNetUnfolder]: For 1269/1824 co-relation queries the response was YES. [2022-12-13 00:54:46,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4604 conditions, 1048 events. 513/1048 cut-off events. For 1269/1824 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 6491 event pairs, 0 based on Foata normal form. 1/475 useless extension candidates. Maximal degree in co-relation 4589. Up to 730 conditions per place. [2022-12-13 00:54:46,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 67 transitions, 511 flow [2022-12-13 00:54:46,731 INFO L226 LiptonReduction]: Number of co-enabled transitions 402 [2022-12-13 00:54:52,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] $Ultimate##0-->L822: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~z~0_41 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|) (= v_~y~0_40 v_~__unbuffered_p2_EAX~0_76)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_41, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset, ~z~0] and [730] $Ultimate##0-->P3FINAL: Formula: (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_116 256) 0))) (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_112 256) 0)) (.cse10 (not (= (mod v_~a$w_buff0_used~0_422 256) 0))) (.cse1 (not .cse7)) (.cse5 (= (mod v_~a$w_buff1_used~0_406 256) 0)) (.cse8 (= (mod v_~a$w_buff0_used~0_423 256) 0))) (let ((.cse0 (not .cse8)) (.cse4 (not .cse5)) (.cse9 (and .cse10 .cse1)) (.cse3 (not .cse6))) (and (= (+ v_~__unbuffered_cnt~0_1326 1) v_~__unbuffered_cnt~0_1325) (= v_P3Thread1of1ForFork1_~arg.base_35 |v_P3Thread1of1ForFork1_#in~arg.base_35|) (= (ite (and .cse0 .cse1) 0 v_~a$w_buff0_used~0_423) v_~a$w_buff0_used~0_422) (let ((.cse2 (= |v_P3Thread1of1ForFork1_#t~mem19_70| |v_P3_#t~mem19_69|))) (or (and (= |v_P3_#t~ite21_62| v_~a$w_buff0~0_253) .cse0 (= |v_P3_#t~ite20_66| |v_P3Thread1of1ForFork1_#t~ite20_70|) .cse2 .cse1) (and (= |v_P3_#t~ite20_66| |v_P3_#t~ite21_62|) (or (and (= |v_P3_#t~ite20_66| v_~a$w_buff1~0_251) .cse2 .cse3 .cse4) (and (or .cse5 .cse6) (= |v_P3_#t~ite20_66| |v_P3_#t~mem19_69|) (= |v_P3_#t~mem19_69| 1))) (or .cse7 .cse8)))) (= 0 |v_P3Thread1of1ForFork1_#res.base_143|) (= v_~z~0_61 v_~__unbuffered_p3_EAX~0_92) (= |v_P3Thread1of1ForFork1_#res.offset_143| 0) (= v_P3Thread1of1ForFork1_~arg.offset_35 |v_P3Thread1of1ForFork1_#in~arg.offset_35|) (= v_~a$r_buff0_thd4~0_115 (ite .cse9 0 v_~a$r_buff0_thd4~0_116)) (= (store |v_#memory_int_549| |v_~#a~0.base_247| (store (select |v_#memory_int_549| |v_~#a~0.base_247|) |v_~#a~0.offset_247| |v_P3_#t~ite21_62|)) |v_#memory_int_548|) (= (ite (or (and .cse3 .cse4) .cse9) 0 v_~a$w_buff1_used~0_406) v_~a$w_buff1_used~0_405) (= v_~a$r_buff1_thd4~0_111 (ite (or (and (not (= (mod v_~a$r_buff0_thd4~0_115 256) 0)) .cse10) (and (not (= (mod v_~a$w_buff1_used~0_405 256) 0)) .cse3)) 0 v_~a$r_buff1_thd4~0_112)))))) InVars {~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_112, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_423, ~#a~0.base=|v_~#a~0.base_247|, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_70|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_116, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_35|, ~a$w_buff1~0=v_~a$w_buff1~0_251, ~a$w_buff0~0=v_~a$w_buff0~0_253, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_35|, #memory_int=|v_#memory_int_549|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1326, ~#a~0.offset=|v_~#a~0.offset_247|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_406, ~z~0=v_~z~0_61, P3Thread1of1ForFork1_#t~ite20=|v_P3Thread1of1ForFork1_#t~ite20_70|} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_143|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_111, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_422, ~#a~0.base=|v_~#a~0.base_247|, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_143|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_115, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_35|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_35, ~a$w_buff1~0=v_~a$w_buff1~0_251, ~a$w_buff0~0=v_~a$w_buff0~0_253, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_35|, #memory_int=|v_#memory_int_548|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1325, ~#a~0.offset=|v_~#a~0.offset_247|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_405, ~z~0=v_~z~0_61, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_35, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_37|} AuxVars[|v_P3_#t~ite20_66|, |v_P3_#t~ite21_62|, |v_P3_#t~mem19_69|] AssignedVars[P3Thread1of1ForFork1_#res.base, ~a$r_buff1_thd4~0, ~a$w_buff0_used~0, P3Thread1of1ForFork1_#t~mem19, P3Thread1of1ForFork1_#res.offset, ~a$r_buff0_thd4~0, P3Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p3_EAX~0, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_#t~ite21, P3Thread1of1ForFork1_#t~ite20] [2022-12-13 00:54:52,643 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] $Ultimate##0-->L822: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~z~0_41 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|) (= v_~y~0_40 v_~__unbuffered_p2_EAX~0_76)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_41, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset, ~z~0] and [731] $Ultimate##0-->P3EXIT: Formula: (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_120 256) 0))) (let ((.cse10 (not .cse8)) (.cse3 (not (= (mod v_~a$w_buff0_used~0_426 256) 0))) (.cse7 (= (mod v_~a$w_buff0_used~0_427 256) 0)) (.cse5 (= (mod v_~a$r_buff1_thd4~0_116 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_410 256) 0))) (let ((.cse0 (not .cse4)) (.cse1 (not .cse5)) (.cse9 (not .cse7)) (.cse2 (and .cse10 .cse3))) (and (= (ite (or (and .cse0 .cse1) .cse2) 0 v_~a$w_buff1_used~0_410) v_~a$w_buff1_used~0_409) (= (+ v_~__unbuffered_cnt~0_1330 1) v_~__unbuffered_cnt~0_1329) (= v_~a$r_buff1_thd4~0_115 (ite (or (and .cse3 (not (= (mod v_~a$r_buff0_thd4~0_119 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_409 256) 0)) .cse1)) 0 v_~a$r_buff1_thd4~0_116)) (= |v_P3Thread1of1ForFork1_#res.offset_145| 0) (= v_P3Thread1of1ForFork1_~arg.base_37 |v_P3Thread1of1ForFork1_#in~arg.base_37|) (let ((.cse6 (= |v_P3Thread1of1ForFork1_#t~mem19_74| |v_P3_#t~mem19_71|))) (or (and (or (and (or .cse4 .cse5) (= |v_P3_#t~ite20_68| |v_P3_#t~mem19_71|) (= |v_P3_#t~mem19_71| 1)) (and .cse0 .cse6 (= |v_P3_#t~ite20_68| v_~a$w_buff1~0_253) .cse1)) (or .cse7 .cse8) (= |v_P3_#t~ite20_68| |v_P3_#t~ite21_64|)) (and .cse9 .cse10 .cse6 (= |v_P3_#t~ite21_64| v_~a$w_buff0~0_255) (= |v_P3_#t~ite20_68| |v_P3Thread1of1ForFork1_#t~ite20_74|)))) (= (ite (and .cse9 .cse10) 0 v_~a$w_buff0_used~0_427) v_~a$w_buff0_used~0_426) (= v_~z~0_63 v_~__unbuffered_p3_EAX~0_94) (= v_P3Thread1of1ForFork1_~arg.offset_37 |v_P3Thread1of1ForFork1_#in~arg.offset_37|) (= (ite .cse2 0 v_~a$r_buff0_thd4~0_120) v_~a$r_buff0_thd4~0_119) (= (store |v_#memory_int_553| |v_~#a~0.base_249| (store (select |v_#memory_int_553| |v_~#a~0.base_249|) |v_~#a~0.offset_249| |v_P3_#t~ite21_64|)) |v_#memory_int_552|) (= 0 |v_P3Thread1of1ForFork1_#res.base_145|))))) InVars {~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_116, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_427, ~#a~0.base=|v_~#a~0.base_249|, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_74|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_120, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_37|, ~a$w_buff1~0=v_~a$w_buff1~0_253, ~a$w_buff0~0=v_~a$w_buff0~0_255, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_37|, #memory_int=|v_#memory_int_553|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1330, ~#a~0.offset=|v_~#a~0.offset_249|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_410, ~z~0=v_~z~0_63, P3Thread1of1ForFork1_#t~ite20=|v_P3Thread1of1ForFork1_#t~ite20_74|} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_145|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_115, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_426, ~#a~0.base=|v_~#a~0.base_249|, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_145|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_119, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_37|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_37, ~a$w_buff1~0=v_~a$w_buff1~0_253, ~a$w_buff0~0=v_~a$w_buff0~0_255, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_37|, #memory_int=|v_#memory_int_552|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_94, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1329, ~#a~0.offset=|v_~#a~0.offset_249|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_409, ~z~0=v_~z~0_63, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_37, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_39|} AuxVars[|v_P3_#t~mem19_71|, |v_P3_#t~ite20_68|, |v_P3_#t~ite21_64|] AssignedVars[P3Thread1of1ForFork1_#res.base, ~a$r_buff1_thd4~0, ~a$w_buff0_used~0, P3Thread1of1ForFork1_#t~mem19, P3Thread1of1ForFork1_#res.offset, ~a$r_buff0_thd4~0, P3Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p3_EAX~0, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_#t~ite21, P3Thread1of1ForFork1_#t~ite20] [2022-12-13 00:54:53,029 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] $Ultimate##0-->L822: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~z~0_41 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|) (= v_~y~0_40 v_~__unbuffered_p2_EAX~0_76)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_41, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset, ~z~0] and [732] $Ultimate##0-->P3EXIT: Formula: (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_124 256) 0))) (let ((.cse0 (not (= (mod v_~a$w_buff0_used~0_430 256) 0))) (.cse4 (not .cse6)) (.cse8 (= 0 (mod v_~a$w_buff1_used~0_414 256))) (.cse9 (= (mod v_~a$r_buff1_thd4~0_120 256) 0)) (.cse7 (= (mod v_~a$w_buff0_used~0_431 256) 0))) (let ((.cse3 (not .cse7)) (.cse1 (not .cse9)) (.cse10 (not .cse8)) (.cse2 (and .cse0 .cse4))) (and (= v_~a$r_buff1_thd4~0_119 (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd4~0_123 256) 0))) (and .cse1 (not (= (mod v_~a$w_buff1_used~0_413 256) 0)))) 0 v_~a$r_buff1_thd4~0_120)) (= v_P3Thread1of1ForFork1_~arg.offset_39 |v_P3Thread1of1ForFork1_#in~arg.offset_39|) (= v_~__unbuffered_cnt~0_1333 (+ v_~__unbuffered_cnt~0_1334 1)) (= v_P3Thread1of1ForFork1_~arg.base_39 |v_P3Thread1of1ForFork1_#in~arg.base_39|) (= v_~a$r_buff0_thd4~0_123 (ite .cse2 0 v_~a$r_buff0_thd4~0_124)) (= (ite (and .cse3 .cse4) 0 v_~a$w_buff0_used~0_431) v_~a$w_buff0_used~0_430) (= 0 |v_P3Thread1of1ForFork1_#res.base_147|) (= |v_P3Thread1of1ForFork1_#res.offset_147| 0) (= (store |v_#memory_int_557| |v_~#a~0.base_251| (store (select |v_#memory_int_557| |v_~#a~0.base_251|) |v_~#a~0.offset_251| |v_P3_#t~ite21_66|)) |v_#memory_int_556|) (= v_~z~0_65 v_~__unbuffered_p3_EAX~0_96) (let ((.cse5 (= |v_P3Thread1of1ForFork1_#t~mem19_78| |v_P3_#t~mem19_73|))) (or (and .cse3 (= |v_P3_#t~ite20_70| |v_P3Thread1of1ForFork1_#t~ite20_78|) .cse4 (= |v_P3_#t~ite21_66| v_~a$w_buff0~0_257) .cse5) (and (or .cse6 .cse7) (= |v_P3_#t~ite20_70| |v_P3_#t~ite21_66|) (or (and (= |v_P3_#t~mem19_73| 1) (= |v_P3_#t~ite20_70| |v_P3_#t~mem19_73|) (or .cse8 .cse9)) (and .cse1 .cse10 (= |v_P3_#t~ite20_70| v_~a$w_buff1~0_255) .cse5))))) (= (ite (or (and .cse1 .cse10) .cse2) 0 v_~a$w_buff1_used~0_414) v_~a$w_buff1_used~0_413))))) InVars {~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_120, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_431, ~#a~0.base=|v_~#a~0.base_251|, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_78|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_124, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_39|, ~a$w_buff1~0=v_~a$w_buff1~0_255, ~a$w_buff0~0=v_~a$w_buff0~0_257, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_39|, #memory_int=|v_#memory_int_557|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1334, ~#a~0.offset=|v_~#a~0.offset_251|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_414, ~z~0=v_~z~0_65, P3Thread1of1ForFork1_#t~ite20=|v_P3Thread1of1ForFork1_#t~ite20_78|} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_147|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_119, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_430, ~#a~0.base=|v_~#a~0.base_251|, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_147|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_123, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_39|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_39, ~a$w_buff1~0=v_~a$w_buff1~0_255, ~a$w_buff0~0=v_~a$w_buff0~0_257, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_39|, #memory_int=|v_#memory_int_556|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_96, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1333, ~#a~0.offset=|v_~#a~0.offset_251|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_413, ~z~0=v_~z~0_65, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_39, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_41|} AuxVars[|v_P3_#t~ite21_66|, |v_P3_#t~mem19_73|, |v_P3_#t~ite20_70|] AssignedVars[P3Thread1of1ForFork1_#res.base, ~a$r_buff1_thd4~0, ~a$w_buff0_used~0, P3Thread1of1ForFork1_#t~mem19, P3Thread1of1ForFork1_#res.offset, ~a$r_buff0_thd4~0, P3Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p3_EAX~0, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_#t~ite21, P3Thread1of1ForFork1_#t~ite20] [2022-12-13 00:54:53,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] $Ultimate##0-->L822: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~z~0_41 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|) (= v_~y~0_40 v_~__unbuffered_p2_EAX~0_76)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_41, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset, ~z~0] and [733] $Ultimate##0-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_128 256) 0))) (let ((.cse7 (= (mod v_~a$r_buff1_thd4~0_124 256) 0)) (.cse10 (not (= (mod v_~a$w_buff0_used~0_434 256) 0))) (.cse4 (not .cse9)) (.cse8 (= (mod v_~a$w_buff0_used~0_435 256) 0)) (.cse6 (= (mod v_~a$w_buff1_used~0_418 256) 0))) (let ((.cse2 (not .cse6)) (.cse3 (not .cse8)) (.cse0 (and .cse10 .cse4)) (.cse1 (not .cse7))) (and (= (ite (or .cse0 (and .cse1 .cse2)) 0 v_~a$w_buff1_used~0_418) v_~a$w_buff1_used~0_417) (= (store |v_#memory_int_561| |v_~#a~0.base_253| (store (select |v_#memory_int_561| |v_~#a~0.base_253|) |v_~#a~0.offset_253| |v_P3_#t~ite21_68|)) |v_#memory_int_560|) (= (ite (and .cse3 .cse4) 0 v_~a$w_buff0_used~0_435) v_~a$w_buff0_used~0_434) (= v_~z~0_67 v_~__unbuffered_p3_EAX~0_98) (= v_P3Thread1of1ForFork1_~arg.base_41 |v_P3Thread1of1ForFork1_#in~arg.base_41|) (= (+ v_~__unbuffered_cnt~0_1338 1) v_~__unbuffered_cnt~0_1337) (let ((.cse5 (= |v_P3Thread1of1ForFork1_#t~mem19_82| |v_P3_#t~mem19_75|))) (or (and (or (and .cse5 .cse1 .cse2 (= |v_P3_#t~ite20_72| v_~a$w_buff1~0_257)) (and (or .cse6 .cse7) (= |v_P3_#t~mem19_75| 1) (= |v_P3_#t~ite20_72| |v_P3_#t~mem19_75|))) (= |v_P3_#t~ite20_72| |v_P3_#t~ite21_68|) (or .cse8 .cse9)) (and (= |v_P3_#t~ite20_72| |v_P3Thread1of1ForFork1_#t~ite20_82|) (= |v_P3_#t~ite21_68| v_~a$w_buff0~0_259) .cse5 .cse3 .cse4))) (= v_~a$r_buff0_thd4~0_127 (ite .cse0 0 v_~a$r_buff0_thd4~0_128)) (= v_P3Thread1of1ForFork1_~arg.offset_41 |v_P3Thread1of1ForFork1_#in~arg.offset_41|) (= v_~a$r_buff1_thd4~0_123 (ite (or (and .cse1 (not (= (mod v_~a$w_buff1_used~0_417 256) 0))) (and .cse10 (not (= (mod v_~a$r_buff0_thd4~0_127 256) 0)))) 0 v_~a$r_buff1_thd4~0_124)))))) InVars {~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_124, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_435, ~#a~0.base=|v_~#a~0.base_253|, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_82|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_128, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_41|, ~a$w_buff1~0=v_~a$w_buff1~0_257, ~a$w_buff0~0=v_~a$w_buff0~0_259, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_41|, #memory_int=|v_#memory_int_561|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1338, ~#a~0.offset=|v_~#a~0.offset_253|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_418, ~z~0=v_~z~0_67, P3Thread1of1ForFork1_#t~ite20=|v_P3Thread1of1ForFork1_#t~ite20_82|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_123, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_434, ~#a~0.base=|v_~#a~0.base_253|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_127, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_41|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_41, ~a$w_buff1~0=v_~a$w_buff1~0_257, ~a$w_buff0~0=v_~a$w_buff0~0_259, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_41|, #memory_int=|v_#memory_int_560|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1337, ~#a~0.offset=|v_~#a~0.offset_253|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_417, ~z~0=v_~z~0_67, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_41, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_43|} AuxVars[|v_P3_#t~ite21_68|, |v_P3_#t~mem19_75|, |v_P3_#t~ite20_72|] AssignedVars[~a$r_buff1_thd4~0, #memory_int, ~__unbuffered_p3_EAX~0, ~a$w_buff0_used~0, P3Thread1of1ForFork1_#t~mem19, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, P3Thread1of1ForFork1_~arg.offset, ~a$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite21, P3Thread1of1ForFork1_~arg.base, P3Thread1of1ForFork1_#t~ite20] [2022-12-13 00:54:53,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] $Ultimate##0-->L822: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~z~0_41 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|) (= v_~y~0_40 v_~__unbuffered_p2_EAX~0_76)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_41, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset, ~z~0] and [734] $Ultimate##0-->P3FINAL: Formula: (let ((.cse7 (= 0 (mod v_~a$r_buff0_thd4~0_132 256)))) (let ((.cse6 (= (mod v_~a$w_buff0_used~0_439 256) 0)) (.cse8 (= (mod v_~a$w_buff1_used~0_422 256) 0)) (.cse9 (= (mod v_~a$r_buff1_thd4~0_128 256) 0)) (.cse3 (not .cse7)) (.cse1 (not (= (mod v_~a$w_buff0_used~0_438 256) 0)))) (let ((.cse4 (and .cse3 .cse1)) (.cse0 (not .cse9)) (.cse5 (not .cse8)) (.cse2 (not .cse6))) (and (= (+ v_~__unbuffered_cnt~0_1342 1) v_~__unbuffered_cnt~0_1341) (= v_~a$r_buff1_thd4~0_127 (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_421 256) 0))) (and (not (= (mod v_~a$r_buff0_thd4~0_131 256) 0)) .cse1)) 0 v_~a$r_buff1_thd4~0_128)) (= v_~a$w_buff0_used~0_438 (ite (and .cse2 .cse3) 0 v_~a$w_buff0_used~0_439)) (= |v_P3Thread1of1ForFork1_#res.offset_149| 0) (= 0 |v_P3Thread1of1ForFork1_#res.base_149|) (= v_P3Thread1of1ForFork1_~arg.offset_43 |v_P3Thread1of1ForFork1_#in~arg.offset_43|) (= v_P3Thread1of1ForFork1_~arg.base_43 |v_P3Thread1of1ForFork1_#in~arg.base_43|) (= (ite (or .cse4 (and .cse0 .cse5)) 0 v_~a$w_buff1_used~0_422) v_~a$w_buff1_used~0_421) (= (store |v_#memory_int_565| |v_~#a~0.base_255| (store (select |v_#memory_int_565| |v_~#a~0.base_255|) |v_~#a~0.offset_255| |v_P3_#t~ite21_70|)) |v_#memory_int_564|) (= (ite .cse4 0 v_~a$r_buff0_thd4~0_132) v_~a$r_buff0_thd4~0_131) (= v_~z~0_69 v_~__unbuffered_p3_EAX~0_100) (let ((.cse10 (= |v_P3Thread1of1ForFork1_#t~mem19_86| |v_P3_#t~mem19_77|))) (or (and (or .cse6 .cse7) (= |v_P3_#t~ite20_74| |v_P3_#t~ite21_70|) (or (and (= |v_P3_#t~mem19_77| 1) (= |v_P3_#t~ite20_74| |v_P3_#t~mem19_77|) (or .cse8 .cse9)) (and .cse0 (= |v_P3_#t~ite20_74| v_~a$w_buff1~0_259) .cse5 .cse10))) (and .cse2 (= |v_P3_#t~ite20_74| |v_P3Thread1of1ForFork1_#t~ite20_86|) .cse3 (= |v_P3_#t~ite21_70| v_~a$w_buff0~0_261) .cse10))))))) InVars {~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_128, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_439, ~#a~0.base=|v_~#a~0.base_255|, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_86|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_132, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_43|, ~a$w_buff1~0=v_~a$w_buff1~0_259, ~a$w_buff0~0=v_~a$w_buff0~0_261, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_43|, #memory_int=|v_#memory_int_565|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1342, ~#a~0.offset=|v_~#a~0.offset_255|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_422, ~z~0=v_~z~0_69, P3Thread1of1ForFork1_#t~ite20=|v_P3Thread1of1ForFork1_#t~ite20_86|} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_149|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_127, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_438, ~#a~0.base=|v_~#a~0.base_255|, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_149|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_131, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_43|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_43, ~a$w_buff1~0=v_~a$w_buff1~0_259, ~a$w_buff0~0=v_~a$w_buff0~0_261, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_43|, #memory_int=|v_#memory_int_564|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_100, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1341, ~#a~0.offset=|v_~#a~0.offset_255|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_421, ~z~0=v_~z~0_69, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_43, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_45|} AuxVars[|v_P3_#t~ite20_74|, |v_P3_#t~mem19_77|, |v_P3_#t~ite21_70|] AssignedVars[P3Thread1of1ForFork1_#res.base, ~a$r_buff1_thd4~0, ~a$w_buff0_used~0, P3Thread1of1ForFork1_#t~mem19, P3Thread1of1ForFork1_#res.offset, ~a$r_buff0_thd4~0, P3Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p3_EAX~0, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_#t~ite21, P3Thread1of1ForFork1_#t~ite20] [2022-12-13 00:54:54,067 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] $Ultimate##0-->L822: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~z~0_41 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|) (= v_~y~0_40 v_~__unbuffered_p2_EAX~0_76)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_41, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset, ~z~0] and [735] $Ultimate##0-->P3EXIT: Formula: (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_136 256) 0))) (let ((.cse7 (= (mod v_~a$w_buff0_used~0_443 256) 0)) (.cse9 (= (mod v_~a$w_buff1_used~0_426 256) 0)) (.cse10 (= (mod v_~a$r_buff1_thd4~0_132 256) 0)) (.cse3 (not .cse6)) (.cse0 (not (= (mod v_~a$w_buff0_used~0_442 256) 0)))) (let ((.cse2 (and .cse3 .cse0)) (.cse1 (not .cse10)) (.cse5 (not .cse9)) (.cse4 (not .cse7))) (and (= v_~a$r_buff1_thd4~0_131 (ite (or (and .cse0 (not (= (mod v_~a$r_buff0_thd4~0_135 256) 0))) (and .cse1 (not (= (mod v_~a$w_buff1_used~0_425 256) 0)))) 0 v_~a$r_buff1_thd4~0_132)) (= |v_P3Thread1of1ForFork1_#res.offset_151| 0) (= v_P3Thread1of1ForFork1_~arg.base_45 |v_P3Thread1of1ForFork1_#in~arg.base_45|) (= v_~z~0_71 v_~__unbuffered_p3_EAX~0_102) (= 0 |v_P3Thread1of1ForFork1_#res.base_151|) (= v_P3Thread1of1ForFork1_~arg.offset_45 |v_P3Thread1of1ForFork1_#in~arg.offset_45|) (= v_~a$r_buff0_thd4~0_135 (ite .cse2 0 v_~a$r_buff0_thd4~0_136)) (= (store |v_#memory_int_569| |v_~#a~0.base_257| (store (select |v_#memory_int_569| |v_~#a~0.base_257|) |v_~#a~0.offset_257| |v_P3_#t~ite21_72|)) |v_#memory_int_568|) (= (ite (and .cse3 .cse4) 0 v_~a$w_buff0_used~0_443) v_~a$w_buff0_used~0_442) (= v_~a$w_buff1_used~0_425 (ite (or .cse2 (and .cse1 .cse5)) 0 v_~a$w_buff1_used~0_426)) (let ((.cse8 (= |v_P3Thread1of1ForFork1_#t~mem19_90| |v_P3_#t~mem19_79|))) (or (and (or .cse6 .cse7) (= |v_P3_#t~ite20_76| |v_P3_#t~ite21_72|) (or (and .cse1 .cse5 .cse8 (= |v_P3_#t~ite20_76| v_~a$w_buff1~0_261)) (and (= |v_P3_#t~mem19_79| 1) (or .cse9 .cse10) (= |v_P3_#t~ite20_76| |v_P3_#t~mem19_79|)))) (and .cse8 (= |v_P3_#t~ite20_76| |v_P3Thread1of1ForFork1_#t~ite20_90|) (= |v_P3_#t~ite21_72| v_~a$w_buff0~0_263) .cse3 .cse4))) (= (+ v_~__unbuffered_cnt~0_1346 1) v_~__unbuffered_cnt~0_1345))))) InVars {~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_132, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_443, ~#a~0.base=|v_~#a~0.base_257|, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_90|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_136, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_45|, ~a$w_buff1~0=v_~a$w_buff1~0_261, ~a$w_buff0~0=v_~a$w_buff0~0_263, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_45|, #memory_int=|v_#memory_int_569|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1346, ~#a~0.offset=|v_~#a~0.offset_257|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_426, ~z~0=v_~z~0_71, P3Thread1of1ForFork1_#t~ite20=|v_P3Thread1of1ForFork1_#t~ite20_90|} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_151|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_131, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_442, ~#a~0.base=|v_~#a~0.base_257|, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_151|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_135, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_45|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_45, ~a$w_buff1~0=v_~a$w_buff1~0_261, ~a$w_buff0~0=v_~a$w_buff0~0_263, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_45|, #memory_int=|v_#memory_int_568|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_102, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1345, ~#a~0.offset=|v_~#a~0.offset_257|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_425, ~z~0=v_~z~0_71, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_45, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_47|} AuxVars[|v_P3_#t~ite20_76|, |v_P3_#t~mem19_79|, |v_P3_#t~ite21_72|] AssignedVars[P3Thread1of1ForFork1_#res.base, ~a$r_buff1_thd4~0, ~a$w_buff0_used~0, P3Thread1of1ForFork1_#t~mem19, P3Thread1of1ForFork1_#res.offset, ~a$r_buff0_thd4~0, P3Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p3_EAX~0, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_#t~ite21, P3Thread1of1ForFork1_#t~ite20] [2022-12-13 00:54:54,409 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] $Ultimate##0-->L822: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~z~0_41 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|) (= v_~y~0_40 v_~__unbuffered_p2_EAX~0_76)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_41, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset, ~z~0] and [736] $Ultimate##0-->L847: Formula: (let ((.cse6 (= (mod v_~a$r_buff0_thd4~0_140 256) 0))) (let ((.cse3 (= (mod v_~a$w_buff1_used~0_430 256) 0)) (.cse4 (= (mod v_~a$r_buff1_thd4~0_136 256) 0)) (.cse10 (not (= (mod v_~a$w_buff0_used~0_446 256) 0))) (.cse8 (not .cse6)) (.cse5 (= (mod v_~a$w_buff0_used~0_447 256) 0))) (let ((.cse7 (not .cse5)) (.cse9 (and .cse10 .cse8)) (.cse0 (not .cse4)) (.cse1 (not .cse3))) (and (= (+ v_~__unbuffered_cnt~0_1350 1) v_~__unbuffered_cnt~0_1349) (= v_P3Thread1of1ForFork1_~arg.base_47 |v_P3Thread1of1ForFork1_#in~arg.base_47|) (= (store |v_#memory_int_573| |v_~#a~0.base_259| (store (select |v_#memory_int_573| |v_~#a~0.base_259|) |v_~#a~0.offset_259| |v_P3_#t~ite21_74|)) |v_#memory_int_572|) (let ((.cse2 (= |v_P3Thread1of1ForFork1_#t~mem19_94| |v_P3_#t~mem19_81|))) (or (and (or (and .cse0 (= |v_P3_#t~ite20_78| v_~a$w_buff1~0_263) .cse1 .cse2) (and (= |v_P3_#t~mem19_81| 1) (or .cse3 .cse4) (= |v_P3_#t~ite20_78| |v_P3_#t~mem19_81|))) (or .cse5 .cse6) (= |v_P3_#t~ite20_78| |v_P3_#t~ite21_74|)) (and (= |v_P3_#t~ite21_74| v_~a$w_buff0~0_265) (= |v_P3_#t~ite20_78| |v_P3Thread1of1ForFork1_#t~ite20_94|) .cse7 .cse2 .cse8))) (= (ite (and .cse7 .cse8) 0 v_~a$w_buff0_used~0_447) v_~a$w_buff0_used~0_446) (= v_~a$r_buff0_thd4~0_139 (ite .cse9 0 v_~a$r_buff0_thd4~0_140)) (= v_~a$r_buff1_thd4~0_135 (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_429 256) 0))) (and (not (= (mod v_~a$r_buff0_thd4~0_139 256) 0)) .cse10)) 0 v_~a$r_buff1_thd4~0_136)) (= v_P3Thread1of1ForFork1_~arg.offset_47 |v_P3Thread1of1ForFork1_#in~arg.offset_47|) (= (ite (or .cse9 (and .cse0 .cse1)) 0 v_~a$w_buff1_used~0_430) v_~a$w_buff1_used~0_429) (= v_~z~0_73 v_~__unbuffered_p3_EAX~0_104))))) InVars {~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_136, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_447, ~#a~0.base=|v_~#a~0.base_259|, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_94|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_140, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_47|, ~a$w_buff1~0=v_~a$w_buff1~0_263, ~a$w_buff0~0=v_~a$w_buff0~0_265, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_47|, #memory_int=|v_#memory_int_573|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1350, ~#a~0.offset=|v_~#a~0.offset_259|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_430, ~z~0=v_~z~0_73, P3Thread1of1ForFork1_#t~ite20=|v_P3Thread1of1ForFork1_#t~ite20_94|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_135, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_446, ~#a~0.base=|v_~#a~0.base_259|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_139, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_47|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_47, ~a$w_buff1~0=v_~a$w_buff1~0_263, ~a$w_buff0~0=v_~a$w_buff0~0_265, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_47|, #memory_int=|v_#memory_int_572|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_104, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1349, ~#a~0.offset=|v_~#a~0.offset_259|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_429, ~z~0=v_~z~0_73, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_47, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_49|} AuxVars[|v_P3_#t~ite20_78|, |v_P3_#t~mem19_81|, |v_P3_#t~ite21_74|] AssignedVars[~a$r_buff1_thd4~0, #memory_int, ~__unbuffered_p3_EAX~0, ~a$w_buff0_used~0, P3Thread1of1ForFork1_#t~mem19, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, P3Thread1of1ForFork1_~arg.offset, ~a$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite21, P3Thread1of1ForFork1_~arg.base, P3Thread1of1ForFork1_#t~ite20] [2022-12-13 00:54:54,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] $Ultimate##0-->L822: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~z~0_41 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|) (= v_~y~0_40 v_~__unbuffered_p2_EAX~0_76)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_41, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset, ~z~0] and [737] $Ultimate##0-->P3FINAL: Formula: (let ((.cse3 (= (mod v_~a$r_buff0_thd4~0_144 256) 0))) (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_140 256) 0)) (.cse5 (= (mod v_~a$w_buff1_used~0_434 256) 0)) (.cse10 (not (= (mod v_~a$w_buff0_used~0_450 256) 0))) (.cse1 (not .cse3)) (.cse4 (= (mod v_~a$w_buff0_used~0_451 256) 0))) (let ((.cse0 (not .cse4)) (.cse9 (and .cse10 .cse1)) (.cse8 (not .cse5)) (.cse7 (not .cse6))) (and (= (ite (and .cse0 .cse1) 0 v_~a$w_buff0_used~0_451) v_~a$w_buff0_used~0_450) (let ((.cse2 (= |v_P3Thread1of1ForFork1_#t~mem19_98| |v_P3_#t~mem19_83|))) (or (and .cse2 .cse0 (= |v_P3_#t~ite21_76| v_~a$w_buff0~0_267) (= |v_P3_#t~ite20_80| |v_P3Thread1of1ForFork1_#t~ite20_98|) .cse1) (and (or .cse3 .cse4) (= |v_P3_#t~ite20_80| |v_P3_#t~ite21_76|) (or (and (or .cse5 .cse6) (= |v_P3_#t~mem19_83| 1) (= |v_P3_#t~ite20_80| |v_P3_#t~mem19_83|)) (and .cse2 .cse7 (= |v_P3_#t~ite20_80| v_~a$w_buff1~0_265) .cse8))))) (= 0 |v_P3Thread1of1ForFork1_#res.base_153|) (= v_~a$r_buff0_thd4~0_143 (ite .cse9 0 v_~a$r_buff0_thd4~0_144)) (= v_P3Thread1of1ForFork1_~arg.base_49 |v_P3Thread1of1ForFork1_#in~arg.base_49|) (= (ite (or .cse9 (and .cse7 .cse8)) 0 v_~a$w_buff1_used~0_434) v_~a$w_buff1_used~0_433) (= (+ v_~__unbuffered_cnt~0_1354 1) v_~__unbuffered_cnt~0_1353) (= v_P3Thread1of1ForFork1_~arg.offset_49 |v_P3Thread1of1ForFork1_#in~arg.offset_49|) (= |v_P3Thread1of1ForFork1_#res.offset_153| 0) (= v_~a$r_buff1_thd4~0_139 (ite (or (and (not (= (mod v_~a$r_buff0_thd4~0_143 256) 0)) .cse10) (and .cse7 (not (= (mod v_~a$w_buff1_used~0_433 256) 0)))) 0 v_~a$r_buff1_thd4~0_140)) (= (store |v_#memory_int_577| |v_~#a~0.base_261| (store (select |v_#memory_int_577| |v_~#a~0.base_261|) |v_~#a~0.offset_261| |v_P3_#t~ite21_76|)) |v_#memory_int_576|) (= v_~z~0_75 v_~__unbuffered_p3_EAX~0_106))))) InVars {~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_140, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_451, ~#a~0.base=|v_~#a~0.base_261|, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_98|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_144, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_49|, ~a$w_buff1~0=v_~a$w_buff1~0_265, ~a$w_buff0~0=v_~a$w_buff0~0_267, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_49|, #memory_int=|v_#memory_int_577|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1354, ~#a~0.offset=|v_~#a~0.offset_261|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_434, ~z~0=v_~z~0_75, P3Thread1of1ForFork1_#t~ite20=|v_P3Thread1of1ForFork1_#t~ite20_98|} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_153|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_139, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_450, ~#a~0.base=|v_~#a~0.base_261|, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_153|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_143, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_49|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_49, ~a$w_buff1~0=v_~a$w_buff1~0_265, ~a$w_buff0~0=v_~a$w_buff0~0_267, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_49|, #memory_int=|v_#memory_int_576|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1353, ~#a~0.offset=|v_~#a~0.offset_261|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_433, ~z~0=v_~z~0_75, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_49, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_51|} AuxVars[|v_P3_#t~mem19_83|, |v_P3_#t~ite21_76|, |v_P3_#t~ite20_80|] AssignedVars[P3Thread1of1ForFork1_#res.base, ~a$r_buff1_thd4~0, ~a$w_buff0_used~0, P3Thread1of1ForFork1_#t~mem19, P3Thread1of1ForFork1_#res.offset, ~a$r_buff0_thd4~0, P3Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p3_EAX~0, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_#t~ite21, P3Thread1of1ForFork1_#t~ite20] [2022-12-13 00:54:55,123 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] $Ultimate##0-->L822: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~z~0_41 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|) (= v_~y~0_40 v_~__unbuffered_p2_EAX~0_76)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_41, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset, ~z~0] and [738] $Ultimate##0-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_148 256) 0))) (let ((.cse1 (not .cse7)) (.cse10 (not (= (mod v_~a$w_buff0_used~0_454 256) 0))) (.cse3 (= (mod v_~a$r_buff1_thd4~0_144 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_438 256) 0)) (.cse8 (= (mod v_~a$w_buff0_used~0_455 256) 0))) (let ((.cse0 (not .cse8)) (.cse6 (not .cse4)) (.cse5 (not .cse3)) (.cse9 (and .cse1 .cse10))) (and (= v_~a$w_buff0_used~0_454 (ite (and .cse0 .cse1) 0 v_~a$w_buff0_used~0_455)) (= (+ v_~__unbuffered_cnt~0_1358 1) v_~__unbuffered_cnt~0_1357) (let ((.cse2 (= |v_P3Thread1of1ForFork1_#t~mem19_102| |v_P3_#t~mem19_85|))) (or (and .cse0 .cse2 .cse1 (= |v_P3_#t~ite20_82| |v_P3Thread1of1ForFork1_#t~ite20_102|) (= |v_P3_#t~ite21_78| v_~a$w_buff0~0_269)) (and (= |v_P3_#t~ite20_82| |v_P3_#t~ite21_78|) (or (and (= |v_P3_#t~mem19_85| 1) (or .cse3 .cse4) (= |v_P3_#t~ite20_82| |v_P3_#t~mem19_85|)) (and (= |v_P3_#t~ite20_82| v_~a$w_buff1~0_267) .cse2 .cse5 .cse6)) (or .cse7 .cse8)))) (= (store |v_#memory_int_581| |v_~#a~0.base_263| (store (select |v_#memory_int_581| |v_~#a~0.base_263|) |v_~#a~0.offset_263| |v_P3_#t~ite21_78|)) |v_#memory_int_580|) (= v_P3Thread1of1ForFork1_~arg.offset_51 |v_P3Thread1of1ForFork1_#in~arg.offset_51|) (= (ite (or .cse9 (and .cse5 .cse6)) 0 v_~a$w_buff1_used~0_438) v_~a$w_buff1_used~0_437) (= v_~a$r_buff1_thd4~0_143 (ite (or (and .cse5 (not (= (mod v_~a$w_buff1_used~0_437 256) 0))) (and (not (= (mod v_~a$r_buff0_thd4~0_147 256) 0)) .cse10)) 0 v_~a$r_buff1_thd4~0_144)) (= v_~a$r_buff0_thd4~0_147 (ite .cse9 0 v_~a$r_buff0_thd4~0_148)) (= v_P3Thread1of1ForFork1_~arg.base_51 |v_P3Thread1of1ForFork1_#in~arg.base_51|) (= v_~z~0_77 v_~__unbuffered_p3_EAX~0_108))))) InVars {~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_144, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~#a~0.base=|v_~#a~0.base_263|, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_102|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_148, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_51|, ~a$w_buff1~0=v_~a$w_buff1~0_267, ~a$w_buff0~0=v_~a$w_buff0~0_269, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_51|, #memory_int=|v_#memory_int_581|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1358, ~#a~0.offset=|v_~#a~0.offset_263|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_438, ~z~0=v_~z~0_77, P3Thread1of1ForFork1_#t~ite20=|v_P3Thread1of1ForFork1_#t~ite20_102|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_143, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_454, ~#a~0.base=|v_~#a~0.base_263|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_147, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_51|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_51, ~a$w_buff1~0=v_~a$w_buff1~0_267, ~a$w_buff0~0=v_~a$w_buff0~0_269, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_51|, #memory_int=|v_#memory_int_580|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1357, ~#a~0.offset=|v_~#a~0.offset_263|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_437, ~z~0=v_~z~0_77, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_51, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_53|} AuxVars[|v_P3_#t~ite21_78|, |v_P3_#t~mem19_85|, |v_P3_#t~ite20_82|] AssignedVars[~a$r_buff1_thd4~0, #memory_int, ~__unbuffered_p3_EAX~0, ~a$w_buff0_used~0, P3Thread1of1ForFork1_#t~mem19, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, P3Thread1of1ForFork1_~arg.offset, ~a$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite21, P3Thread1of1ForFork1_~arg.base, P3Thread1of1ForFork1_#t~ite20] [2022-12-13 00:54:55,460 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] $Ultimate##0-->L822: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~z~0_41 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|) (= v_~y~0_40 v_~__unbuffered_p2_EAX~0_76)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_41, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset, ~z~0] and [739] $Ultimate##0-->P3FINAL: Formula: (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_152 256) 0))) (let ((.cse6 (= (mod v_~a$r_buff1_thd4~0_148 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_442 256) 0)) (.cse9 (= (mod v_~a$w_buff0_used~0_459 256) 0)) (.cse3 (not .cse8)) (.cse10 (not (= (mod v_~a$w_buff0_used~0_458 256) 0)))) (let ((.cse0 (and .cse3 .cse10)) (.cse4 (not .cse9)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= |v_P3Thread1of1ForFork1_#res.offset_155| 0) (= v_P3Thread1of1ForFork1_~arg.base_53 |v_P3Thread1of1ForFork1_#in~arg.base_53|) (= v_~z~0_79 v_~__unbuffered_p3_EAX~0_110) (= (store |v_#memory_int_585| |v_~#a~0.base_265| (store (select |v_#memory_int_585| |v_~#a~0.base_265|) |v_~#a~0.offset_265| |v_P3_#t~ite21_80|)) |v_#memory_int_584|) (= v_~a$r_buff0_thd4~0_151 (ite .cse0 0 v_~a$r_buff0_thd4~0_152)) (= (ite (or .cse0 (and .cse1 .cse2)) 0 v_~a$w_buff1_used~0_442) v_~a$w_buff1_used~0_441) (= (ite (and .cse3 .cse4) 0 v_~a$w_buff0_used~0_459) v_~a$w_buff0_used~0_458) (= v_P3Thread1of1ForFork1_~arg.offset_53 |v_P3Thread1of1ForFork1_#in~arg.offset_53|) (= v_~__unbuffered_cnt~0_1361 (+ v_~__unbuffered_cnt~0_1362 1)) (= 0 |v_P3Thread1of1ForFork1_#res.base_155|) (let ((.cse5 (= |v_P3Thread1of1ForFork1_#t~mem19_106| |v_P3_#t~mem19_87|))) (or (and (= |v_P3_#t~ite20_84| |v_P3Thread1of1ForFork1_#t~ite20_106|) .cse5 .cse3 (= |v_P3_#t~ite21_80| v_~a$w_buff0~0_271) .cse4) (and (or (and .cse5 .cse1 (= |v_P3_#t~ite20_84| v_~a$w_buff1~0_269) .cse2) (and (= |v_P3_#t~mem19_87| 1) (= |v_P3_#t~ite20_84| |v_P3_#t~mem19_87|) (or .cse6 .cse7))) (or .cse8 .cse9) (= |v_P3_#t~ite20_84| |v_P3_#t~ite21_80|)))) (= (ite (or (and (not (= (mod v_~a$w_buff1_used~0_441 256) 0)) .cse2) (and (not (= (mod v_~a$r_buff0_thd4~0_151 256) 0)) .cse10)) 0 v_~a$r_buff1_thd4~0_148) v_~a$r_buff1_thd4~0_147))))) InVars {~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_148, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_459, ~#a~0.base=|v_~#a~0.base_265|, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_106|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_152, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_53|, ~a$w_buff1~0=v_~a$w_buff1~0_269, ~a$w_buff0~0=v_~a$w_buff0~0_271, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_53|, #memory_int=|v_#memory_int_585|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1362, ~#a~0.offset=|v_~#a~0.offset_265|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_442, ~z~0=v_~z~0_79, P3Thread1of1ForFork1_#t~ite20=|v_P3Thread1of1ForFork1_#t~ite20_106|} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_155|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_147, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_458, ~#a~0.base=|v_~#a~0.base_265|, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_155|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_151, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_53|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_53, ~a$w_buff1~0=v_~a$w_buff1~0_269, ~a$w_buff0~0=v_~a$w_buff0~0_271, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_53|, #memory_int=|v_#memory_int_584|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1361, ~#a~0.offset=|v_~#a~0.offset_265|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_441, ~z~0=v_~z~0_79, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_53, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_55|} AuxVars[|v_P3_#t~mem19_87|, |v_P3_#t~ite20_84|, |v_P3_#t~ite21_80|] AssignedVars[P3Thread1of1ForFork1_#res.base, ~a$r_buff1_thd4~0, ~a$w_buff0_used~0, P3Thread1of1ForFork1_#t~mem19, P3Thread1of1ForFork1_#res.offset, ~a$r_buff0_thd4~0, P3Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p3_EAX~0, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_#t~ite21, P3Thread1of1ForFork1_#t~ite20] [2022-12-13 00:54:55,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] $Ultimate##0-->L822: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~z~0_41 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|) (= v_~y~0_40 v_~__unbuffered_p2_EAX~0_76)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_41, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset, ~z~0] and [740] $Ultimate##0-->P3EXIT: Formula: (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_156 256) 0))) (let ((.cse3 (not .cse10)) (.cse5 (not (= (mod v_~a$w_buff0_used~0_462 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_446 256) 0)) (.cse7 (= (mod v_~a$r_buff1_thd4~0_152 256) 0)) (.cse9 (= (mod v_~a$w_buff0_used~0_463 256) 0))) (let ((.cse4 (not .cse9)) (.cse0 (not .cse7)) (.cse1 (not .cse8)) (.cse2 (and .cse3 .cse5))) (and (= v_P3Thread1of1ForFork1_~arg.base_55 |v_P3Thread1of1ForFork1_#in~arg.base_55|) (= v_~a$w_buff1_used~0_445 (ite (or (and .cse0 .cse1) .cse2) 0 v_~a$w_buff1_used~0_446)) (= v_~a$w_buff0_used~0_462 (ite (and .cse3 .cse4) 0 v_~a$w_buff0_used~0_463)) (= (ite (or (and .cse5 (not (= (mod v_~a$r_buff0_thd4~0_155 256) 0))) (and .cse0 (not (= (mod v_~a$w_buff1_used~0_445 256) 0)))) 0 v_~a$r_buff1_thd4~0_152) v_~a$r_buff1_thd4~0_151) (= |v_P3Thread1of1ForFork1_#res.offset_157| 0) (= 0 |v_P3Thread1of1ForFork1_#res.base_157|) (let ((.cse6 (= |v_P3Thread1of1ForFork1_#t~mem19_110| |v_P3_#t~mem19_89|))) (or (and .cse3 .cse4 (= |v_P3_#t~ite21_82| v_~a$w_buff0~0_273) (= |v_P3_#t~ite20_86| |v_P3Thread1of1ForFork1_#t~ite20_110|) .cse6) (and (or (and .cse0 .cse6 (= |v_P3_#t~ite20_86| v_~a$w_buff1~0_271) .cse1) (and (= |v_P3_#t~ite20_86| |v_P3_#t~mem19_89|) (or .cse7 .cse8) (= |v_P3_#t~mem19_89| 1))) (= |v_P3_#t~ite20_86| |v_P3_#t~ite21_82|) (or .cse9 .cse10)))) (= v_P3Thread1of1ForFork1_~arg.offset_55 |v_P3Thread1of1ForFork1_#in~arg.offset_55|) (= v_~a$r_buff0_thd4~0_155 (ite .cse2 0 v_~a$r_buff0_thd4~0_156)) (= (store |v_#memory_int_589| |v_~#a~0.base_267| (store (select |v_#memory_int_589| |v_~#a~0.base_267|) |v_~#a~0.offset_267| |v_P3_#t~ite21_82|)) |v_#memory_int_588|) (= v_~z~0_81 v_~__unbuffered_p3_EAX~0_112) (= v_~__unbuffered_cnt~0_1365 (+ v_~__unbuffered_cnt~0_1366 1)))))) InVars {~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_152, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_463, ~#a~0.base=|v_~#a~0.base_267|, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_110|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_156, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_55|, ~a$w_buff1~0=v_~a$w_buff1~0_271, ~a$w_buff0~0=v_~a$w_buff0~0_273, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_55|, #memory_int=|v_#memory_int_589|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1366, ~#a~0.offset=|v_~#a~0.offset_267|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_446, ~z~0=v_~z~0_81, P3Thread1of1ForFork1_#t~ite20=|v_P3Thread1of1ForFork1_#t~ite20_110|} OutVars{P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_157|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_151, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_462, ~#a~0.base=|v_~#a~0.base_267|, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_157|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_155, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_55|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_55, ~a$w_buff1~0=v_~a$w_buff1~0_271, ~a$w_buff0~0=v_~a$w_buff0~0_273, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_55|, #memory_int=|v_#memory_int_588|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_112, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1365, ~#a~0.offset=|v_~#a~0.offset_267|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_445, ~z~0=v_~z~0_81, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_55, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_57|} AuxVars[|v_P3_#t~ite20_86|, |v_P3_#t~ite21_82|, |v_P3_#t~mem19_89|] AssignedVars[P3Thread1of1ForFork1_#res.base, ~a$r_buff1_thd4~0, ~a$w_buff0_used~0, P3Thread1of1ForFork1_#t~mem19, P3Thread1of1ForFork1_#res.offset, ~a$r_buff0_thd4~0, P3Thread1of1ForFork1_~arg.base, #memory_int, ~__unbuffered_p3_EAX~0, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_#t~ite21, P3Thread1of1ForFork1_#t~ite20] [2022-12-13 00:54:56,163 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [718] $Ultimate##0-->L822: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_17| v_P2Thread1of1ForFork3_~arg.offset_17) (= v_~z~0_41 1) (= v_P2Thread1of1ForFork3_~arg.base_17 |v_P2Thread1of1ForFork3_#in~arg.base_17|) (= v_~y~0_40 v_~__unbuffered_p2_EAX~0_76)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_17, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_17, ~z~0=v_~z~0_41, ~y~0=v_~y~0_40, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset, ~z~0] and [741] $Ultimate##0-->L847: Formula: (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_160 256) 0))) (let ((.cse8 (= (mod v_~a$w_buff0_used~0_467 256) 0)) (.cse9 (= (mod v_~a$w_buff1_used~0_450 256) 0)) (.cse10 (= (mod v_~a$r_buff1_thd4~0_156 256) 0)) (.cse3 (not (= (mod v_~a$w_buff0_used~0_466 256) 0))) (.cse6 (not .cse7))) (let ((.cse0 (and .cse3 .cse6)) (.cse1 (not .cse10)) (.cse2 (not .cse9)) (.cse4 (not .cse8))) (and (= (ite (or .cse0 (and .cse1 .cse2)) 0 v_~a$w_buff1_used~0_450) v_~a$w_buff1_used~0_449) (= v_~z~0_83 v_~__unbuffered_p3_EAX~0_114) (= v_~a$r_buff0_thd4~0_159 (ite .cse0 0 v_~a$r_buff0_thd4~0_160)) (= (ite (or (and .cse1 (not (= (mod v_~a$w_buff1_used~0_449 256) 0))) (and .cse3 (not (= (mod v_~a$r_buff0_thd4~0_159 256) 0)))) 0 v_~a$r_buff1_thd4~0_156) v_~a$r_buff1_thd4~0_155) (let ((.cse5 (= |v_P3Thread1of1ForFork1_#t~mem19_114| |v_P3_#t~mem19_91|))) (or (and .cse4 (= |v_P3_#t~ite21_84| v_~a$w_buff0~0_275) (= |v_P3_#t~ite20_88| |v_P3Thread1of1ForFork1_#t~ite20_114|) .cse5 .cse6) (and (or .cse7 .cse8) (or (and (or .cse9 .cse10) (= |v_P3_#t~ite20_88| |v_P3_#t~mem19_91|) (= |v_P3_#t~mem19_91| 1)) (and .cse1 .cse2 (= |v_P3_#t~ite20_88| v_~a$w_buff1~0_273) .cse5)) (= |v_P3_#t~ite20_88| |v_P3_#t~ite21_84|)))) (= (+ v_~__unbuffered_cnt~0_1370 1) v_~__unbuffered_cnt~0_1369) (= (store |v_#memory_int_593| |v_~#a~0.base_269| (store (select |v_#memory_int_593| |v_~#a~0.base_269|) |v_~#a~0.offset_269| |v_P3_#t~ite21_84|)) |v_#memory_int_592|) (= (ite (and .cse4 .cse6) 0 v_~a$w_buff0_used~0_467) v_~a$w_buff0_used~0_466) (= v_P3Thread1of1ForFork1_~arg.offset_57 |v_P3Thread1of1ForFork1_#in~arg.offset_57|) (= v_P3Thread1of1ForFork1_~arg.base_57 |v_P3Thread1of1ForFork1_#in~arg.base_57|))))) InVars {~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_156, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_467, ~#a~0.base=|v_~#a~0.base_269|, P3Thread1of1ForFork1_#t~mem19=|v_P3Thread1of1ForFork1_#t~mem19_114|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_160, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_57|, ~a$w_buff1~0=v_~a$w_buff1~0_273, ~a$w_buff0~0=v_~a$w_buff0~0_275, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_57|, #memory_int=|v_#memory_int_593|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1370, ~#a~0.offset=|v_~#a~0.offset_269|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~z~0=v_~z~0_83, P3Thread1of1ForFork1_#t~ite20=|v_P3Thread1of1ForFork1_#t~ite20_114|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_155, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_466, ~#a~0.base=|v_~#a~0.base_269|, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_159, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_57|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_57, ~a$w_buff1~0=v_~a$w_buff1~0_273, ~a$w_buff0~0=v_~a$w_buff0~0_275, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_57|, #memory_int=|v_#memory_int_592|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1369, ~#a~0.offset=|v_~#a~0.offset_269|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_449, ~z~0=v_~z~0_83, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_57, P3Thread1of1ForFork1_#t~ite21=|v_P3Thread1of1ForFork1_#t~ite21_59|} AuxVars[|v_P3_#t~mem19_91|, |v_P3_#t~ite20_88|, |v_P3_#t~ite21_84|] AssignedVars[~a$r_buff1_thd4~0, #memory_int, ~__unbuffered_p3_EAX~0, ~a$w_buff0_used~0, P3Thread1of1ForFork1_#t~mem19, ~__unbuffered_cnt~0, ~a$w_buff1_used~0, P3Thread1of1ForFork1_~arg.offset, ~a$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite21, P3Thread1of1ForFork1_~arg.base, P3Thread1of1ForFork1_#t~ite20] [2022-12-13 00:54:57,228 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:54:57,229 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10558 [2022-12-13 00:54:57,229 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 62 transitions, 534 flow [2022-12-13 00:54:57,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:54:57,229 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:54:57,229 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:57,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:54:57,230 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 00:54:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:54:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2001931540, now seen corresponding path program 1 times [2022-12-13 00:54:57,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:54:57,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606020965] [2022-12-13 00:54:57,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:54:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:54:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:54:57,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:54:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:54:57,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:54:57,365 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:54:57,366 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 00:54:57,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 00:54:57,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 00:54:57,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 00:54:57,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 00:54:57,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:54:57,368 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:54:57,371 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:54:57,371 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:54:57,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:54:57 BasicIcfg [2022-12-13 00:54:57,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:54:57,450 INFO L158 Benchmark]: Toolchain (without parser) took 34534.09ms. Allocated memory was 127.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 97.0MB in the beginning and 669.8MB in the end (delta: -572.8MB). Peak memory consumption was 760.7MB. Max. memory is 8.0GB. [2022-12-13 00:54:57,450 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 105.3MB in the beginning and 105.3MB in the end (delta: 34.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:54:57,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.81ms. Allocated memory was 127.9MB in the beginning and 195.0MB in the end (delta: 67.1MB). Free memory was 96.7MB in the beginning and 163.4MB in the end (delta: -66.7MB). Peak memory consumption was 23.5MB. Max. memory is 8.0GB. [2022-12-13 00:54:57,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.88ms. Allocated memory is still 195.0MB. Free memory was 163.4MB in the beginning and 161.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:54:57,450 INFO L158 Benchmark]: Boogie Preprocessor took 26.38ms. Allocated memory is still 195.0MB. Free memory was 161.3MB in the beginning and 158.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:54:57,451 INFO L158 Benchmark]: RCFGBuilder took 798.99ms. Allocated memory is still 195.0MB. Free memory was 158.7MB in the beginning and 137.2MB in the end (delta: 21.5MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-13 00:54:57,451 INFO L158 Benchmark]: TraceAbstraction took 33141.69ms. Allocated memory was 195.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 135.7MB in the beginning and 669.8MB in the end (delta: -534.1MB). Peak memory consumption was 733.0MB. Max. memory is 8.0GB. [2022-12-13 00:54:57,452 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.10ms. Allocated memory is still 127.9MB. Free memory was 105.3MB in the beginning and 105.3MB in the end (delta: 34.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 475.81ms. Allocated memory was 127.9MB in the beginning and 195.0MB in the end (delta: 67.1MB). Free memory was 96.7MB in the beginning and 163.4MB in the end (delta: -66.7MB). Peak memory consumption was 23.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.88ms. Allocated memory is still 195.0MB. Free memory was 163.4MB in the beginning and 161.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.38ms. Allocated memory is still 195.0MB. Free memory was 161.3MB in the beginning and 158.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 798.99ms. Allocated memory is still 195.0MB. Free memory was 158.7MB in the beginning and 137.2MB in the end (delta: 21.5MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 33141.69ms. Allocated memory was 195.0MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 135.7MB in the beginning and 669.8MB in the end (delta: -534.1MB). Peak memory consumption was 733.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 141 PlacesBefore, 49 PlacesAfterwards, 129 TransitionsBefore, 37 TransitionsAfterwards, 1822 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 64 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 106 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2841, independent: 2722, independent conditional: 2722, independent unconditional: 0, dependent: 119, dependent conditional: 119, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2841, independent: 2722, independent conditional: 0, independent unconditional: 2722, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2841, independent: 2722, independent conditional: 0, independent unconditional: 2722, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2841, independent: 2722, independent conditional: 0, independent unconditional: 2722, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1490, independent: 1435, independent conditional: 0, independent unconditional: 1435, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1490, independent: 1345, independent conditional: 0, independent unconditional: 1345, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 145, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 306, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 223, dependent conditional: 0, dependent unconditional: 223, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2841, independent: 1287, independent conditional: 0, independent unconditional: 1287, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 1490, unknown conditional: 0, unknown unconditional: 1490] , Statistics on independence cache: Total cache size (in pairs): 2131, Positive cache size: 2076, Positive conditional cache size: 0, Positive unconditional cache size: 2076, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, 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, 45 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 762 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 380, independent: 342, independent conditional: 342, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 380, independent: 342, independent conditional: 0, independent unconditional: 342, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 380, independent: 342, independent conditional: 0, independent unconditional: 342, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 380, independent: 342, independent conditional: 0, independent unconditional: 342, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 294, independent: 266, independent conditional: 0, independent unconditional: 266, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 294, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 92, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 222, independent: 49, independent conditional: 0, independent unconditional: 49, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 380, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 294, unknown conditional: 0, unknown unconditional: 294] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 266, Positive conditional cache size: 0, Positive unconditional cache size: 266, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 758 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 377, independent: 341, independent conditional: 341, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 377, independent: 341, independent conditional: 9, independent unconditional: 332, dependent: 36, dependent conditional: 4, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 377, independent: 341, independent conditional: 0, independent unconditional: 341, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 377, independent: 341, independent conditional: 0, independent unconditional: 341, dependent: 36, dependent conditional: 0, dependent unconditional: 36, 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: 377, independent: 341, independent conditional: 0, independent unconditional: 341, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 266, Positive conditional cache size: 0, Positive unconditional cache size: 266, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 754 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 376, independent: 341, independent conditional: 341, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 376, independent: 341, independent conditional: 9, independent unconditional: 332, dependent: 35, dependent conditional: 4, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 376, independent: 341, independent conditional: 0, independent unconditional: 341, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 376, independent: 341, independent conditional: 0, independent unconditional: 341, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 376, independent: 338, independent conditional: 0, independent unconditional: 338, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 269, Positive conditional cache size: 0, Positive unconditional cache size: 269, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 373, independent: 339, independent conditional: 339, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 373, independent: 339, independent conditional: 13, independent unconditional: 326, dependent: 34, dependent conditional: 4, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 373, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 373, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 34, dependent conditional: 0, dependent unconditional: 34, 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: 373, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 269, Positive conditional cache size: 0, Positive unconditional cache size: 269, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 52 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 682, independent: 621, independent conditional: 621, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 682, independent: 621, independent conditional: 43, independent unconditional: 578, dependent: 61, dependent conditional: 8, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 682, independent: 621, independent conditional: 0, independent unconditional: 621, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 682, independent: 621, independent conditional: 0, independent unconditional: 621, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 29, independent conditional: 0, independent unconditional: 29, 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: 31, independent: 29, independent conditional: 0, independent unconditional: 29, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 682, independent: 592, independent conditional: 0, independent unconditional: 592, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 345, Positive cache size: 312, Positive conditional cache size: 0, Positive unconditional cache size: 312, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 51, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 52 PlacesBefore, 51 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 588, independent: 537, independent conditional: 537, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 588, independent: 537, independent conditional: 51, independent unconditional: 486, dependent: 51, dependent conditional: 2, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 588, independent: 537, independent conditional: 0, independent unconditional: 537, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 588, independent: 537, independent conditional: 0, independent unconditional: 537, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 87, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 87, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 588, independent: 453, independent conditional: 0, independent unconditional: 453, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 87, unknown conditional: 0, unknown unconditional: 87] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 412, Positive conditional cache size: 0, Positive unconditional cache size: 412, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 53, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 51 PlacesBefore, 50 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 398, independent: 356, independent conditional: 356, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 398, independent: 356, independent conditional: 34, independent unconditional: 322, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 398, independent: 356, independent conditional: 0, independent unconditional: 356, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 398, independent: 356, independent conditional: 0, independent unconditional: 356, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 23, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 398, independent: 335, independent conditional: 0, independent unconditional: 335, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 493, Positive cache size: 455, Positive conditional cache size: 0, Positive unconditional cache size: 455, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 49 PlacesBefore, 48 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 387, independent: 349, independent conditional: 349, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 387, independent: 349, independent conditional: 59, independent unconditional: 290, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 390, independent: 349, independent conditional: 10, independent unconditional: 339, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 390, independent: 349, independent conditional: 10, independent unconditional: 339, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 26, independent conditional: 5, independent unconditional: 21, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 390, independent: 323, independent conditional: 5, independent unconditional: 318, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 30, unknown conditional: 5, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 527, Positive cache size: 485, Positive conditional cache size: 5, Positive unconditional cache size: 480, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 49 PlacesBefore, 49 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 67, independent: 53, independent conditional: 39, independent unconditional: 14, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 53, independent conditional: 30, independent unconditional: 23, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 53, independent conditional: 30, independent unconditional: 23, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 67, independent: 50, independent conditional: 30, independent unconditional: 20, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 575, Positive cache size: 533, Positive conditional cache size: 5, Positive unconditional cache size: 528, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 53 PlacesBefore, 53 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 487, independent: 467, independent conditional: 467, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 487, independent: 467, independent conditional: 267, independent unconditional: 200, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 487, independent: 467, independent conditional: 261, independent unconditional: 206, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 487, independent: 467, independent conditional: 261, independent unconditional: 206, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 6, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 487, independent: 457, independent conditional: 255, independent unconditional: 202, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 10, unknown conditional: 6, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 624, Positive cache size: 582, Positive conditional cache size: 11, Positive unconditional cache size: 571, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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.0s, 56 PlacesBefore, 56 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, 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: 39, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 624, Positive cache size: 582, Positive conditional cache size: 11, Positive unconditional cache size: 571, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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: 10.5s, 58 PlacesBefore, 53 PlacesAfterwards, 67 TransitionsBefore, 62 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 381, independent: 381, independent conditional: 381, 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: 381, independent: 381, independent conditional: 381, 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: 381, independent: 381, independent conditional: 228, independent unconditional: 153, 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: 381, independent: 381, independent conditional: 228, independent unconditional: 153, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 381, independent: 378, independent conditional: 228, independent unconditional: 150, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 787, Positive cache size: 745, Positive conditional cache size: 11, Positive unconditional cache size: 734, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 153, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L861] 0 pthread_t t2705; [L862] FCALL, FORK 0 pthread_create(&t2705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2705, ((void *)0), P0, ((void *)0))=0, t2705={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L777] EXPR 1 !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L777] EXPR 1 \read(a) [L777] EXPR 1 !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L777] 1 a = !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L778] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)))) [L779] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)))) [L780] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L781] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L782] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L783] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$r_buff1_thd1 : (_Bool)0) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L784] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L785] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L786] EXPR 1 \read(a) [L786] 1 __unbuffered_p0_EAX = a [L787] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L787] 1 a = a$flush_delayed ? a$mem_tmp : a [L788] 1 a$flush_delayed = (_Bool)0 [L791] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=0, z=0] [L863] 0 pthread_t t2706; [L864] FCALL, FORK 0 pthread_create(&t2706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2706, ((void *)0), P1, ((void *)0))=1, t2705={5:0}, t2706={7:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=0, z=0] [L865] 0 pthread_t t2707; [L866] FCALL, FORK 0 pthread_create(&t2707, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2707, ((void *)0), P2, ((void *)0))=2, t2705={5:0}, t2706={7:0}, t2707={8:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=0, z=0] [L867] 0 pthread_t t2708; [L868] FCALL, FORK 0 pthread_create(&t2708, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2708, ((void *)0), P3, ((void *)0))=3, t2705={5:0}, t2706={7:0}, t2707={8:0}, t2708={9:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=0, z=0] [L803] 2 __unbuffered_p1_EAX = x [L806] 2 y = 1 [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L796] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 1 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=1, z=0] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L818] 3 __unbuffered_p2_EAX = y [L821] 3 z = 1 [L833] 3 __unbuffered_p3_EAX = z [L836] 3 a = 1 [L839] EXPR 3 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] EXPR 3 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L839] EXPR 3 \read(a) [L839] EXPR 3 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L839] EXPR 3 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 3 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 3 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 3 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L846] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 3 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L874] EXPR 0 \read(a) [L874] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 862]: 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: 864]: 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: 868]: 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: 866]: 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, 179 locations, 5 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: 32.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 383 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 383 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1143 IncrementalHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 3 mSDtfsCounter, 1143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=537occurred in iteration=11, InterpolantAutomatonStates: 53, 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.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 778 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:54:57,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...