/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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:52:48,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:52:48,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:52:48,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:52:48,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:52:48,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:52:48,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:52:48,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:52:48,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:52:48,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:52:48,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:52:48,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:52:48,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:52:48,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:52:48,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:52:48,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:52:48,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:52:48,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:52:48,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:52:48,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:52:48,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:52:48,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:52:48,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:52:48,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:52:48,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:52:48,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:52:48,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:52:48,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:52:48,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:52:48,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:52:48,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:52:48,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:52:48,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:52:48,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:52:48,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:52:48,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:52:48,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:52:48,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:52:48,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:52:48,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:52:48,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:52:48,166 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:52:48,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:52:48,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:52:48,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:52:48,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:52:48,196 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:52:48,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:52:48,196 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:52:48,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:52:48,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:52:48,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:52:48,197 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:52:48,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:52:48,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:52:48,198 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:52:48,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:52:48,198 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:52:48,198 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:52:48,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:52:48,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:52:48,198 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:52:48,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:52:48,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:52:48,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:52:48,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:52:48,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:52:48,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:52:48,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:52:48,199 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:52:48,200 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:52:48,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:52:48,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:52:48,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:52:48,536 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:52:48,536 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:52:48,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:52:49,616 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:52:49,856 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:52:49,856 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:52:49,869 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/222f2d324/f4adba85feef4aad9b74349e3a8fa3d1/FLAGbd6276e03 [2022-12-13 00:52:49,883 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/222f2d324/f4adba85feef4aad9b74349e3a8fa3d1 [2022-12-13 00:52:49,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:52:49,886 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:52:49,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:52:49,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:52:49,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:52:49,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:52:49" (1/1) ... [2022-12-13 00:52:49,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec6af7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:49, skipping insertion in model container [2022-12-13 00:52:49,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:52:49" (1/1) ... [2022-12-13 00:52:49,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:52:49,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:52:50,132 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 00:52:50,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:52:50,379 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:52:50,389 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 00:52:50,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:50,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:50,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:52:50,521 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:52:50,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:50 WrapperNode [2022-12-13 00:52:50,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:52:50,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:52:50,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:52:50,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:52:50,528 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:52:50" (1/1) ... [2022-12-13 00:52:50,552 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:52:50" (1/1) ... [2022-12-13 00:52:50,578 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-13 00:52:50,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:52:50,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:52:50,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:52:50,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:52:50,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:50" (1/1) ... [2022-12-13 00:52:50,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:50" (1/1) ... [2022-12-13 00:52:50,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:50" (1/1) ... [2022-12-13 00:52:50,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:50" (1/1) ... [2022-12-13 00:52:50,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:50" (1/1) ... [2022-12-13 00:52:50,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:50" (1/1) ... [2022-12-13 00:52:50,604 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:50" (1/1) ... [2022-12-13 00:52:50,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:50" (1/1) ... [2022-12-13 00:52:50,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:52:50,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:52:50,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:52:50,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:52:50,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:50" (1/1) ... [2022-12-13 00:52:50,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:52:50,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:52:50,667 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:52:50,719 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:52:50,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:52:50,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:52:50,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:52:50,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:52:50,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:52:50,735 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:52:50,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:52:50,736 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:52:50,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:52:50,736 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:52:50,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:52:50,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:52:50,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:52:50,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:52:50,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:52:50,737 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:52:50,876 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:52:50,877 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:52:51,217 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:52:51,412 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:52:51,413 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:52:51,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:51 BoogieIcfgContainer [2022-12-13 00:52:51,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:52:51,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:52:51,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:52:51,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:52:51,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:52:49" (1/3) ... [2022-12-13 00:52:51,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba75ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:52:51, skipping insertion in model container [2022-12-13 00:52:51,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:50" (2/3) ... [2022-12-13 00:52:51,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba75ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:52:51, skipping insertion in model container [2022-12-13 00:52:51,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:51" (3/3) ... [2022-12-13 00:52:51,421 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:52:51,444 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:52:51,444 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:52:51,445 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:52:51,495 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:52:51,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2022-12-13 00:52:51,571 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-13 00:52:51,571 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:51,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 00:52:51,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2022-12-13 00:52:51,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2022-12-13 00:52:51,582 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:51,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-13 00:52:51,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2022-12-13 00:52:51,640 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-13 00:52:51,641 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:51,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 00:52:51,646 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-13 00:52:51,647 INFO L226 LiptonReduction]: Number of co-enabled transitions 2022 [2022-12-13 00:52:59,191 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-13 00:52:59,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:52:59,219 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;@44ac6b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:52:59,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:52:59,222 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 00:52:59,222 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:59,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:59,223 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:52:59,224 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:52:59,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:59,227 INFO L85 PathProgramCache]: Analyzing trace with hash 534766748, now seen corresponding path program 1 times [2022-12-13 00:52:59,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:59,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083406465] [2022-12-13 00:52:59,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:59,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:59,597 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:52:59,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:59,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083406465] [2022-12-13 00:52:59,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083406465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:59,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:59,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:52:59,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866683216] [2022-12-13 00:52:59,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:59,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:52:59,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:59,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:52:59,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:52:59,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 63 [2022-12-13 00:52:59,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:52:59,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:59,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 63 [2022-12-13 00:52:59,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:01,899 INFO L130 PetriNetUnfolder]: 13749/21906 cut-off events. [2022-12-13 00:53:01,899 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-13 00:53:01,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41431 conditions, 21906 events. 13749/21906 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 167836 event pairs, 1853 based on Foata normal form. 0/14290 useless extension candidates. Maximal degree in co-relation 41420. Up to 16433 conditions per place. [2022-12-13 00:53:01,957 INFO L137 encePairwiseOnDemand]: 57/63 looper letters, 38 selfloop transitions, 2 changer transitions 52/101 dead transitions. [2022-12-13 00:53:01,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 101 transitions, 398 flow [2022-12-13 00:53:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:53:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:53:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-12-13 00:53:01,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:53:01,967 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 135 flow. Second operand 3 states and 126 transitions. [2022-12-13 00:53:01,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 101 transitions, 398 flow [2022-12-13 00:53:01,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 101 transitions, 394 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:53:01,971 INFO L231 Difference]: Finished difference. Result has 68 places, 33 transitions, 76 flow [2022-12-13 00:53:01,972 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=68, PETRI_TRANSITIONS=33} [2022-12-13 00:53:01,974 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2022-12-13 00:53:01,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:01,975 INFO L89 Accepts]: Start accepts. Operand has 68 places, 33 transitions, 76 flow [2022-12-13 00:53:01,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:01,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:01,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 33 transitions, 76 flow [2022-12-13 00:53:01,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 76 flow [2022-12-13 00:53:01,983 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 00:53:01,983 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:01,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 88 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:53:01,985 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 76 flow [2022-12-13 00:53:01,985 INFO L226 LiptonReduction]: Number of co-enabled transitions 620 [2022-12-13 00:53:02,044 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:02,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-13 00:53:02,046 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 76 flow [2022-12-13 00:53:02,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:53:02,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:02,046 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:02,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:53:02,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:02,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:02,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1359137346, now seen corresponding path program 1 times [2022-12-13 00:53:02,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:02,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052601662] [2022-12-13 00:53:02,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:02,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:02,201 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:53:02,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:02,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052601662] [2022-12-13 00:53:02,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052601662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:02,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:02,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:53:02,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674314451] [2022-12-13 00:53:02,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:02,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:53:02,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:02,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:53:02,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:53:02,203 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 00:53:02,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:02,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:02,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 00:53:02,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:02,529 INFO L130 PetriNetUnfolder]: 1774/2785 cut-off events. [2022-12-13 00:53:02,529 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-12-13 00:53:02,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5648 conditions, 2785 events. 1774/2785 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14731 event pairs, 670 based on Foata normal form. 90/2451 useless extension candidates. Maximal degree in co-relation 5638. Up to 1723 conditions per place. [2022-12-13 00:53:02,542 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 37 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2022-12-13 00:53:02,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 190 flow [2022-12-13 00:53:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:53:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:53:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 00:53:02,543 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6767676767676768 [2022-12-13 00:53:02,543 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 76 flow. Second operand 3 states and 67 transitions. [2022-12-13 00:53:02,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 190 flow [2022-12-13 00:53:02,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:53:02,546 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 80 flow [2022-12-13 00:53:02,546 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-13 00:53:02,547 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -29 predicate places. [2022-12-13 00:53:02,547 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:02,547 INFO L89 Accepts]: Start accepts. Operand has 43 places, 33 transitions, 80 flow [2022-12-13 00:53:02,548 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:02,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:02,548 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 80 flow [2022-12-13 00:53:02,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 80 flow [2022-12-13 00:53:02,553 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 00:53:02,553 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:02,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 93 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:53:02,554 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 80 flow [2022-12-13 00:53:02,554 INFO L226 LiptonReduction]: Number of co-enabled transitions 612 [2022-12-13 00:53:02,651 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:02,652 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 00:53:02,652 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 80 flow [2022-12-13 00:53:02,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:02,653 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:02,653 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:02,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:53:02,653 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:02,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:02,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1524847112, now seen corresponding path program 1 times [2022-12-13 00:53:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:02,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051875682] [2022-12-13 00:53:02,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:02,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:02,884 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:53:02,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:02,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051875682] [2022-12-13 00:53:02,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051875682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:02,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:02,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:53:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681557506] [2022-12-13 00:53:02,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:02,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:53:02,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:02,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:53:02,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:53:02,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 00:53:02,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:53:02,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:02,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 00:53:02,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:03,183 INFO L130 PetriNetUnfolder]: 1723/2689 cut-off events. [2022-12-13 00:53:03,184 INFO L131 PetriNetUnfolder]: For 199/199 co-relation queries the response was YES. [2022-12-13 00:53:03,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5622 conditions, 2689 events. 1723/2689 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13431 event pairs, 348 based on Foata normal form. 20/2293 useless extension candidates. Maximal degree in co-relation 5611. Up to 2081 conditions per place. [2022-12-13 00:53:03,198 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 34 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-12-13 00:53:03,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 179 flow [2022-12-13 00:53:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:53:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:53:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 00:53:03,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2022-12-13 00:53:03,200 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 80 flow. Second operand 3 states and 64 transitions. [2022-12-13 00:53:03,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 179 flow [2022-12-13 00:53:03,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:53:03,202 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 84 flow [2022-12-13 00:53:03,202 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-13 00:53:03,203 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -28 predicate places. [2022-12-13 00:53:03,203 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:03,203 INFO L89 Accepts]: Start accepts. Operand has 44 places, 33 transitions, 84 flow [2022-12-13 00:53:03,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:03,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:03,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 84 flow [2022-12-13 00:53:03,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 84 flow [2022-12-13 00:53:03,209 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 00:53:03,209 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 00:53:03,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 33 events. 0/33 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 93 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:53:03,209 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 84 flow [2022-12-13 00:53:03,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 608 [2022-12-13 00:53:03,211 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:03,211 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 00:53:03,212 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 84 flow [2022-12-13 00:53:03,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:53:03,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:03,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:03,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:53:03,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:03,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:03,213 INFO L85 PathProgramCache]: Analyzing trace with hash -638826841, now seen corresponding path program 1 times [2022-12-13 00:53:03,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:03,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264459636] [2022-12-13 00:53:03,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:03,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:03,750 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:53:03,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:03,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264459636] [2022-12-13 00:53:03,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264459636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:03,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:03,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:53:03,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475767636] [2022-12-13 00:53:03,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:03,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:53:03,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:03,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:53:03,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:53:03,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 00:53:03,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:53:03,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:03,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 00:53:03,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:04,227 INFO L130 PetriNetUnfolder]: 2244/3497 cut-off events. [2022-12-13 00:53:04,227 INFO L131 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2022-12-13 00:53:04,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7504 conditions, 3497 events. 2244/3497 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 18638 event pairs, 290 based on Foata normal form. 12/3038 useless extension candidates. Maximal degree in co-relation 7492. Up to 2195 conditions per place. [2022-12-13 00:53:04,241 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 51 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2022-12-13 00:53:04,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 75 transitions, 321 flow [2022-12-13 00:53:04,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:53:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:53:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-13 00:53:04,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6606060606060606 [2022-12-13 00:53:04,243 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 84 flow. Second operand 5 states and 109 transitions. [2022-12-13 00:53:04,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 75 transitions, 321 flow [2022-12-13 00:53:04,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 75 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:53:04,245 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 197 flow [2022-12-13 00:53:04,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2022-12-13 00:53:04,246 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -23 predicate places. [2022-12-13 00:53:04,246 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:04,246 INFO L89 Accepts]: Start accepts. Operand has 49 places, 47 transitions, 197 flow [2022-12-13 00:53:04,247 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:04,247 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:04,247 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 47 transitions, 197 flow [2022-12-13 00:53:04,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 47 transitions, 197 flow [2022-12-13 00:53:04,286 INFO L130 PetriNetUnfolder]: 195/527 cut-off events. [2022-12-13 00:53:04,287 INFO L131 PetriNetUnfolder]: For 142/160 co-relation queries the response was YES. [2022-12-13 00:53:04,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 527 events. 195/527 cut-off events. For 142/160 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3446 event pairs, 95 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 1198. Up to 243 conditions per place. [2022-12-13 00:53:04,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 47 transitions, 197 flow [2022-12-13 00:53:04,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 720 [2022-12-13 00:53:04,683 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [396] L768-->L775: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_66 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_183 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= 0 (mod v_~y$w_buff0_used~0_184 256))))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_173 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd1~0_66) v_~y$r_buff0_thd1~0_65) (= (ite .cse1 0 v_~y$w_buff0_used~0_184) v_~y$w_buff0_used~0_183) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_173) v_~y$w_buff1_used~0_172) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_172 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_65 256) 0)))) 0 v_~y$r_buff1_thd1~0_56) v_~y$r_buff1_thd1~0_55) (= v_~y~0_143 (ite .cse1 v_~y$w_buff0~0_78 (ite .cse2 v_~y$w_buff1~0_77 v_~y~0_144)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_184, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, ~y~0=v_~y~0_144, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_55, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_183, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y~0=v_~y~0_143, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:53:04,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [410] L814-->L830: Formula: (let ((.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse9 (= (mod v_~y$r_buff0_thd3~0_62 256) 0))) (let ((.cse10 (not .cse9)) (.cse12 (= (mod v_~y$w_buff0_used~0_218 256) 0)) (.cse8 (and .cse5 .cse9)) (.cse11 (and (= (mod v_~y$w_buff1_used~0_205 256) 0) .cse9))) (let ((.cse1 (or .cse12 .cse8 .cse11)) (.cse2 (and (not .cse12) .cse10))) (let ((.cse6 (= (mod v_~y$w_buff1_used~0_204 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_90 256) 0))) (.cse7 (= (mod v_~y$w_buff0_used~0_217 256) 0)) (.cse3 (ite .cse1 v_~y~0_178 (ite .cse2 v_~y$w_buff0~0_103 v_~y$w_buff1~0_106)))) (and (= (ite .cse0 v_~y$w_buff0_used~0_218 (ite .cse1 v_~y$w_buff0_used~0_218 (ite .cse2 0 v_~y$w_buff0_used~0_218))) v_~y$w_buff0_used~0_217) (= v_~y~0_177 (ite .cse0 v_~y$mem_tmp~0_48 .cse3)) (= (ite .cse0 v_~y$r_buff1_thd3~0_56 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_61 256) 0))) (or (and .cse4 .cse5) (and .cse6 .cse4) .cse7)) v_~y$r_buff1_thd3~0_56 0)) v_~y$r_buff1_thd3~0_55) (= v_~y$w_buff0~0_103 v_~y$w_buff0~0_102) (= v_~y$r_buff0_thd3~0_61 (ite .cse0 v_~y$r_buff0_thd3~0_62 (ite (or .cse8 (and .cse6 .cse9) .cse7) v_~y$r_buff0_thd3~0_62 (ite (and (not .cse7) .cse10) 0 v_~y$r_buff0_thd3~0_62)))) (= 0 v_~y$flush_delayed~0_61) (= (ite .cse0 v_~y$w_buff1_used~0_205 (ite (or .cse8 .cse11 .cse7) v_~y$w_buff1_used~0_205 0)) v_~y$w_buff1_used~0_204) (= v_~__unbuffered_p2_EBX~0_20 .cse3) (= |v_P2Thread1of1ForFork0_#t~nondet6_1| v_~weak$$choice2~0_90) (= v_~y$w_buff1~0_105 v_~y$w_buff1~0_106) (= v_~y~0_178 v_~y$mem_tmp~0_48) (= |v_P2Thread1of1ForFork0_#t~nondet5_1| v_~weak$$choice0~0_25)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_106, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_62, ~y$w_buff0~0=v_~y$w_buff0~0_103, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_1|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_1|, ~y~0=v_~y~0_178, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_205} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_217, ~weak$$choice0~0=v_~weak$$choice0~0_25, ~y$mem_tmp~0=v_~y$mem_tmp~0_48, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, ~y$w_buff1~0=v_~y$w_buff1~0_105, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_61, ~y$w_buff0~0=v_~y$w_buff0~0_102, ~y$flush_delayed~0=v_~y$flush_delayed~0_61, ~y~0=v_~y~0_177, ~weak$$choice2~0=v_~weak$$choice2~0_90, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_204} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 00:53:04,869 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [394] L745-->L752: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_50 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_60 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_167 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_168 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_156 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_157)) (= (ite .cse2 0 v_~y$w_buff0_used~0_168) v_~y$w_buff0_used~0_167) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_156 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_59 256) 0)))) 0 v_~y$r_buff1_thd1~0_50) v_~y$r_buff1_thd1~0_49) (= v_~y$r_buff0_thd1~0_59 (ite .cse0 0 v_~y$r_buff0_thd1~0_60)) (= (ite .cse2 v_~y$w_buff0~0_68 (ite .cse1 v_~y$w_buff1~0_67 v_~y~0_126)) v_~y~0_125)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_168, ~y$w_buff1~0=v_~y$w_buff1~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_60, ~y~0=v_~y~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_49, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_167, ~y$w_buff1~0=v_~y$w_buff1~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_59, ~y~0=v_~y~0_125, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_156} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:53:04,982 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [378] L864-->L870: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_52 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_60 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_197 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_187 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_198 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd0~0_60) v_~y$r_buff0_thd0~0_59) (= v_~y$w_buff1_used~0_186 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_187)) (= v_~y~0_157 (ite .cse2 v_~y$w_buff0~0_86 (ite .cse1 v_~y$w_buff1~0_89 v_~y~0_158))) (= (ite .cse2 0 v_~y$w_buff0_used~0_198) v_~y$w_buff0_used~0_197) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_186 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_59 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_52) v_~y$r_buff1_thd0~0_51)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_198, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_158, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_187} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_197, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_59, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_157, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_186} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:53:05,066 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [403] L794-->L797: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [395] L752-->L768: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd1~0_74 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_84 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and (= (mod v_~y$w_buff1_used~0_213 256) 0) .cse8)) (.cse4 (and .cse11 .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_226 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and (not .cse12) .cse9))) (let ((.cse0 (ite .cse5 v_~y~0_187 (ite .cse6 v_~y$w_buff0~0_109 v_~y$w_buff1~0_112))) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_225 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_212 256) 0))) (and (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_27) (= .cse0 v_~__unbuffered_p0_EAX~0_20) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_92) (= v_~y~0_187 v_~y$mem_tmp~0_50) (= v_~y$w_buff1_used~0_212 (ite .cse1 v_~y$w_buff1_used~0_213 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_213 0))) (= 0 v_~y$flush_delayed~0_65) (= v_~y$w_buff1~0_112 v_~y$w_buff1~0_111) (= (ite .cse1 v_~y$w_buff0_used~0_226 (ite .cse5 v_~y$w_buff0_used~0_226 (ite .cse6 0 v_~y$w_buff0_used~0_226))) v_~y$w_buff0_used~0_225) (= v_~y~0_185 (ite .cse1 v_~y$mem_tmp~0_50 .cse0)) (= v_~y$r_buff0_thd1~0_83 (ite .cse1 v_~y$r_buff0_thd1~0_84 (ite (or .cse3 .cse4 (and .cse7 .cse8)) v_~y$r_buff0_thd1~0_84 (ite (and (not .cse3) .cse9) 0 v_~y$r_buff0_thd1~0_84)))) (= (ite .cse1 v_~y$r_buff1_thd1~0_74 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd1~0_83 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse10 .cse7))) v_~y$r_buff1_thd1~0_74 0)) v_~y$r_buff1_thd1~0_73) (= v_~y$w_buff0~0_109 v_~y$w_buff0~0_108)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_226, ~y$w_buff1~0=v_~y$w_buff1~0_112, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_187, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_213} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_225, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, ~weak$$choice0~0=v_~weak$$choice0~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, ~y$flush_delayed~0=v_~y$flush_delayed~0_65, ~y~0=v_~y~0_185, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-13 00:53:05,191 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:53:05,192 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 946 [2022-12-13 00:53:05,192 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 213 flow [2022-12-13 00:53:05,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:53:05,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:05,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:05,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:53:05,193 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:05,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:05,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1464054053, now seen corresponding path program 2 times [2022-12-13 00:53:05,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:05,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545493257] [2022-12-13 00:53:05,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:05,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:05,686 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:53:05,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:05,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545493257] [2022-12-13 00:53:05,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545493257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:05,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:05,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:53:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215593057] [2022-12-13 00:53:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:05,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:53:05,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:05,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:53:05,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:53:05,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2022-12-13 00:53:05,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:53:05,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:05,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2022-12-13 00:53:05,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:06,129 INFO L130 PetriNetUnfolder]: 2997/4703 cut-off events. [2022-12-13 00:53:06,129 INFO L131 PetriNetUnfolder]: For 4649/4649 co-relation queries the response was YES. [2022-12-13 00:53:06,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13445 conditions, 4703 events. 2997/4703 cut-off events. For 4649/4649 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 25811 event pairs, 635 based on Foata normal form. 120/4124 useless extension candidates. Maximal degree in co-relation 13430. Up to 1826 conditions per place. [2022-12-13 00:53:06,151 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 46 selfloop transitions, 3 changer transitions 19/76 dead transitions. [2022-12-13 00:53:06,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 458 flow [2022-12-13 00:53:06,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:53:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:53:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-13 00:53:06,153 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2022-12-13 00:53:06,153 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 213 flow. Second operand 4 states and 95 transitions. [2022-12-13 00:53:06,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 458 flow [2022-12-13 00:53:06,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 438 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 00:53:06,157 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 146 flow [2022-12-13 00:53:06,158 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2022-12-13 00:53:06,158 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -20 predicate places. [2022-12-13 00:53:06,158 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:06,158 INFO L89 Accepts]: Start accepts. Operand has 52 places, 36 transitions, 146 flow [2022-12-13 00:53:06,159 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:06,159 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:06,159 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 36 transitions, 146 flow [2022-12-13 00:53:06,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 36 transitions, 146 flow [2022-12-13 00:53:06,177 INFO L130 PetriNetUnfolder]: 63/230 cut-off events. [2022-12-13 00:53:06,177 INFO L131 PetriNetUnfolder]: For 157/173 co-relation queries the response was YES. [2022-12-13 00:53:06,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 230 events. 63/230 cut-off events. For 157/173 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1319 event pairs, 53 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 516. Up to 101 conditions per place. [2022-12-13 00:53:06,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 36 transitions, 146 flow [2022-12-13 00:53:06,179 INFO L226 LiptonReduction]: Number of co-enabled transitions 566 [2022-12-13 00:53:06,188 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:06,189 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 00:53:06,189 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 146 flow [2022-12-13 00:53:06,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:53:06,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:06,189 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:06,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:53:06,189 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:06,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:06,190 INFO L85 PathProgramCache]: Analyzing trace with hash -33532036, now seen corresponding path program 1 times [2022-12-13 00:53:06,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:06,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914095344] [2022-12-13 00:53:06,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:06,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:06,811 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:53:06,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:06,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914095344] [2022-12-13 00:53:06,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914095344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:06,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:06,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125615303] [2022-12-13 00:53:06,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:06,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:06,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:06,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:06,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:06,813 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 00:53:06,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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:53:06,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:06,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 00:53:06,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:07,062 INFO L130 PetriNetUnfolder]: 1428/2294 cut-off events. [2022-12-13 00:53:07,063 INFO L131 PetriNetUnfolder]: For 2819/2819 co-relation queries the response was YES. [2022-12-13 00:53:07,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6887 conditions, 2294 events. 1428/2294 cut-off events. For 2819/2819 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11052 event pairs, 434 based on Foata normal form. 1/1928 useless extension candidates. Maximal degree in co-relation 6869. Up to 2013 conditions per place. [2022-12-13 00:53:07,074 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 48 selfloop transitions, 14 changer transitions 0/71 dead transitions. [2022-12-13 00:53:07,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 409 flow [2022-12-13 00:53:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:53:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:53:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-13 00:53:07,075 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2022-12-13 00:53:07,076 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 146 flow. Second operand 6 states and 113 transitions. [2022-12-13 00:53:07,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 409 flow [2022-12-13 00:53:07,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 379 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-13 00:53:07,081 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 236 flow [2022-12-13 00:53:07,081 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 00:53:07,083 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -18 predicate places. [2022-12-13 00:53:07,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:07,083 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 236 flow [2022-12-13 00:53:07,084 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:07,085 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:07,085 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 236 flow [2022-12-13 00:53:07,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 236 flow [2022-12-13 00:53:07,107 INFO L130 PetriNetUnfolder]: 80/287 cut-off events. [2022-12-13 00:53:07,108 INFO L131 PetriNetUnfolder]: For 247/318 co-relation queries the response was YES. [2022-12-13 00:53:07,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 287 events. 80/287 cut-off events. For 247/318 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1790 event pairs, 31 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 722. Up to 121 conditions per place. [2022-12-13 00:53:07,110 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 236 flow [2022-12-13 00:53:07,110 INFO L226 LiptonReduction]: Number of co-enabled transitions 684 [2022-12-13 00:53:07,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] L752-->L768: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd1~0_74 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_84 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and (= (mod v_~y$w_buff1_used~0_213 256) 0) .cse8)) (.cse4 (and .cse11 .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_226 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and (not .cse12) .cse9))) (let ((.cse0 (ite .cse5 v_~y~0_187 (ite .cse6 v_~y$w_buff0~0_109 v_~y$w_buff1~0_112))) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_225 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_212 256) 0))) (and (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_27) (= .cse0 v_~__unbuffered_p0_EAX~0_20) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_92) (= v_~y~0_187 v_~y$mem_tmp~0_50) (= v_~y$w_buff1_used~0_212 (ite .cse1 v_~y$w_buff1_used~0_213 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_213 0))) (= 0 v_~y$flush_delayed~0_65) (= v_~y$w_buff1~0_112 v_~y$w_buff1~0_111) (= (ite .cse1 v_~y$w_buff0_used~0_226 (ite .cse5 v_~y$w_buff0_used~0_226 (ite .cse6 0 v_~y$w_buff0_used~0_226))) v_~y$w_buff0_used~0_225) (= v_~y~0_185 (ite .cse1 v_~y$mem_tmp~0_50 .cse0)) (= v_~y$r_buff0_thd1~0_83 (ite .cse1 v_~y$r_buff0_thd1~0_84 (ite (or .cse3 .cse4 (and .cse7 .cse8)) v_~y$r_buff0_thd1~0_84 (ite (and (not .cse3) .cse9) 0 v_~y$r_buff0_thd1~0_84)))) (= (ite .cse1 v_~y$r_buff1_thd1~0_74 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd1~0_83 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse10 .cse7))) v_~y$r_buff1_thd1~0_74 0)) v_~y$r_buff1_thd1~0_73) (= v_~y$w_buff0~0_109 v_~y$w_buff0~0_108)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_226, ~y$w_buff1~0=v_~y$w_buff1~0_112, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_187, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_213} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_225, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, ~weak$$choice0~0=v_~weak$$choice0~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, ~y$flush_delayed~0=v_~y$flush_delayed~0_65, ~y~0=v_~y~0_185, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] and [378] L864-->L870: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_52 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_60 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_197 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_187 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_198 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd0~0_60) v_~y$r_buff0_thd0~0_59) (= v_~y$w_buff1_used~0_186 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_187)) (= v_~y~0_157 (ite .cse2 v_~y$w_buff0~0_86 (ite .cse1 v_~y$w_buff1~0_89 v_~y~0_158))) (= (ite .cse2 0 v_~y$w_buff0_used~0_198) v_~y$w_buff0_used~0_197) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_186 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_59 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_52) v_~y$r_buff1_thd0~0_51)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_198, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_158, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_187} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_197, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_59, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~y~0=v_~y~0_157, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_186} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:53:08,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] L752-->L768: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd1~0_74 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_84 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and (= (mod v_~y$w_buff1_used~0_213 256) 0) .cse8)) (.cse4 (and .cse11 .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_226 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and (not .cse12) .cse9))) (let ((.cse0 (ite .cse5 v_~y~0_187 (ite .cse6 v_~y$w_buff0~0_109 v_~y$w_buff1~0_112))) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_225 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_212 256) 0))) (and (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_27) (= .cse0 v_~__unbuffered_p0_EAX~0_20) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_92) (= v_~y~0_187 v_~y$mem_tmp~0_50) (= v_~y$w_buff1_used~0_212 (ite .cse1 v_~y$w_buff1_used~0_213 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_213 0))) (= 0 v_~y$flush_delayed~0_65) (= v_~y$w_buff1~0_112 v_~y$w_buff1~0_111) (= (ite .cse1 v_~y$w_buff0_used~0_226 (ite .cse5 v_~y$w_buff0_used~0_226 (ite .cse6 0 v_~y$w_buff0_used~0_226))) v_~y$w_buff0_used~0_225) (= v_~y~0_185 (ite .cse1 v_~y$mem_tmp~0_50 .cse0)) (= v_~y$r_buff0_thd1~0_83 (ite .cse1 v_~y$r_buff0_thd1~0_84 (ite (or .cse3 .cse4 (and .cse7 .cse8)) v_~y$r_buff0_thd1~0_84 (ite (and (not .cse3) .cse9) 0 v_~y$r_buff0_thd1~0_84)))) (= (ite .cse1 v_~y$r_buff1_thd1~0_74 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd1~0_83 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse10 .cse7))) v_~y$r_buff1_thd1~0_74 0)) v_~y$r_buff1_thd1~0_73) (= v_~y$w_buff0~0_109 v_~y$w_buff0~0_108)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_226, ~y$w_buff1~0=v_~y$w_buff1~0_112, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_187, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_213} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_225, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, ~weak$$choice0~0=v_~weak$$choice0~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, ~y$flush_delayed~0=v_~y$flush_delayed~0_65, ~y~0=v_~y~0_185, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] and [474] $Ultimate##0-->L794: Formula: (and (= v_~y$r_buff0_thd2~0_51 v_~y$r_buff1_thd2~0_39) (= v_~y$w_buff0_used~0_287 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~y$r_buff0_thd2~0_50 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_7| |v_P1Thread1of1ForFork2_~arg#1.offset_7|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_270 256) 0)) (not (= (mod v_~y$w_buff0_used~0_287 256) 0)))) 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~y$w_buff0_used~0_288 v_~y$w_buff1_used~0_270) (= v_~y$r_buff0_thd1~0_123 v_~y$r_buff1_thd1~0_113) (= |v_P1Thread1of1ForFork2_~arg#1.base_7| |v_P1Thread1of1ForFork2_#in~arg#1.base_7|) (= 2 v_~y$w_buff0~0_150) (= v_~y$r_buff0_thd0~0_75 v_~y$r_buff1_thd0~0_65) (= v_~y$w_buff1~0_143 v_~y$w_buff0~0_151) (= v_~y$r_buff0_thd3~0_95 v_~y$r_buff1_thd3~0_89)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_288, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_95, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_75, ~y$w_buff0~0=v_~y$w_buff0~0_151, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_51, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_123, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_287, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_7|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_113, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$w_buff1~0=v_~y$w_buff1~0_143, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_95, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_75, ~y$w_buff0~0=v_~y$w_buff0~0_150, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_123, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_270, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:53:08,232 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:53:08,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1150 [2022-12-13 00:53:08,233 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 239 flow [2022-12-13 00:53:08,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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:53:08,233 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:08,233 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:08,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:53:08,234 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:08,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2120885686, now seen corresponding path program 1 times [2022-12-13 00:53:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:08,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990754427] [2022-12-13 00:53:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:08,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:08,977 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:53:08,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:08,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990754427] [2022-12-13 00:53:08,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990754427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:08,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:08,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:53:08,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553260779] [2022-12-13 00:53:08,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:08,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:53:08,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:08,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:53:08,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:53:08,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2022-12-13 00:53:08,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:53:08,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:08,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2022-12-13 00:53:08,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:09,409 INFO L130 PetriNetUnfolder]: 1521/2469 cut-off events. [2022-12-13 00:53:09,409 INFO L131 PetriNetUnfolder]: For 4454/4454 co-relation queries the response was YES. [2022-12-13 00:53:09,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7991 conditions, 2469 events. 1521/2469 cut-off events. For 4454/4454 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12885 event pairs, 570 based on Foata normal form. 4/2097 useless extension candidates. Maximal degree in co-relation 7973. Up to 2074 conditions per place. [2022-12-13 00:53:09,425 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 51 selfloop transitions, 16 changer transitions 0/76 dead transitions. [2022-12-13 00:53:09,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 522 flow [2022-12-13 00:53:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:53:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:53:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-13 00:53:09,427 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-13 00:53:09,427 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 239 flow. Second operand 5 states and 105 transitions. [2022-12-13 00:53:09,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 522 flow [2022-12-13 00:53:09,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 504 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 00:53:09,432 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 365 flow [2022-12-13 00:53:09,433 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2022-12-13 00:53:09,433 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2022-12-13 00:53:09,433 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:09,433 INFO L89 Accepts]: Start accepts. Operand has 57 places, 55 transitions, 365 flow [2022-12-13 00:53:09,434 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:09,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:09,434 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 55 transitions, 365 flow [2022-12-13 00:53:09,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 55 transitions, 365 flow [2022-12-13 00:53:09,467 INFO L130 PetriNetUnfolder]: 103/299 cut-off events. [2022-12-13 00:53:09,467 INFO L131 PetriNetUnfolder]: For 445/603 co-relation queries the response was YES. [2022-12-13 00:53:09,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 299 events. 103/299 cut-off events. For 445/603 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1728 event pairs, 15 based on Foata normal form. 3/229 useless extension candidates. Maximal degree in co-relation 1002. Up to 154 conditions per place. [2022-12-13 00:53:09,470 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 55 transitions, 365 flow [2022-12-13 00:53:09,471 INFO L226 LiptonReduction]: Number of co-enabled transitions 762 [2022-12-13 00:53:10,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [467] $Ultimate##0-->L745: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_240 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_240, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] and [560] $Ultimate##0-->L797: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg#1.base_47| |v_P1Thread1of1ForFork2_~arg#1.base_47|) (= v_~y$r_buff0_thd0~0_341 v_~y$r_buff1_thd0~0_333) (= v_~y$r_buff0_thd2~0_184 1) (= v_~y$r_buff0_thd3~0_231 v_~y$r_buff1_thd3~0_223) (= 2 v_~y$w_buff0~0_522) (= v_~y$r_buff0_thd1~0_291 v_~y$r_buff1_thd1~0_290) (= v_~y$w_buff0_used~0_760 1) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_760 256) 0)) (not (= (mod v_~y$w_buff1_used~0_712 256) 0)))) 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49|) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49|) (= v_~x~0_69 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_47| |v_P1Thread1of1ForFork2_~arg#1.offset_47|) (= v_~y$r_buff0_thd2~0_185 v_~y$r_buff1_thd2~0_133) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49| 0)) (= v_~y$w_buff1~0_490 v_~y$w_buff0~0_523) (= v_~y$w_buff0_used~0_761 v_~y$w_buff1_used~0_712)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_761, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_231, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_341, ~y$w_buff0~0=v_~y$w_buff0~0_523, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_185, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_291, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_47|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_47|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_47|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_760, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_47|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_133, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_290, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_490, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_231, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_341, ~y$w_buff0~0=v_~y$w_buff0~0_522, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_184, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_291, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_47|, ~x~0=v_~x~0_69, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_333, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_712, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_47|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_~arg#1.offset, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 00:53:10,122 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:53:10,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 690 [2022-12-13 00:53:10,123 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 373 flow [2022-12-13 00:53:10,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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:53:10,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:10,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:10,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:53:10,124 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:10,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1864344348, now seen corresponding path program 1 times [2022-12-13 00:53:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:10,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851300070] [2022-12-13 00:53:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:10,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:10,851 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:53:10,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:10,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851300070] [2022-12-13 00:53:10,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851300070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:10,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:10,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:53:10,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053866934] [2022-12-13 00:53:10,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:10,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:53:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:10,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:53:10,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:53:10,853 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2022-12-13 00:53:10,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 373 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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:53:10,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:10,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2022-12-13 00:53:10,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:11,391 INFO L130 PetriNetUnfolder]: 2212/3532 cut-off events. [2022-12-13 00:53:11,392 INFO L131 PetriNetUnfolder]: For 8360/8372 co-relation queries the response was YES. [2022-12-13 00:53:11,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12346 conditions, 3532 events. 2212/3532 cut-off events. For 8360/8372 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 19427 event pairs, 490 based on Foata normal form. 68/3022 useless extension candidates. Maximal degree in co-relation 12326. Up to 2102 conditions per place. [2022-12-13 00:53:11,408 INFO L137 encePairwiseOnDemand]: 29/41 looper letters, 65 selfloop transitions, 11 changer transitions 27/112 dead transitions. [2022-12-13 00:53:11,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 112 transitions, 902 flow [2022-12-13 00:53:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:53:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:53:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2022-12-13 00:53:11,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5226480836236934 [2022-12-13 00:53:11,409 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 373 flow. Second operand 7 states and 150 transitions. [2022-12-13 00:53:11,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 112 transitions, 902 flow [2022-12-13 00:53:11,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 112 transitions, 822 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-13 00:53:11,414 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 402 flow [2022-12-13 00:53:11,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=402, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2022-12-13 00:53:11,415 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2022-12-13 00:53:11,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:11,415 INFO L89 Accepts]: Start accepts. Operand has 63 places, 59 transitions, 402 flow [2022-12-13 00:53:11,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:11,416 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:11,416 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 59 transitions, 402 flow [2022-12-13 00:53:11,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 59 transitions, 402 flow [2022-12-13 00:53:11,442 INFO L130 PetriNetUnfolder]: 106/298 cut-off events. [2022-12-13 00:53:11,442 INFO L131 PetriNetUnfolder]: For 754/908 co-relation queries the response was YES. [2022-12-13 00:53:11,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 298 events. 106/298 cut-off events. For 754/908 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1671 event pairs, 15 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 1100. Up to 160 conditions per place. [2022-12-13 00:53:11,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 59 transitions, 402 flow [2022-12-13 00:53:11,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 800 [2022-12-13 00:53:11,530 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:53:11,531 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 00:53:11,531 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 400 flow [2022-12-13 00:53:11,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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:53:11,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:11,531 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:11,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:53:11,531 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:11,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:11,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2123425361, now seen corresponding path program 1 times [2022-12-13 00:53:11,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:11,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075038540] [2022-12-13 00:53:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:11,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:11,637 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:53:11,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:11,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075038540] [2022-12-13 00:53:11,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075038540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:11,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:11,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:53:11,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813851734] [2022-12-13 00:53:11,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:11,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:53:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:11,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:53:11,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:53:11,638 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2022-12-13 00:53:11,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:11,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:11,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2022-12-13 00:53:11,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:11,957 INFO L130 PetriNetUnfolder]: 2059/3182 cut-off events. [2022-12-13 00:53:11,958 INFO L131 PetriNetUnfolder]: For 11024/11024 co-relation queries the response was YES. [2022-12-13 00:53:11,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12046 conditions, 3182 events. 2059/3182 cut-off events. For 11024/11024 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15542 event pairs, 516 based on Foata normal form. 58/2390 useless extension candidates. Maximal degree in co-relation 12023. Up to 2911 conditions per place. [2022-12-13 00:53:11,980 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 59 selfloop transitions, 10 changer transitions 0/74 dead transitions. [2022-12-13 00:53:11,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 582 flow [2022-12-13 00:53:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:53:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:53:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-13 00:53:11,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2022-12-13 00:53:11,982 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 400 flow. Second operand 3 states and 71 transitions. [2022-12-13 00:53:11,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 582 flow [2022-12-13 00:53:12,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 541 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-13 00:53:12,005 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 358 flow [2022-12-13 00:53:12,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2022-12-13 00:53:12,006 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2022-12-13 00:53:12,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:12,006 INFO L89 Accepts]: Start accepts. Operand has 58 places, 59 transitions, 358 flow [2022-12-13 00:53:12,007 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:12,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:12,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 59 transitions, 358 flow [2022-12-13 00:53:12,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 59 transitions, 358 flow [2022-12-13 00:53:12,107 INFO L130 PetriNetUnfolder]: 616/1200 cut-off events. [2022-12-13 00:53:12,107 INFO L131 PetriNetUnfolder]: For 830/1068 co-relation queries the response was YES. [2022-12-13 00:53:12,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3415 conditions, 1200 events. 616/1200 cut-off events. For 830/1068 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 8273 event pairs, 295 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 3396. Up to 793 conditions per place. [2022-12-13 00:53:12,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 59 transitions, 358 flow [2022-12-13 00:53:12,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 788 [2022-12-13 00:53:12,225 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:53:12,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 220 [2022-12-13 00:53:12,226 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 360 flow [2022-12-13 00:53:12,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:12,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:12,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:12,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:53:12,226 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:12,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1774960854, now seen corresponding path program 1 times [2022-12-13 00:53:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:12,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720986572] [2022-12-13 00:53:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:12,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:12,411 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:53:12,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:12,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720986572] [2022-12-13 00:53:12,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720986572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:12,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:12,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:53:12,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409803939] [2022-12-13 00:53:12,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:12,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:53:12,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:12,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:53:12,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:53:12,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 39 [2022-12-13 00:53:12,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 360 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:12,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:12,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 39 [2022-12-13 00:53:12,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:12,643 INFO L130 PetriNetUnfolder]: 1117/1934 cut-off events. [2022-12-13 00:53:12,643 INFO L131 PetriNetUnfolder]: For 3918/3918 co-relation queries the response was YES. [2022-12-13 00:53:12,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7798 conditions, 1934 events. 1117/1934 cut-off events. For 3918/3918 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10089 event pairs, 147 based on Foata normal form. 135/1567 useless extension candidates. Maximal degree in co-relation 7776. Up to 1171 conditions per place. [2022-12-13 00:53:12,652 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 68 selfloop transitions, 19 changer transitions 0/92 dead transitions. [2022-12-13 00:53:12,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 720 flow [2022-12-13 00:53:12,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:53:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:53:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-13 00:53:12,654 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2022-12-13 00:53:12,654 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 360 flow. Second operand 4 states and 96 transitions. [2022-12-13 00:53:12,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 720 flow [2022-12-13 00:53:12,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 706 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 00:53:12,662 INFO L231 Difference]: Finished difference. Result has 61 places, 67 transitions, 452 flow [2022-12-13 00:53:12,663 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=452, PETRI_PLACES=61, PETRI_TRANSITIONS=67} [2022-12-13 00:53:12,663 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2022-12-13 00:53:12,663 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:12,663 INFO L89 Accepts]: Start accepts. Operand has 61 places, 67 transitions, 452 flow [2022-12-13 00:53:12,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:12,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:12,666 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 67 transitions, 452 flow [2022-12-13 00:53:12,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 67 transitions, 452 flow [2022-12-13 00:53:12,764 INFO L130 PetriNetUnfolder]: 331/795 cut-off events. [2022-12-13 00:53:12,764 INFO L131 PetriNetUnfolder]: For 731/1422 co-relation queries the response was YES. [2022-12-13 00:53:12,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3010 conditions, 795 events. 331/795 cut-off events. For 731/1422 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 5488 event pairs, 82 based on Foata normal form. 3/502 useless extension candidates. Maximal degree in co-relation 2989. Up to 478 conditions per place. [2022-12-13 00:53:12,769 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 67 transitions, 452 flow [2022-12-13 00:53:12,769 INFO L226 LiptonReduction]: Number of co-enabled transitions 792 [2022-12-13 00:53:12,780 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:12,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 00:53:12,781 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 67 transitions, 452 flow [2022-12-13 00:53:12,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:12,782 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:12,782 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:53:12,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:53:12,782 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:12,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1642054016, now seen corresponding path program 1 times [2022-12-13 00:53:12,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:12,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626129108] [2022-12-13 00:53:12,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:12,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:12,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:53:12,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:12,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626129108] [2022-12-13 00:53:12,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626129108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:12,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:12,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:12,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293299772] [2022-12-13 00:53:12,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:12,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:53:12,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:12,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:53:12,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:53:12,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2022-12-13 00:53:12,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 67 transitions, 452 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:12,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:12,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2022-12-13 00:53:12,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:13,107 INFO L130 PetriNetUnfolder]: 694/1250 cut-off events. [2022-12-13 00:53:13,108 INFO L131 PetriNetUnfolder]: For 2627/2627 co-relation queries the response was YES. [2022-12-13 00:53:13,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5533 conditions, 1250 events. 694/1250 cut-off events. For 2627/2627 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6151 event pairs, 66 based on Foata normal form. 99/1009 useless extension candidates. Maximal degree in co-relation 5509. Up to 538 conditions per place. [2022-12-13 00:53:13,114 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 59 selfloop transitions, 28 changer transitions 0/92 dead transitions. [2022-12-13 00:53:13,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 92 transitions, 782 flow [2022-12-13 00:53:13,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:53:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:53:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-13 00:53:13,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-13 00:53:13,115 INFO L175 Difference]: Start difference. First operand has 61 places, 67 transitions, 452 flow. Second operand 5 states and 100 transitions. [2022-12-13 00:53:13,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 92 transitions, 782 flow [2022-12-13 00:53:13,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 679 flow, removed 35 selfloop flow, removed 5 redundant places. [2022-12-13 00:53:13,120 INFO L231 Difference]: Finished difference. Result has 61 places, 67 transitions, 451 flow [2022-12-13 00:53:13,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=451, PETRI_PLACES=61, PETRI_TRANSITIONS=67} [2022-12-13 00:53:13,121 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2022-12-13 00:53:13,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:13,121 INFO L89 Accepts]: Start accepts. Operand has 61 places, 67 transitions, 451 flow [2022-12-13 00:53:13,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:13,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:13,122 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 67 transitions, 451 flow [2022-12-13 00:53:13,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 67 transitions, 451 flow [2022-12-13 00:53:13,146 INFO L130 PetriNetUnfolder]: 151/426 cut-off events. [2022-12-13 00:53:13,147 INFO L131 PetriNetUnfolder]: For 263/473 co-relation queries the response was YES. [2022-12-13 00:53:13,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 426 events. 151/426 cut-off events. For 263/473 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 2527 event pairs, 1 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 1403. Up to 253 conditions per place. [2022-12-13 00:53:13,150 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 67 transitions, 451 flow [2022-12-13 00:53:13,150 INFO L226 LiptonReduction]: Number of co-enabled transitions 724 [2022-12-13 00:53:15,121 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:53:15,122 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2001 [2022-12-13 00:53:15,122 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 64 transitions, 445 flow [2022-12-13 00:53:15,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:15,122 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:15,122 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:53:15,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:53:15,123 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:15,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:15,125 INFO L85 PathProgramCache]: Analyzing trace with hash 850489233, now seen corresponding path program 1 times [2022-12-13 00:53:15,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:15,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967068622] [2022-12-13 00:53:15,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:15,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:15,431 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:53:15,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:15,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967068622] [2022-12-13 00:53:15,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967068622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:15,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:15,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:15,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959844665] [2022-12-13 00:53:15,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:15,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:53:15,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:15,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:53:15,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:53:15,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 00:53:15,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 64 transitions, 445 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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:53:15,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:15,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 00:53:15,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:15,681 INFO L130 PetriNetUnfolder]: 821/1491 cut-off events. [2022-12-13 00:53:15,682 INFO L131 PetriNetUnfolder]: For 2815/2976 co-relation queries the response was YES. [2022-12-13 00:53:15,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6140 conditions, 1491 events. 821/1491 cut-off events. For 2815/2976 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8376 event pairs, 148 based on Foata normal form. 109/1301 useless extension candidates. Maximal degree in co-relation 6118. Up to 700 conditions per place. [2022-12-13 00:53:15,688 INFO L137 encePairwiseOnDemand]: 21/35 looper letters, 43 selfloop transitions, 16 changer transitions 46/119 dead transitions. [2022-12-13 00:53:15,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 119 transitions, 1032 flow [2022-12-13 00:53:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:53:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:53:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2022-12-13 00:53:15,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2022-12-13 00:53:15,690 INFO L175 Difference]: Start difference. First operand has 58 places, 64 transitions, 445 flow. Second operand 6 states and 116 transitions. [2022-12-13 00:53:15,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 119 transitions, 1032 flow [2022-12-13 00:53:15,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 119 transitions, 882 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 00:53:15,704 INFO L231 Difference]: Finished difference. Result has 63 places, 66 transitions, 438 flow [2022-12-13 00:53:15,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=63, PETRI_TRANSITIONS=66} [2022-12-13 00:53:15,706 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2022-12-13 00:53:15,706 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:15,706 INFO L89 Accepts]: Start accepts. Operand has 63 places, 66 transitions, 438 flow [2022-12-13 00:53:15,708 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:15,708 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:15,708 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 66 transitions, 438 flow [2022-12-13 00:53:15,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 66 transitions, 438 flow [2022-12-13 00:53:15,733 INFO L130 PetriNetUnfolder]: 154/381 cut-off events. [2022-12-13 00:53:15,733 INFO L131 PetriNetUnfolder]: For 440/481 co-relation queries the response was YES. [2022-12-13 00:53:15,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 381 events. 154/381 cut-off events. For 440/481 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 2081 event pairs, 4 based on Foata normal form. 1/175 useless extension candidates. Maximal degree in co-relation 1175. Up to 172 conditions per place. [2022-12-13 00:53:15,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 66 transitions, 438 flow [2022-12-13 00:53:15,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 652 [2022-12-13 00:53:15,737 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:15,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 00:53:15,737 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 438 flow [2022-12-13 00:53:15,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 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:53:15,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:15,737 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:53:15,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:53:15,738 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1730801332, now seen corresponding path program 1 times [2022-12-13 00:53:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:15,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023981176] [2022-12-13 00:53:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:15,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:16,223 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:53:16,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:16,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023981176] [2022-12-13 00:53:16,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023981176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:16,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:16,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:53:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364244271] [2022-12-13 00:53:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:16,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:53:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:16,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:53:16,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:53:16,225 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 00:53:16,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 438 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:53:16,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:16,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 00:53:16,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:16,575 INFO L130 PetriNetUnfolder]: 921/1667 cut-off events. [2022-12-13 00:53:16,575 INFO L131 PetriNetUnfolder]: For 3574/3687 co-relation queries the response was YES. [2022-12-13 00:53:16,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6514 conditions, 1667 events. 921/1667 cut-off events. For 3574/3687 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9791 event pairs, 34 based on Foata normal form. 131/1437 useless extension candidates. Maximal degree in co-relation 6490. Up to 653 conditions per place. [2022-12-13 00:53:16,583 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 73 selfloop transitions, 25 changer transitions 49/161 dead transitions. [2022-12-13 00:53:16,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 161 transitions, 1283 flow [2022-12-13 00:53:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 00:53:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 00:53:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2022-12-13 00:53:16,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5359477124183006 [2022-12-13 00:53:16,585 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 438 flow. Second operand 9 states and 164 transitions. [2022-12-13 00:53:16,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 161 transitions, 1283 flow [2022-12-13 00:53:16,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 161 transitions, 1253 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 00:53:16,600 INFO L231 Difference]: Finished difference. Result has 71 places, 77 transitions, 592 flow [2022-12-13 00:53:16,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=592, PETRI_PLACES=71, PETRI_TRANSITIONS=77} [2022-12-13 00:53:16,601 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2022-12-13 00:53:16,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:16,601 INFO L89 Accepts]: Start accepts. Operand has 71 places, 77 transitions, 592 flow [2022-12-13 00:53:16,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:16,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:16,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 77 transitions, 592 flow [2022-12-13 00:53:16,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 77 transitions, 592 flow [2022-12-13 00:53:16,630 INFO L130 PetriNetUnfolder]: 175/439 cut-off events. [2022-12-13 00:53:16,630 INFO L131 PetriNetUnfolder]: For 710/750 co-relation queries the response was YES. [2022-12-13 00:53:16,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 439 events. 175/439 cut-off events. For 710/750 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 2554 event pairs, 3 based on Foata normal form. 1/200 useless extension candidates. Maximal degree in co-relation 1455. Up to 208 conditions per place. [2022-12-13 00:53:16,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 77 transitions, 592 flow [2022-12-13 00:53:16,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 832 [2022-12-13 00:53:16,634 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:16,635 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 00:53:16,635 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 77 transitions, 592 flow [2022-12-13 00:53:16,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:53:16,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:16,635 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:53:16,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:53:16,636 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash 816915244, now seen corresponding path program 2 times [2022-12-13 00:53:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:16,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090779659] [2022-12-13 00:53:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:17,304 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:53:17,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:17,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090779659] [2022-12-13 00:53:17,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090779659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:17,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:17,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:17,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081821857] [2022-12-13 00:53:17,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:17,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:17,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:17,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:17,307 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 00:53:17,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 77 transitions, 592 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:53:17,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:17,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 00:53:17,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:17,706 INFO L130 PetriNetUnfolder]: 785/1418 cut-off events. [2022-12-13 00:53:17,706 INFO L131 PetriNetUnfolder]: For 4266/4359 co-relation queries the response was YES. [2022-12-13 00:53:17,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6228 conditions, 1418 events. 785/1418 cut-off events. For 4266/4359 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 7932 event pairs, 54 based on Foata normal form. 94/1226 useless extension candidates. Maximal degree in co-relation 6199. Up to 932 conditions per place. [2022-12-13 00:53:17,711 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 61 selfloop transitions, 16 changer transitions 22/112 dead transitions. [2022-12-13 00:53:17,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 112 transitions, 997 flow [2022-12-13 00:53:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:53:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:53:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-12-13 00:53:17,713 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47549019607843135 [2022-12-13 00:53:17,713 INFO L175 Difference]: Start difference. First operand has 69 places, 77 transitions, 592 flow. Second operand 6 states and 97 transitions. [2022-12-13 00:53:17,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 112 transitions, 997 flow [2022-12-13 00:53:17,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 112 transitions, 941 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-13 00:53:17,735 INFO L231 Difference]: Finished difference. Result has 71 places, 73 transitions, 585 flow [2022-12-13 00:53:17,735 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=585, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2022-12-13 00:53:17,735 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2022-12-13 00:53:17,735 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:17,735 INFO L89 Accepts]: Start accepts. Operand has 71 places, 73 transitions, 585 flow [2022-12-13 00:53:17,736 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:17,736 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:17,736 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 73 transitions, 585 flow [2022-12-13 00:53:17,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 73 transitions, 585 flow [2022-12-13 00:53:17,800 INFO L130 PetriNetUnfolder]: 315/694 cut-off events. [2022-12-13 00:53:17,800 INFO L131 PetriNetUnfolder]: For 831/920 co-relation queries the response was YES. [2022-12-13 00:53:17,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 694 events. 315/694 cut-off events. For 831/920 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 4397 event pairs, 6 based on Foata normal form. 12/287 useless extension candidates. Maximal degree in co-relation 2171. Up to 352 conditions per place. [2022-12-13 00:53:17,805 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 73 transitions, 585 flow [2022-12-13 00:53:17,805 INFO L226 LiptonReduction]: Number of co-enabled transitions 820 [2022-12-13 00:53:18,056 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [404] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_221 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_209 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_222 256) 0)) .cse5))) (and (= v_~y~0_181 (ite .cse0 v_~y$w_buff0~0_106 (ite .cse1 v_~y$w_buff1~0_109 v_~y~0_182))) (= (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_209) v_~y$w_buff1_used~0_208) (= v_~y$r_buff0_thd2~0_28 (ite .cse2 0 v_~y$r_buff0_thd2~0_29)) (= v_~y$w_buff0_used~0_221 (ite .cse0 0 v_~y$w_buff0_used~0_222)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_208 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_222, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_182, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_209} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_221, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_181, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [395] L752-->L768: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd1~0_74 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_84 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and (= (mod v_~y$w_buff1_used~0_213 256) 0) .cse8)) (.cse4 (and .cse11 .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_226 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and (not .cse12) .cse9))) (let ((.cse0 (ite .cse5 v_~y~0_187 (ite .cse6 v_~y$w_buff0~0_109 v_~y$w_buff1~0_112))) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_225 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_212 256) 0))) (and (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_27) (= .cse0 v_~__unbuffered_p0_EAX~0_20) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_92) (= v_~y~0_187 v_~y$mem_tmp~0_50) (= v_~y$w_buff1_used~0_212 (ite .cse1 v_~y$w_buff1_used~0_213 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_213 0))) (= 0 v_~y$flush_delayed~0_65) (= v_~y$w_buff1~0_112 v_~y$w_buff1~0_111) (= (ite .cse1 v_~y$w_buff0_used~0_226 (ite .cse5 v_~y$w_buff0_used~0_226 (ite .cse6 0 v_~y$w_buff0_used~0_226))) v_~y$w_buff0_used~0_225) (= v_~y~0_185 (ite .cse1 v_~y$mem_tmp~0_50 .cse0)) (= v_~y$r_buff0_thd1~0_83 (ite .cse1 v_~y$r_buff0_thd1~0_84 (ite (or .cse3 .cse4 (and .cse7 .cse8)) v_~y$r_buff0_thd1~0_84 (ite (and (not .cse3) .cse9) 0 v_~y$r_buff0_thd1~0_84)))) (= (ite .cse1 v_~y$r_buff1_thd1~0_74 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd1~0_83 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse10 .cse7))) v_~y$r_buff1_thd1~0_74 0)) v_~y$r_buff1_thd1~0_73) (= v_~y$w_buff0~0_109 v_~y$w_buff0~0_108)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_226, ~y$w_buff1~0=v_~y$w_buff1~0_112, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_187, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_213} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_225, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, ~weak$$choice0~0=v_~weak$$choice0~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, ~y$flush_delayed~0=v_~y$flush_delayed~0_65, ~y~0=v_~y~0_185, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-13 00:53:18,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [404] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_221 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_209 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_222 256) 0)) .cse5))) (and (= v_~y~0_181 (ite .cse0 v_~y$w_buff0~0_106 (ite .cse1 v_~y$w_buff1~0_109 v_~y~0_182))) (= (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_209) v_~y$w_buff1_used~0_208) (= v_~y$r_buff0_thd2~0_28 (ite .cse2 0 v_~y$r_buff0_thd2~0_29)) (= v_~y$w_buff0_used~0_221 (ite .cse0 0 v_~y$w_buff0_used~0_222)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_208 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_222, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_182, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_209} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_221, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_181, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [395] L752-->L768: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd1~0_74 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_84 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and (= (mod v_~y$w_buff1_used~0_213 256) 0) .cse8)) (.cse4 (and .cse11 .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_226 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and (not .cse12) .cse9))) (let ((.cse0 (ite .cse5 v_~y~0_187 (ite .cse6 v_~y$w_buff0~0_109 v_~y$w_buff1~0_112))) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_225 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_212 256) 0))) (and (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_27) (= .cse0 v_~__unbuffered_p0_EAX~0_20) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_92) (= v_~y~0_187 v_~y$mem_tmp~0_50) (= v_~y$w_buff1_used~0_212 (ite .cse1 v_~y$w_buff1_used~0_213 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_213 0))) (= 0 v_~y$flush_delayed~0_65) (= v_~y$w_buff1~0_112 v_~y$w_buff1~0_111) (= (ite .cse1 v_~y$w_buff0_used~0_226 (ite .cse5 v_~y$w_buff0_used~0_226 (ite .cse6 0 v_~y$w_buff0_used~0_226))) v_~y$w_buff0_used~0_225) (= v_~y~0_185 (ite .cse1 v_~y$mem_tmp~0_50 .cse0)) (= v_~y$r_buff0_thd1~0_83 (ite .cse1 v_~y$r_buff0_thd1~0_84 (ite (or .cse3 .cse4 (and .cse7 .cse8)) v_~y$r_buff0_thd1~0_84 (ite (and (not .cse3) .cse9) 0 v_~y$r_buff0_thd1~0_84)))) (= (ite .cse1 v_~y$r_buff1_thd1~0_74 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd1~0_83 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse10 .cse7))) v_~y$r_buff1_thd1~0_74 0)) v_~y$r_buff1_thd1~0_73) (= v_~y$w_buff0~0_109 v_~y$w_buff0~0_108)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_226, ~y$w_buff1~0=v_~y$w_buff1~0_112, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_187, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_213} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_225, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, ~weak$$choice0~0=v_~weak$$choice0~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, ~y$flush_delayed~0=v_~y$flush_delayed~0_65, ~y~0=v_~y~0_185, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-13 00:53:18,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [404] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_221 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_209 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_222 256) 0)) .cse5))) (and (= v_~y~0_181 (ite .cse0 v_~y$w_buff0~0_106 (ite .cse1 v_~y$w_buff1~0_109 v_~y~0_182))) (= (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_209) v_~y$w_buff1_used~0_208) (= v_~y$r_buff0_thd2~0_28 (ite .cse2 0 v_~y$r_buff0_thd2~0_29)) (= v_~y$w_buff0_used~0_221 (ite .cse0 0 v_~y$w_buff0_used~0_222)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_208 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_222, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_182, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_209} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_221, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_181, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [395] L752-->L768: Formula: (let ((.cse11 (= (mod v_~y$r_buff1_thd1~0_74 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd1~0_84 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and (= (mod v_~y$w_buff1_used~0_213 256) 0) .cse8)) (.cse4 (and .cse11 .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_226 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and (not .cse12) .cse9))) (let ((.cse0 (ite .cse5 v_~y~0_187 (ite .cse6 v_~y$w_buff0~0_109 v_~y$w_buff1~0_112))) (.cse1 (not (= (mod v_~weak$$choice2~0_92 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_225 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_212 256) 0))) (and (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_27) (= .cse0 v_~__unbuffered_p0_EAX~0_20) (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_92) (= v_~y~0_187 v_~y$mem_tmp~0_50) (= v_~y$w_buff1_used~0_212 (ite .cse1 v_~y$w_buff1_used~0_213 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_213 0))) (= 0 v_~y$flush_delayed~0_65) (= v_~y$w_buff1~0_112 v_~y$w_buff1~0_111) (= (ite .cse1 v_~y$w_buff0_used~0_226 (ite .cse5 v_~y$w_buff0_used~0_226 (ite .cse6 0 v_~y$w_buff0_used~0_226))) v_~y$w_buff0_used~0_225) (= v_~y~0_185 (ite .cse1 v_~y$mem_tmp~0_50 .cse0)) (= v_~y$r_buff0_thd1~0_83 (ite .cse1 v_~y$r_buff0_thd1~0_84 (ite (or .cse3 .cse4 (and .cse7 .cse8)) v_~y$r_buff0_thd1~0_84 (ite (and (not .cse3) .cse9) 0 v_~y$r_buff0_thd1~0_84)))) (= (ite .cse1 v_~y$r_buff1_thd1~0_74 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd1~0_83 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse10 .cse7))) v_~y$r_buff1_thd1~0_74 0)) v_~y$r_buff1_thd1~0_73) (= v_~y$w_buff0~0_109 v_~y$w_buff0~0_108)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_226, ~y$w_buff1~0=v_~y$w_buff1~0_112, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_187, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_213} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_225, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_73, ~weak$$choice0~0=v_~weak$$choice0~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ~y$w_buff1~0=v_~y$w_buff1~0_111, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, ~y$flush_delayed~0=v_~y$flush_delayed~0_65, ~y~0=v_~y~0_185, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-13 00:53:19,084 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [562] $Ultimate##0-->L797: Formula: (and (= v_~x~0_73 1) (= v_~y$r_buff0_thd2~0_197 v_~y$r_buff1_thd2~0_141) (= v_~y$r_buff0_thd1~0_295 v_~y$r_buff1_thd1~0_296) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_51| |v_P1Thread1of1ForFork2_~arg#1.offset_51|) (= v_~y$w_buff1~0_500 v_~y$w_buff0~0_537) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_51| |v_P1Thread1of1ForFork2_~arg#1.base_51|) (= v_~y$r_buff0_thd2~0_196 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_53|) (= v_~y$r_buff0_thd3~0_239 v_~y$r_buff1_thd3~0_231) (= v_~y$w_buff0_used~0_781 1) (= v_~y$w_buff0_used~0_782 v_~y$w_buff1_used~0_728) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_53| 0)) (= 2 v_~y$w_buff0~0_536) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_781 256) 0)) (not (= (mod v_~y$w_buff1_used~0_728 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_352 v_~y$r_buff1_thd0~0_344)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_782, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_239, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_352, ~y$w_buff0~0=v_~y$w_buff0~0_537, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_197, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_51|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_51|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_51|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_781, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_51|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_53|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_141, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_296, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_231, ~y$w_buff1~0=v_~y$w_buff1~0_500, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_239, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_352, ~y$w_buff0~0=v_~y$w_buff0~0_536, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_196, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_51|, ~x~0=v_~x~0_73, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_728, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_51|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_~arg#1.offset, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [467] $Ultimate##0-->L745: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_240 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_240, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 00:53:19,209 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [562] $Ultimate##0-->L797: Formula: (and (= v_~x~0_73 1) (= v_~y$r_buff0_thd2~0_197 v_~y$r_buff1_thd2~0_141) (= v_~y$r_buff0_thd1~0_295 v_~y$r_buff1_thd1~0_296) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_51| |v_P1Thread1of1ForFork2_~arg#1.offset_51|) (= v_~y$w_buff1~0_500 v_~y$w_buff0~0_537) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_51| |v_P1Thread1of1ForFork2_~arg#1.base_51|) (= v_~y$r_buff0_thd2~0_196 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_53|) (= v_~y$r_buff0_thd3~0_239 v_~y$r_buff1_thd3~0_231) (= v_~y$w_buff0_used~0_781 1) (= v_~y$w_buff0_used~0_782 v_~y$w_buff1_used~0_728) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_53| 0)) (= 2 v_~y$w_buff0~0_536) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_781 256) 0)) (not (= (mod v_~y$w_buff1_used~0_728 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_352 v_~y$r_buff1_thd0~0_344)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_782, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_239, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_352, ~y$w_buff0~0=v_~y$w_buff0~0_537, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_197, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_51|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_51|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_51|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_781, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_51|, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_53|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_141, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_296, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_231, ~y$w_buff1~0=v_~y$w_buff1~0_500, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_53|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_239, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_352, ~y$w_buff0~0=v_~y$w_buff0~0_536, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_196, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_51|, ~x~0=v_~x~0_73, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_728, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_51|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_~arg#1.offset, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [552] $Ultimate##0-->L830: Formula: (let ((.cse9 (= 0 (mod v_~y$r_buff1_thd3~0_204 256))) (.cse2 (= (mod v_~y$r_buff0_thd3~0_212 256) 0))) (let ((.cse5 (not .cse2)) (.cse12 (= (mod v_~y$w_buff0_used~0_717 256) 0)) (.cse6 (and .cse2 (= (mod v_~y$w_buff1_used~0_673 256) 0))) (.cse4 (and .cse9 .cse2))) (let ((.cse10 (or .cse12 .cse6 .cse4)) (.cse11 (and .cse5 (not .cse12)))) (let ((.cse1 (= 0 (mod v_~y$w_buff0_used~0_716 256))) (.cse3 (= 0 (mod v_~y$w_buff1_used~0_672 256))) (.cse7 (ite .cse10 v_~y~0_653 (ite .cse11 v_~y$w_buff0~0_487 v_~y$w_buff1~0_459))) (.cse0 (not (= (mod v_~weak$$choice2~0_230 256) 0)))) (and (= (ite .cse0 v_~y$r_buff0_thd3~0_212 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~y$r_buff0_thd3~0_212 (ite (and .cse5 (not .cse1)) 0 v_~y$r_buff0_thd3~0_212))) v_~y$r_buff0_thd3~0_211) (= v_~y$w_buff1_used~0_672 (ite .cse0 v_~y$w_buff1_used~0_673 (ite (or .cse1 .cse6 .cse4) v_~y$w_buff1_used~0_673 0))) (= v_~y~0_653 v_~y$mem_tmp~0_200) (= |v_P2Thread1of1ForFork0_#in~arg.base_23| v_P2Thread1of1ForFork0_~arg.base_23) (= v_~y$w_buff0~0_487 v_~y$w_buff0~0_486) (= v_~y$flush_delayed~0_219 0) (= v_~y$w_buff1~0_459 v_~y$w_buff1~0_458) (= v_~y~0_652 (ite .cse0 v_~y$mem_tmp~0_200 .cse7)) (= v_~weak$$choice0~0_169 |v_P2Thread1of1ForFork0_#t~nondet5_42|) (= (ite .cse0 v_~y$r_buff1_thd3~0_204 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd3~0_211 256) 0))) (or .cse1 (and .cse8 .cse3) (and .cse9 .cse8))) v_~y$r_buff1_thd3~0_204 0)) v_~y$r_buff1_thd3~0_203) (= v_~__unbuffered_p2_EBX~0_146 .cse7) (= v_~x~0_59 v_~__unbuffered_p2_EAX~0_136) (= v_~y$w_buff0_used~0_716 (ite .cse0 v_~y$w_buff0_used~0_717 (ite .cse10 v_~y$w_buff0_used~0_717 (ite .cse11 0 v_~y$w_buff0_used~0_717)))) (= v_~weak$$choice2~0_230 |v_P2Thread1of1ForFork0_#t~nondet6_42|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_23| v_P2Thread1of1ForFork0_~arg.offset_23)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_204, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_717, ~y$w_buff1~0=v_~y$w_buff1~0_459, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_212, ~y$w_buff0~0=v_~y$w_buff0~0_487, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_42|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_42|, ~y~0=v_~y~0_653, ~x~0=v_~x~0_59, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_673} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_146, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_23|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_716, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_23, ~weak$$choice0~0=v_~weak$$choice0~0_169, ~y$mem_tmp~0=v_~y$mem_tmp~0_200, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_23, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_203, ~y$w_buff1~0=v_~y$w_buff1~0_458, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ~y$w_buff0~0=v_~y$w_buff0~0_486, ~y$flush_delayed~0=v_~y$flush_delayed~0_219, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_136, ~y~0=v_~y~0_652, ~weak$$choice2~0=v_~weak$$choice2~0_230, ~x~0=v_~x~0_59, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_672} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 00:53:19,533 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:53:19,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1798 [2022-12-13 00:53:19,534 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 71 transitions, 605 flow [2022-12-13 00:53:19,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:53:19,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:19,534 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:53:19,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 00:53:19,534 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:19,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:19,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1266260738, now seen corresponding path program 1 times [2022-12-13 00:53:19,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:19,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568190718] [2022-12-13 00:53:19,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:19,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:19,942 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:53:19,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:19,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568190718] [2022-12-13 00:53:19,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568190718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:19,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:19,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:19,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688656506] [2022-12-13 00:53:19,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:19,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:19,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:19,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:19,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:19,944 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2022-12-13 00:53:19,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 71 transitions, 605 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:19,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:19,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2022-12-13 00:53:19,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:20,301 INFO L130 PetriNetUnfolder]: 997/1793 cut-off events. [2022-12-13 00:53:20,301 INFO L131 PetriNetUnfolder]: For 5607/5716 co-relation queries the response was YES. [2022-12-13 00:53:20,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7611 conditions, 1793 events. 997/1793 cut-off events. For 5607/5716 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 10761 event pairs, 217 based on Foata normal form. 106/1474 useless extension candidates. Maximal degree in co-relation 7583. Up to 1008 conditions per place. [2022-12-13 00:53:20,310 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 59 selfloop transitions, 5 changer transitions 33/110 dead transitions. [2022-12-13 00:53:20,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 110 transitions, 1049 flow [2022-12-13 00:53:20,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:53:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:53:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-13 00:53:20,312 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 00:53:20,312 INFO L175 Difference]: Start difference. First operand has 66 places, 71 transitions, 605 flow. Second operand 6 states and 96 transitions. [2022-12-13 00:53:20,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 110 transitions, 1049 flow [2022-12-13 00:53:20,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 110 transitions, 918 flow, removed 44 selfloop flow, removed 8 redundant places. [2022-12-13 00:53:20,328 INFO L231 Difference]: Finished difference. Result has 66 places, 72 transitions, 522 flow [2022-12-13 00:53:20,328 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=66, PETRI_TRANSITIONS=72} [2022-12-13 00:53:20,329 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2022-12-13 00:53:20,329 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:20,329 INFO L89 Accepts]: Start accepts. Operand has 66 places, 72 transitions, 522 flow [2022-12-13 00:53:20,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:20,329 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:20,329 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 72 transitions, 522 flow [2022-12-13 00:53:20,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 72 transitions, 522 flow [2022-12-13 00:53:20,367 INFO L130 PetriNetUnfolder]: 281/634 cut-off events. [2022-12-13 00:53:20,367 INFO L131 PetriNetUnfolder]: For 795/906 co-relation queries the response was YES. [2022-12-13 00:53:20,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 634 events. 281/634 cut-off events. For 795/906 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 4101 event pairs, 6 based on Foata normal form. 12/268 useless extension candidates. Maximal degree in co-relation 1977. Up to 298 conditions per place. [2022-12-13 00:53:20,372 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 72 transitions, 522 flow [2022-12-13 00:53:20,372 INFO L226 LiptonReduction]: Number of co-enabled transitions 780 [2022-12-13 00:53:20,372 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:20,373 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 00:53:20,373 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 72 transitions, 522 flow [2022-12-13 00:53:20,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:20,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:20,373 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:53:20,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 00:53:20,373 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:20,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:20,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2061705087, now seen corresponding path program 1 times [2022-12-13 00:53:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:20,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475396874] [2022-12-13 00:53:20,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:20,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:20,796 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:53:20,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:20,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475396874] [2022-12-13 00:53:20,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475396874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:20,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:20,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:20,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627360056] [2022-12-13 00:53:20,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:20,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:20,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:20,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:20,799 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2022-12-13 00:53:20,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 72 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:20,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:20,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2022-12-13 00:53:20,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:21,105 INFO L130 PetriNetUnfolder]: 907/1631 cut-off events. [2022-12-13 00:53:21,105 INFO L131 PetriNetUnfolder]: For 5009/5096 co-relation queries the response was YES. [2022-12-13 00:53:21,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6906 conditions, 1631 events. 907/1631 cut-off events. For 5009/5096 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 9736 event pairs, 91 based on Foata normal form. 92/1356 useless extension candidates. Maximal degree in co-relation 6880. Up to 622 conditions per place. [2022-12-13 00:53:21,113 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 70 selfloop transitions, 28 changer transitions 17/128 dead transitions. [2022-12-13 00:53:21,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 128 transitions, 1108 flow [2022-12-13 00:53:21,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:53:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:53:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-12-13 00:53:21,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2022-12-13 00:53:21,115 INFO L175 Difference]: Start difference. First operand has 64 places, 72 transitions, 522 flow. Second operand 7 states and 116 transitions. [2022-12-13 00:53:21,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 128 transitions, 1108 flow [2022-12-13 00:53:21,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 128 transitions, 1074 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 00:53:21,133 INFO L231 Difference]: Finished difference. Result has 68 places, 75 transitions, 639 flow [2022-12-13 00:53:21,133 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=639, PETRI_PLACES=68, PETRI_TRANSITIONS=75} [2022-12-13 00:53:21,134 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2022-12-13 00:53:21,134 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:21,134 INFO L89 Accepts]: Start accepts. Operand has 68 places, 75 transitions, 639 flow [2022-12-13 00:53:21,135 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:21,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:21,135 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 75 transitions, 639 flow [2022-12-13 00:53:21,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 75 transitions, 639 flow [2022-12-13 00:53:21,179 INFO L130 PetriNetUnfolder]: 311/692 cut-off events. [2022-12-13 00:53:21,179 INFO L131 PetriNetUnfolder]: For 1131/1241 co-relation queries the response was YES. [2022-12-13 00:53:21,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 692 events. 311/692 cut-off events. For 1131/1241 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 4427 event pairs, 6 based on Foata normal form. 4/277 useless extension candidates. Maximal degree in co-relation 2244. Up to 352 conditions per place. [2022-12-13 00:53:21,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 75 transitions, 639 flow [2022-12-13 00:53:21,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 840 [2022-12-13 00:53:21,221 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:21,222 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-13 00:53:21,222 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 75 transitions, 639 flow [2022-12-13 00:53:21,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:21,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:21,222 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:53:21,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 00:53:21,222 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:21,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:21,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1874121356, now seen corresponding path program 2 times [2022-12-13 00:53:21,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:21,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882178021] [2022-12-13 00:53:21,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:21,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:21,738 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:53:21,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:21,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882178021] [2022-12-13 00:53:21,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882178021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:21,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:21,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378055617] [2022-12-13 00:53:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:21,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:21,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:21,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:21,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:21,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2022-12-13 00:53:21,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 75 transitions, 639 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:21,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:21,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2022-12-13 00:53:21,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:22,079 INFO L130 PetriNetUnfolder]: 893/1618 cut-off events. [2022-12-13 00:53:22,079 INFO L131 PetriNetUnfolder]: For 6808/6897 co-relation queries the response was YES. [2022-12-13 00:53:22,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7369 conditions, 1618 events. 893/1618 cut-off events. For 6808/6897 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 9640 event pairs, 130 based on Foata normal form. 91/1342 useless extension candidates. Maximal degree in co-relation 7343. Up to 888 conditions per place. [2022-12-13 00:53:22,087 INFO L137 encePairwiseOnDemand]: 18/35 looper letters, 63 selfloop transitions, 19 changer transitions 30/125 dead transitions. [2022-12-13 00:53:22,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 125 transitions, 1260 flow [2022-12-13 00:53:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:53:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:53:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2022-12-13 00:53:22,088 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-13 00:53:22,089 INFO L175 Difference]: Start difference. First operand has 68 places, 75 transitions, 639 flow. Second operand 6 states and 100 transitions. [2022-12-13 00:53:22,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 125 transitions, 1260 flow [2022-12-13 00:53:22,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 125 transitions, 1165 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-13 00:53:22,109 INFO L231 Difference]: Finished difference. Result has 72 places, 84 transitions, 758 flow [2022-12-13 00:53:22,109 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=758, PETRI_PLACES=72, PETRI_TRANSITIONS=84} [2022-12-13 00:53:22,110 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2022-12-13 00:53:22,110 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:22,110 INFO L89 Accepts]: Start accepts. Operand has 72 places, 84 transitions, 758 flow [2022-12-13 00:53:22,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:22,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:22,111 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 84 transitions, 758 flow [2022-12-13 00:53:22,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 84 transitions, 758 flow [2022-12-13 00:53:22,147 INFO L130 PetriNetUnfolder]: 266/618 cut-off events. [2022-12-13 00:53:22,147 INFO L131 PetriNetUnfolder]: For 1513/1718 co-relation queries the response was YES. [2022-12-13 00:53:22,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 618 events. 266/618 cut-off events. For 1513/1718 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 4060 event pairs, 1 based on Foata normal form. 5/246 useless extension candidates. Maximal degree in co-relation 2025. Up to 280 conditions per place. [2022-12-13 00:53:22,152 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 84 transitions, 758 flow [2022-12-13 00:53:22,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 884 [2022-12-13 00:53:22,232 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [467] $Ultimate##0-->L745: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_240 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_240, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] and [565] $Ultimate##0-->L830: Formula: (let ((.cse5 (= (mod v_~y$r_buff1_thd3~0_242 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd3~0_250 256) 0))) (let ((.cse11 (not .cse10)) (.cse7 (and .cse5 .cse10)) (.cse8 (and (= (mod v_~y$w_buff1_used~0_753 256) 0) .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_808 256) 0))) (let ((.cse1 (or .cse7 .cse8 .cse12)) (.cse2 (and .cse11 (not .cse12)))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_244 256) 0))) (.cse6 (= (mod v_~y$w_buff1_used~0_752 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_807 256) 0)) (.cse9 (ite .cse1 v_~y~0_725 (ite .cse2 v_~y$w_buff0~0_551 v_~y$w_buff1~0_513)))) (and (= v_~y$w_buff0_used~0_807 (ite .cse0 v_~y$w_buff0_used~0_808 (ite .cse1 v_~y$w_buff0_used~0_808 (ite .cse2 0 v_~y$w_buff0_used~0_808)))) (= v_~x~0_75 v_~__unbuffered_p2_EAX~0_142) (= v_~y~0_725 v_~y$mem_tmp~0_214) (= (ite .cse0 v_~y$r_buff1_thd3~0_242 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_249 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) v_~y$r_buff1_thd3~0_242 0)) v_~y$r_buff1_thd3~0_241) (= v_~y$w_buff0~0_551 v_~y$w_buff0~0_550) (= v_~y$w_buff1_used~0_752 (ite .cse0 v_~y$w_buff1_used~0_753 (ite (or .cse3 .cse7 .cse8) v_~y$w_buff1_used~0_753 0))) (= v_~y~0_724 (ite .cse0 v_~y$mem_tmp~0_214 .cse9)) (= v_~y$flush_delayed~0_233 0) (= v_~weak$$choice0~0_183 |v_P2Thread1of1ForFork0_#t~nondet5_50|) (= v_~y$w_buff1~0_513 v_~y$w_buff1~0_512) (= (ite .cse0 v_~y$r_buff0_thd3~0_250 (ite (or .cse3 .cse7 (and .cse6 .cse10)) v_~y$r_buff0_thd3~0_250 (ite (and (not .cse3) .cse11) 0 v_~y$r_buff0_thd3~0_250))) v_~y$r_buff0_thd3~0_249) (= |v_P2Thread1of1ForFork0_#in~arg.base_27| v_P2Thread1of1ForFork0_~arg.base_27) (= v_~__unbuffered_p2_EBX~0_152 .cse9) (= |v_P2Thread1of1ForFork0_#in~arg.offset_27| v_P2Thread1of1ForFork0_~arg.offset_27) (= v_~weak$$choice2~0_244 |v_P2Thread1of1ForFork0_#t~nondet6_50|)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_242, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_808, ~y$w_buff1~0=v_~y$w_buff1~0_513, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_250, ~y$w_buff0~0=v_~y$w_buff0~0_551, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_50|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_50|, ~y~0=v_~y~0_725, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_753} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_152, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_807, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_27, ~weak$$choice0~0=v_~weak$$choice0~0_183, ~y$mem_tmp~0=v_~y$mem_tmp~0_214, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_27, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_241, ~y$w_buff1~0=v_~y$w_buff1~0_512, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_249, ~y$w_buff0~0=v_~y$w_buff0~0_550, ~y$flush_delayed~0=v_~y$flush_delayed~0_233, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_142, ~y~0=v_~y~0_724, ~weak$$choice2~0=v_~weak$$choice2~0_244, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_752} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 00:53:22,429 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [411] L830-->L837: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_139 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_46 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd3~0_40 256) 0)))) (let ((.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_125 256) 0)))) (.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_140 256) 0)) .cse5))) (and (= v_~y$r_buff0_thd3~0_45 (ite .cse0 0 v_~y$r_buff0_thd3~0_46)) (= v_~y~0_97 (ite .cse1 v_~y$w_buff0~0_58 (ite .cse2 v_~y$w_buff1~0_51 v_~y~0_98))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_125) v_~y$w_buff1_used~0_124) (= v_~y$w_buff0_used~0_139 (ite .cse1 0 v_~y$w_buff0_used~0_140)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_124 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_45 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_40) v_~y$r_buff1_thd3~0_39)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_40, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_140, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_139, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_97, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] and [565] $Ultimate##0-->L830: Formula: (let ((.cse5 (= (mod v_~y$r_buff1_thd3~0_242 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd3~0_250 256) 0))) (let ((.cse11 (not .cse10)) (.cse7 (and .cse5 .cse10)) (.cse8 (and (= (mod v_~y$w_buff1_used~0_753 256) 0) .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_808 256) 0))) (let ((.cse1 (or .cse7 .cse8 .cse12)) (.cse2 (and .cse11 (not .cse12)))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_244 256) 0))) (.cse6 (= (mod v_~y$w_buff1_used~0_752 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_807 256) 0)) (.cse9 (ite .cse1 v_~y~0_725 (ite .cse2 v_~y$w_buff0~0_551 v_~y$w_buff1~0_513)))) (and (= v_~y$w_buff0_used~0_807 (ite .cse0 v_~y$w_buff0_used~0_808 (ite .cse1 v_~y$w_buff0_used~0_808 (ite .cse2 0 v_~y$w_buff0_used~0_808)))) (= v_~x~0_75 v_~__unbuffered_p2_EAX~0_142) (= v_~y~0_725 v_~y$mem_tmp~0_214) (= (ite .cse0 v_~y$r_buff1_thd3~0_242 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_249 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) v_~y$r_buff1_thd3~0_242 0)) v_~y$r_buff1_thd3~0_241) (= v_~y$w_buff0~0_551 v_~y$w_buff0~0_550) (= v_~y$w_buff1_used~0_752 (ite .cse0 v_~y$w_buff1_used~0_753 (ite (or .cse3 .cse7 .cse8) v_~y$w_buff1_used~0_753 0))) (= v_~y~0_724 (ite .cse0 v_~y$mem_tmp~0_214 .cse9)) (= v_~y$flush_delayed~0_233 0) (= v_~weak$$choice0~0_183 |v_P2Thread1of1ForFork0_#t~nondet5_50|) (= v_~y$w_buff1~0_513 v_~y$w_buff1~0_512) (= (ite .cse0 v_~y$r_buff0_thd3~0_250 (ite (or .cse3 .cse7 (and .cse6 .cse10)) v_~y$r_buff0_thd3~0_250 (ite (and (not .cse3) .cse11) 0 v_~y$r_buff0_thd3~0_250))) v_~y$r_buff0_thd3~0_249) (= |v_P2Thread1of1ForFork0_#in~arg.base_27| v_P2Thread1of1ForFork0_~arg.base_27) (= v_~__unbuffered_p2_EBX~0_152 .cse9) (= |v_P2Thread1of1ForFork0_#in~arg.offset_27| v_P2Thread1of1ForFork0_~arg.offset_27) (= v_~weak$$choice2~0_244 |v_P2Thread1of1ForFork0_#t~nondet6_50|)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_242, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_808, ~y$w_buff1~0=v_~y$w_buff1~0_513, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_250, ~y$w_buff0~0=v_~y$w_buff0~0_551, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_50|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_50|, ~y~0=v_~y~0_725, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_753} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_152, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_807, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_27, ~weak$$choice0~0=v_~weak$$choice0~0_183, ~y$mem_tmp~0=v_~y$mem_tmp~0_214, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_27, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_241, ~y$w_buff1~0=v_~y$w_buff1~0_512, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_249, ~y$w_buff0~0=v_~y$w_buff0~0_550, ~y$flush_delayed~0=v_~y$flush_delayed~0_233, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_142, ~y~0=v_~y~0_724, ~weak$$choice2~0=v_~weak$$choice2~0_244, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_752} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 00:53:22,678 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [396] L768-->L775: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_66 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_183 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= 0 (mod v_~y$w_buff0_used~0_184 256))))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_173 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd1~0_66) v_~y$r_buff0_thd1~0_65) (= (ite .cse1 0 v_~y$w_buff0_used~0_184) v_~y$w_buff0_used~0_183) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_173) v_~y$w_buff1_used~0_172) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_172 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_65 256) 0)))) 0 v_~y$r_buff1_thd1~0_56) v_~y$r_buff1_thd1~0_55) (= v_~y~0_143 (ite .cse1 v_~y$w_buff0~0_78 (ite .cse2 v_~y$w_buff1~0_77 v_~y~0_144)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_184, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, ~y~0=v_~y~0_144, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_55, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_183, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y~0=v_~y~0_143, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] and [565] $Ultimate##0-->L830: Formula: (let ((.cse5 (= (mod v_~y$r_buff1_thd3~0_242 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd3~0_250 256) 0))) (let ((.cse11 (not .cse10)) (.cse7 (and .cse5 .cse10)) (.cse8 (and (= (mod v_~y$w_buff1_used~0_753 256) 0) .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_808 256) 0))) (let ((.cse1 (or .cse7 .cse8 .cse12)) (.cse2 (and .cse11 (not .cse12)))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_244 256) 0))) (.cse6 (= (mod v_~y$w_buff1_used~0_752 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_807 256) 0)) (.cse9 (ite .cse1 v_~y~0_725 (ite .cse2 v_~y$w_buff0~0_551 v_~y$w_buff1~0_513)))) (and (= v_~y$w_buff0_used~0_807 (ite .cse0 v_~y$w_buff0_used~0_808 (ite .cse1 v_~y$w_buff0_used~0_808 (ite .cse2 0 v_~y$w_buff0_used~0_808)))) (= v_~x~0_75 v_~__unbuffered_p2_EAX~0_142) (= v_~y~0_725 v_~y$mem_tmp~0_214) (= (ite .cse0 v_~y$r_buff1_thd3~0_242 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_249 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) v_~y$r_buff1_thd3~0_242 0)) v_~y$r_buff1_thd3~0_241) (= v_~y$w_buff0~0_551 v_~y$w_buff0~0_550) (= v_~y$w_buff1_used~0_752 (ite .cse0 v_~y$w_buff1_used~0_753 (ite (or .cse3 .cse7 .cse8) v_~y$w_buff1_used~0_753 0))) (= v_~y~0_724 (ite .cse0 v_~y$mem_tmp~0_214 .cse9)) (= v_~y$flush_delayed~0_233 0) (= v_~weak$$choice0~0_183 |v_P2Thread1of1ForFork0_#t~nondet5_50|) (= v_~y$w_buff1~0_513 v_~y$w_buff1~0_512) (= (ite .cse0 v_~y$r_buff0_thd3~0_250 (ite (or .cse3 .cse7 (and .cse6 .cse10)) v_~y$r_buff0_thd3~0_250 (ite (and (not .cse3) .cse11) 0 v_~y$r_buff0_thd3~0_250))) v_~y$r_buff0_thd3~0_249) (= |v_P2Thread1of1ForFork0_#in~arg.base_27| v_P2Thread1of1ForFork0_~arg.base_27) (= v_~__unbuffered_p2_EBX~0_152 .cse9) (= |v_P2Thread1of1ForFork0_#in~arg.offset_27| v_P2Thread1of1ForFork0_~arg.offset_27) (= v_~weak$$choice2~0_244 |v_P2Thread1of1ForFork0_#t~nondet6_50|)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_242, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_808, ~y$w_buff1~0=v_~y$w_buff1~0_513, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_250, ~y$w_buff0~0=v_~y$w_buff0~0_551, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_50|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_50|, ~y~0=v_~y~0_725, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_753} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_152, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_807, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_27, ~weak$$choice0~0=v_~weak$$choice0~0_183, ~y$mem_tmp~0=v_~y$mem_tmp~0_214, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_27, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_241, ~y$w_buff1~0=v_~y$w_buff1~0_512, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_249, ~y$w_buff0~0=v_~y$w_buff0~0_550, ~y$flush_delayed~0=v_~y$flush_delayed~0_233, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_142, ~y~0=v_~y~0_724, ~weak$$choice2~0=v_~weak$$choice2~0_244, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_752} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 00:53:22,924 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [404] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_221 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_209 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_222 256) 0)) .cse5))) (and (= v_~y~0_181 (ite .cse0 v_~y$w_buff0~0_106 (ite .cse1 v_~y$w_buff1~0_109 v_~y~0_182))) (= (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_209) v_~y$w_buff1_used~0_208) (= v_~y$r_buff0_thd2~0_28 (ite .cse2 0 v_~y$r_buff0_thd2~0_29)) (= v_~y$w_buff0_used~0_221 (ite .cse0 0 v_~y$w_buff0_used~0_222)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_208 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_222, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_182, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_209} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_221, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_181, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [565] $Ultimate##0-->L830: Formula: (let ((.cse5 (= (mod v_~y$r_buff1_thd3~0_242 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd3~0_250 256) 0))) (let ((.cse11 (not .cse10)) (.cse7 (and .cse5 .cse10)) (.cse8 (and (= (mod v_~y$w_buff1_used~0_753 256) 0) .cse10)) (.cse12 (= (mod v_~y$w_buff0_used~0_808 256) 0))) (let ((.cse1 (or .cse7 .cse8 .cse12)) (.cse2 (and .cse11 (not .cse12)))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_244 256) 0))) (.cse6 (= (mod v_~y$w_buff1_used~0_752 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_807 256) 0)) (.cse9 (ite .cse1 v_~y~0_725 (ite .cse2 v_~y$w_buff0~0_551 v_~y$w_buff1~0_513)))) (and (= v_~y$w_buff0_used~0_807 (ite .cse0 v_~y$w_buff0_used~0_808 (ite .cse1 v_~y$w_buff0_used~0_808 (ite .cse2 0 v_~y$w_buff0_used~0_808)))) (= v_~x~0_75 v_~__unbuffered_p2_EAX~0_142) (= v_~y~0_725 v_~y$mem_tmp~0_214) (= (ite .cse0 v_~y$r_buff1_thd3~0_242 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd3~0_249 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) v_~y$r_buff1_thd3~0_242 0)) v_~y$r_buff1_thd3~0_241) (= v_~y$w_buff0~0_551 v_~y$w_buff0~0_550) (= v_~y$w_buff1_used~0_752 (ite .cse0 v_~y$w_buff1_used~0_753 (ite (or .cse3 .cse7 .cse8) v_~y$w_buff1_used~0_753 0))) (= v_~y~0_724 (ite .cse0 v_~y$mem_tmp~0_214 .cse9)) (= v_~y$flush_delayed~0_233 0) (= v_~weak$$choice0~0_183 |v_P2Thread1of1ForFork0_#t~nondet5_50|) (= v_~y$w_buff1~0_513 v_~y$w_buff1~0_512) (= (ite .cse0 v_~y$r_buff0_thd3~0_250 (ite (or .cse3 .cse7 (and .cse6 .cse10)) v_~y$r_buff0_thd3~0_250 (ite (and (not .cse3) .cse11) 0 v_~y$r_buff0_thd3~0_250))) v_~y$r_buff0_thd3~0_249) (= |v_P2Thread1of1ForFork0_#in~arg.base_27| v_P2Thread1of1ForFork0_~arg.base_27) (= v_~__unbuffered_p2_EBX~0_152 .cse9) (= |v_P2Thread1of1ForFork0_#in~arg.offset_27| v_P2Thread1of1ForFork0_~arg.offset_27) (= v_~weak$$choice2~0_244 |v_P2Thread1of1ForFork0_#t~nondet6_50|)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_242, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_808, ~y$w_buff1~0=v_~y$w_buff1~0_513, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_250, ~y$w_buff0~0=v_~y$w_buff0~0_551, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_50|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_50|, ~y~0=v_~y~0_725, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_753} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_152, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_807, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_27, ~weak$$choice0~0=v_~weak$$choice0~0_183, ~y$mem_tmp~0=v_~y$mem_tmp~0_214, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_27, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_241, ~y$w_buff1~0=v_~y$w_buff1~0_512, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_249, ~y$w_buff0~0=v_~y$w_buff0~0_550, ~y$flush_delayed~0=v_~y$flush_delayed~0_233, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_142, ~y~0=v_~y~0_724, ~weak$$choice2~0=v_~weak$$choice2~0_244, ~x~0=v_~x~0_75, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_752} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 00:53:23,162 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 00:53:23,163 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:53:23,163 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1053 [2022-12-13 00:53:23,163 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 82 transitions, 794 flow [2022-12-13 00:53:23,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:23,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:23,163 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:53:23,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 00:53:23,164 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:23,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1417425326, now seen corresponding path program 3 times [2022-12-13 00:53:23,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:23,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809403380] [2022-12-13 00:53:23,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:23,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:23,584 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:53:23,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:23,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809403380] [2022-12-13 00:53:23,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809403380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:23,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:23,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:53:23,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637193698] [2022-12-13 00:53:23,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:23,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:53:23,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:23,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:53:23,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:53:23,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2022-12-13 00:53:23,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 82 transitions, 794 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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:53:23,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:23,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2022-12-13 00:53:23,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:23,890 INFO L130 PetriNetUnfolder]: 542/1039 cut-off events. [2022-12-13 00:53:23,890 INFO L131 PetriNetUnfolder]: For 4924/5009 co-relation queries the response was YES. [2022-12-13 00:53:23,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4591 conditions, 1039 events. 542/1039 cut-off events. For 4924/5009 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5697 event pairs, 73 based on Foata normal form. 80/872 useless extension candidates. Maximal degree in co-relation 4564. Up to 396 conditions per place. [2022-12-13 00:53:23,895 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 36 selfloop transitions, 5 changer transitions 60/112 dead transitions. [2022-12-13 00:53:23,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 112 transitions, 1004 flow [2022-12-13 00:53:23,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:53:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:53:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2022-12-13 00:53:23,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3782051282051282 [2022-12-13 00:53:23,897 INFO L175 Difference]: Start difference. First operand has 72 places, 82 transitions, 794 flow. Second operand 8 states and 118 transitions. [2022-12-13 00:53:23,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 112 transitions, 1004 flow [2022-12-13 00:53:23,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 112 transitions, 984 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 00:53:23,907 INFO L231 Difference]: Finished difference. Result has 77 places, 43 transitions, 276 flow [2022-12-13 00:53:23,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=276, PETRI_PLACES=77, PETRI_TRANSITIONS=43} [2022-12-13 00:53:23,907 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2022-12-13 00:53:23,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:23,907 INFO L89 Accepts]: Start accepts. Operand has 77 places, 43 transitions, 276 flow [2022-12-13 00:53:23,908 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:23,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:23,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 43 transitions, 276 flow [2022-12-13 00:53:23,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 43 transitions, 276 flow [2022-12-13 00:53:23,926 INFO L130 PetriNetUnfolder]: 93/214 cut-off events. [2022-12-13 00:53:23,927 INFO L131 PetriNetUnfolder]: For 982/1054 co-relation queries the response was YES. [2022-12-13 00:53:23,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 214 events. 93/214 cut-off events. For 982/1054 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1037 event pairs, 3 based on Foata normal form. 2/89 useless extension candidates. Maximal degree in co-relation 696. Up to 109 conditions per place. [2022-12-13 00:53:23,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 43 transitions, 276 flow [2022-12-13 00:53:23,928 INFO L226 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-13 00:53:24,196 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [573] $Ultimate##0-->L830: Formula: (let ((.cse7 (= (mod v_~y$w_buff0_used~0_859 256) 0)) (.cse2 (= (mod v_~y$r_buff0_thd3~0_267 256) 0))) (let ((.cse1 (and .cse7 .cse2))) (let ((.cse8 (or .cse1 .cse2)) (.cse5 (not .cse2))) (let ((.cse6 (ite .cse8 v_~y~0_770 (ite .cse5 v_~y$w_buff0~0_588 v_~y$w_buff0~0_590))) (.cse0 (not (= (mod v_~weak$$choice2~0_257 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_796 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_857 256) 0))) (and (= |v_P2Thread1of1ForFork0_#in~arg.offset_29| v_P2Thread1of1ForFork0_~arg.offset_29) (= v_~y$r_buff0_thd0~0_378 v_~y$r_buff1_thd0~0_370) (= v_~y$w_buff1_used~0_796 (ite .cse0 v_~y$w_buff0_used~0_859 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff0_used~0_859 0))) (= v_~y$flush_delayed~0_246 0) (= v_~y$r_buff0_thd2~0_228 1) (= v_~x~0_83 v_~__unbuffered_p2_EAX~0_146) (= (ite .cse0 v_~y$r_buff0_thd3~0_267 (ite (or (and .cse4 .cse2) .cse2 .cse3) v_~y$r_buff0_thd3~0_267 (ite (and (not .cse3) .cse5) 0 v_~y$r_buff0_thd3~0_267))) v_~y$r_buff0_thd3~0_266) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61| 0)) (= v_~y$r_buff0_thd1~0_325 v_~y$r_buff1_thd1~0_326) (= v_~weak$$choice2~0_257 |v_P2Thread1of1ForFork0_#t~nondet6_54|) (= v_~y$w_buff1~0_544 v_~y$w_buff0~0_590) (= v_~__unbuffered_p2_EBX~0_156 .cse6) (= v_~y~0_769 (ite .cse0 v_~y$mem_tmp~0_227 .cse6)) (= (ite .cse7 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61|) (= v_~x~0_83 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_29| v_P2Thread1of1ForFork0_~arg.base_29) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_59| |v_P1Thread1of1ForFork2_~arg#1.offset_59|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_59| |v_P1Thread1of1ForFork2_~arg#1.base_59|) (= (ite .cse0 1 (ite .cse8 1 (ite .cse5 0 1))) v_~y$w_buff0_used~0_857) (= v_~weak$$choice0~0_196 |v_P2Thread1of1ForFork0_#t~nondet5_54|) (= 2 v_~y$w_buff0~0_588) (= v_~y$r_buff0_thd2~0_229 v_~y$r_buff1_thd2~0_165) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61|) (= v_~y~0_770 v_~y$mem_tmp~0_227) (= v_~y$r_buff1_thd3~0_258 (ite .cse0 v_~y$r_buff0_thd3~0_267 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_266 256) 0))) (or (and .cse9 .cse4) (and .cse9 .cse2) .cse3)) v_~y$r_buff0_thd3~0_267 0)))))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_859, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_54|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_54|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_59|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_267, ~y$w_buff0~0=v_~y$w_buff0~0_590, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_378, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_229, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, ~y~0=v_~y~0_770, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_59|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_59|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_857, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_59|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_326, ~y$mem_tmp~0=v_~y$mem_tmp~0_227, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_29, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_258, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_266, ~y$w_buff0~0=v_~y$w_buff0~0_588, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, ~y$flush_delayed~0=v_~y$flush_delayed~0_246, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ~y~0=v_~y~0_769, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_59|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_156, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_29, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_165, ~weak$$choice0~0=v_~weak$$choice0~0_196, ~y$w_buff1~0=v_~y$w_buff1~0_544, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_378, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_228, ~weak$$choice2~0=v_~weak$$choice2~0_257, ~x~0=v_~x~0_83, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_370, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_796} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, P1Thread1of1ForFork2_~arg#1.offset, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [578] L797-->L807: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_885 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_172 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_237 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_886 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_823 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~y$w_buff0_used~0_885 (ite .cse0 0 v_~y$w_buff0_used~0_886)) (= v_~y$w_buff1_used~0_822 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_823)) (= v_~__unbuffered_cnt~0_429 (+ v_~__unbuffered_cnt~0_430 1)) (= v_~y$r_buff1_thd2~0_171 (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_822 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_236 256) 0)))) 0 v_~y$r_buff1_thd2~0_172)) (= v_~y~0_795 (ite .cse0 v_~y$w_buff0~0_610 (ite .cse1 v_~y$w_buff1~0_564 v_~y~0_796))) (= (ite .cse2 0 v_~y$r_buff0_thd2~0_237) v_~y$r_buff0_thd2~0_236)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_172, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_886, ~y$w_buff1~0=v_~y$w_buff1~0_564, ~y$w_buff0~0=v_~y$w_buff0~0_610, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_237, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_430, ~y~0=v_~y~0_796, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_823} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_885, ~y$w_buff1~0=v_~y$w_buff1~0_564, ~y$w_buff0~0=v_~y$w_buff0~0_610, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_236, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_429, ~y~0=v_~y~0_795, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_822} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:53:24,582 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [573] $Ultimate##0-->L830: Formula: (let ((.cse7 (= (mod v_~y$w_buff0_used~0_859 256) 0)) (.cse2 (= (mod v_~y$r_buff0_thd3~0_267 256) 0))) (let ((.cse1 (and .cse7 .cse2))) (let ((.cse8 (or .cse1 .cse2)) (.cse5 (not .cse2))) (let ((.cse6 (ite .cse8 v_~y~0_770 (ite .cse5 v_~y$w_buff0~0_588 v_~y$w_buff0~0_590))) (.cse0 (not (= (mod v_~weak$$choice2~0_257 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_796 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_857 256) 0))) (and (= |v_P2Thread1of1ForFork0_#in~arg.offset_29| v_P2Thread1of1ForFork0_~arg.offset_29) (= v_~y$r_buff0_thd0~0_378 v_~y$r_buff1_thd0~0_370) (= v_~y$w_buff1_used~0_796 (ite .cse0 v_~y$w_buff0_used~0_859 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff0_used~0_859 0))) (= v_~y$flush_delayed~0_246 0) (= v_~y$r_buff0_thd2~0_228 1) (= v_~x~0_83 v_~__unbuffered_p2_EAX~0_146) (= (ite .cse0 v_~y$r_buff0_thd3~0_267 (ite (or (and .cse4 .cse2) .cse2 .cse3) v_~y$r_buff0_thd3~0_267 (ite (and (not .cse3) .cse5) 0 v_~y$r_buff0_thd3~0_267))) v_~y$r_buff0_thd3~0_266) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61| 0)) (= v_~y$r_buff0_thd1~0_325 v_~y$r_buff1_thd1~0_326) (= v_~weak$$choice2~0_257 |v_P2Thread1of1ForFork0_#t~nondet6_54|) (= v_~y$w_buff1~0_544 v_~y$w_buff0~0_590) (= v_~__unbuffered_p2_EBX~0_156 .cse6) (= v_~y~0_769 (ite .cse0 v_~y$mem_tmp~0_227 .cse6)) (= (ite .cse7 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61|) (= v_~x~0_83 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_29| v_P2Thread1of1ForFork0_~arg.base_29) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_59| |v_P1Thread1of1ForFork2_~arg#1.offset_59|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_59| |v_P1Thread1of1ForFork2_~arg#1.base_59|) (= (ite .cse0 1 (ite .cse8 1 (ite .cse5 0 1))) v_~y$w_buff0_used~0_857) (= v_~weak$$choice0~0_196 |v_P2Thread1of1ForFork0_#t~nondet5_54|) (= 2 v_~y$w_buff0~0_588) (= v_~y$r_buff0_thd2~0_229 v_~y$r_buff1_thd2~0_165) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61|) (= v_~y~0_770 v_~y$mem_tmp~0_227) (= v_~y$r_buff1_thd3~0_258 (ite .cse0 v_~y$r_buff0_thd3~0_267 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_266 256) 0))) (or (and .cse9 .cse4) (and .cse9 .cse2) .cse3)) v_~y$r_buff0_thd3~0_267 0)))))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_859, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_54|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_54|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_59|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_267, ~y$w_buff0~0=v_~y$w_buff0~0_590, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_378, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_229, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, ~y~0=v_~y~0_770, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_59|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_59|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_857, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_59|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_326, ~y$mem_tmp~0=v_~y$mem_tmp~0_227, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_29, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_258, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_266, ~y$w_buff0~0=v_~y$w_buff0~0_588, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, ~y$flush_delayed~0=v_~y$flush_delayed~0_246, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ~y~0=v_~y~0_769, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_59|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_156, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_29, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_165, ~weak$$choice0~0=v_~weak$$choice0~0_196, ~y$w_buff1~0=v_~y$w_buff1~0_544, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_378, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_228, ~weak$$choice2~0=v_~weak$$choice2~0_257, ~x~0=v_~x~0_83, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_370, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_796} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, P1Thread1of1ForFork2_~arg#1.offset, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [579] L797-->P1EXIT: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_889 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_241 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_176 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_827 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_890 256) 0)) .cse5))) (and (= v_~y~0_799 (ite .cse0 v_~y$w_buff0~0_612 (ite .cse1 v_~y$w_buff1~0_566 v_~y~0_800))) (= (ite .cse2 0 v_~y$r_buff0_thd2~0_241) v_~y$r_buff0_thd2~0_240) (= v_~y$w_buff1_used~0_826 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_827)) (= v_~y$w_buff0_used~0_889 (ite .cse0 0 v_~y$w_buff0_used~0_890)) (= v_~y$r_buff1_thd2~0_175 (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_240 256) 0))) (and .cse4 (not (= 0 (mod v_~y$w_buff1_used~0_826 256))))) 0 v_~y$r_buff1_thd2~0_176)) (= v_~__unbuffered_cnt~0_433 (+ v_~__unbuffered_cnt~0_434 1)) (= |v_P1Thread1of1ForFork2_#res#1.offset_35| 0) (= |v_P1Thread1of1ForFork2_#res#1.base_35| 0)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_176, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_890, ~y$w_buff1~0=v_~y$w_buff1~0_566, ~y$w_buff0~0=v_~y$w_buff0~0_612, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_241, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_434, ~y~0=v_~y~0_800, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_827} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_175, P1Thread1of1ForFork2_#res#1.base=|v_P1Thread1of1ForFork2_#res#1.base_35|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_889, ~y$w_buff1~0=v_~y$w_buff1~0_566, ~y$w_buff0~0=v_~y$w_buff0~0_612, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_240, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_433, ~y~0=v_~y~0_799, P1Thread1of1ForFork2_#res#1.offset=|v_P1Thread1of1ForFork2_#res#1.offset_35|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_826} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res#1.base, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res#1.offset, ~y$w_buff1_used~0] [2022-12-13 00:53:25,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [573] $Ultimate##0-->L830: Formula: (let ((.cse7 (= (mod v_~y$w_buff0_used~0_859 256) 0)) (.cse2 (= (mod v_~y$r_buff0_thd3~0_267 256) 0))) (let ((.cse1 (and .cse7 .cse2))) (let ((.cse8 (or .cse1 .cse2)) (.cse5 (not .cse2))) (let ((.cse6 (ite .cse8 v_~y~0_770 (ite .cse5 v_~y$w_buff0~0_588 v_~y$w_buff0~0_590))) (.cse0 (not (= (mod v_~weak$$choice2~0_257 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_796 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_857 256) 0))) (and (= |v_P2Thread1of1ForFork0_#in~arg.offset_29| v_P2Thread1of1ForFork0_~arg.offset_29) (= v_~y$r_buff0_thd0~0_378 v_~y$r_buff1_thd0~0_370) (= v_~y$w_buff1_used~0_796 (ite .cse0 v_~y$w_buff0_used~0_859 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff0_used~0_859 0))) (= v_~y$flush_delayed~0_246 0) (= v_~y$r_buff0_thd2~0_228 1) (= v_~x~0_83 v_~__unbuffered_p2_EAX~0_146) (= (ite .cse0 v_~y$r_buff0_thd3~0_267 (ite (or (and .cse4 .cse2) .cse2 .cse3) v_~y$r_buff0_thd3~0_267 (ite (and (not .cse3) .cse5) 0 v_~y$r_buff0_thd3~0_267))) v_~y$r_buff0_thd3~0_266) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61| 0)) (= v_~y$r_buff0_thd1~0_325 v_~y$r_buff1_thd1~0_326) (= v_~weak$$choice2~0_257 |v_P2Thread1of1ForFork0_#t~nondet6_54|) (= v_~y$w_buff1~0_544 v_~y$w_buff0~0_590) (= v_~__unbuffered_p2_EBX~0_156 .cse6) (= v_~y~0_769 (ite .cse0 v_~y$mem_tmp~0_227 .cse6)) (= (ite .cse7 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61|) (= v_~x~0_83 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_29| v_P2Thread1of1ForFork0_~arg.base_29) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_59| |v_P1Thread1of1ForFork2_~arg#1.offset_59|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_59| |v_P1Thread1of1ForFork2_~arg#1.base_59|) (= (ite .cse0 1 (ite .cse8 1 (ite .cse5 0 1))) v_~y$w_buff0_used~0_857) (= v_~weak$$choice0~0_196 |v_P2Thread1of1ForFork0_#t~nondet5_54|) (= 2 v_~y$w_buff0~0_588) (= v_~y$r_buff0_thd2~0_229 v_~y$r_buff1_thd2~0_165) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61|) (= v_~y~0_770 v_~y$mem_tmp~0_227) (= v_~y$r_buff1_thd3~0_258 (ite .cse0 v_~y$r_buff0_thd3~0_267 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_266 256) 0))) (or (and .cse9 .cse4) (and .cse9 .cse2) .cse3)) v_~y$r_buff0_thd3~0_267 0)))))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_859, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_54|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_54|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_59|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_267, ~y$w_buff0~0=v_~y$w_buff0~0_590, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_378, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_229, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, ~y~0=v_~y~0_770, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_59|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_59|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_857, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_59|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_326, ~y$mem_tmp~0=v_~y$mem_tmp~0_227, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_29, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_258, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_266, ~y$w_buff0~0=v_~y$w_buff0~0_588, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, ~y$flush_delayed~0=v_~y$flush_delayed~0_246, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ~y~0=v_~y~0_769, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_59|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_156, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_29, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_165, ~weak$$choice0~0=v_~weak$$choice0~0_196, ~y$w_buff1~0=v_~y$w_buff1~0_544, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_378, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_228, ~weak$$choice2~0=v_~weak$$choice2~0_257, ~x~0=v_~x~0_83, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_370, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_796} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, P1Thread1of1ForFork2_~arg#1.offset, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [580] L797-->P1FINAL: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_893 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_245 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd2~0_180 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_831 256) 0)) .cse0)) (.cse4 (and .cse1 .cse5)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_894 256) 0))))) (and (= |v_P1Thread1of1ForFork2_#res#1.base_37| 0) (= v_~y$r_buff1_thd2~0_179 (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_830 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_244 256) 0)) .cse1)) 0 v_~y$r_buff1_thd2~0_180)) (= v_~y~0_803 (ite .cse2 v_~y$w_buff0~0_614 (ite .cse3 v_~y$w_buff1~0_568 v_~y~0_804))) (= (ite .cse4 0 v_~y$r_buff0_thd2~0_245) v_~y$r_buff0_thd2~0_244) (= (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_831) v_~y$w_buff1_used~0_830) (= |v_P1Thread1of1ForFork2_#res#1.offset_37| 0) (= (ite .cse2 0 v_~y$w_buff0_used~0_894) v_~y$w_buff0_used~0_893) (= v_~__unbuffered_cnt~0_437 (+ v_~__unbuffered_cnt~0_438 1))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_180, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_894, ~y$w_buff1~0=v_~y$w_buff1~0_568, ~y$w_buff0~0=v_~y$w_buff0~0_614, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_245, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_438, ~y~0=v_~y~0_804, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_831} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_179, P1Thread1of1ForFork2_#res#1.base=|v_P1Thread1of1ForFork2_#res#1.base_37|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_893, ~y$w_buff1~0=v_~y$w_buff1~0_568, ~y$w_buff0~0=v_~y$w_buff0~0_614, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_244, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_437, ~y~0=v_~y~0_803, P1Thread1of1ForFork2_#res#1.offset=|v_P1Thread1of1ForFork2_#res#1.offset_37|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_830} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res#1.base, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res#1.offset, ~y$w_buff1_used~0] [2022-12-13 00:53:25,395 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [573] $Ultimate##0-->L830: Formula: (let ((.cse7 (= (mod v_~y$w_buff0_used~0_859 256) 0)) (.cse2 (= (mod v_~y$r_buff0_thd3~0_267 256) 0))) (let ((.cse1 (and .cse7 .cse2))) (let ((.cse8 (or .cse1 .cse2)) (.cse5 (not .cse2))) (let ((.cse6 (ite .cse8 v_~y~0_770 (ite .cse5 v_~y$w_buff0~0_588 v_~y$w_buff0~0_590))) (.cse0 (not (= (mod v_~weak$$choice2~0_257 256) 0))) (.cse4 (= (mod v_~y$w_buff1_used~0_796 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_857 256) 0))) (and (= |v_P2Thread1of1ForFork0_#in~arg.offset_29| v_P2Thread1of1ForFork0_~arg.offset_29) (= v_~y$r_buff0_thd0~0_378 v_~y$r_buff1_thd0~0_370) (= v_~y$w_buff1_used~0_796 (ite .cse0 v_~y$w_buff0_used~0_859 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff0_used~0_859 0))) (= v_~y$flush_delayed~0_246 0) (= v_~y$r_buff0_thd2~0_228 1) (= v_~x~0_83 v_~__unbuffered_p2_EAX~0_146) (= (ite .cse0 v_~y$r_buff0_thd3~0_267 (ite (or (and .cse4 .cse2) .cse2 .cse3) v_~y$r_buff0_thd3~0_267 (ite (and (not .cse3) .cse5) 0 v_~y$r_buff0_thd3~0_267))) v_~y$r_buff0_thd3~0_266) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61| 0)) (= v_~y$r_buff0_thd1~0_325 v_~y$r_buff1_thd1~0_326) (= v_~weak$$choice2~0_257 |v_P2Thread1of1ForFork0_#t~nondet6_54|) (= v_~y$w_buff1~0_544 v_~y$w_buff0~0_590) (= v_~__unbuffered_p2_EBX~0_156 .cse6) (= v_~y~0_769 (ite .cse0 v_~y$mem_tmp~0_227 .cse6)) (= (ite .cse7 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61|) (= v_~x~0_83 1) (= |v_P2Thread1of1ForFork0_#in~arg.base_29| v_P2Thread1of1ForFork0_~arg.base_29) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_59| |v_P1Thread1of1ForFork2_~arg#1.offset_59|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_59| |v_P1Thread1of1ForFork2_~arg#1.base_59|) (= (ite .cse0 1 (ite .cse8 1 (ite .cse5 0 1))) v_~y$w_buff0_used~0_857) (= v_~weak$$choice0~0_196 |v_P2Thread1of1ForFork0_#t~nondet5_54|) (= 2 v_~y$w_buff0~0_588) (= v_~y$r_buff0_thd2~0_229 v_~y$r_buff1_thd2~0_165) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61|) (= v_~y~0_770 v_~y$mem_tmp~0_227) (= v_~y$r_buff1_thd3~0_258 (ite .cse0 v_~y$r_buff0_thd3~0_267 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd3~0_266 256) 0))) (or (and .cse9 .cse4) (and .cse9 .cse2) .cse3)) v_~y$r_buff0_thd3~0_267 0)))))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_859, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_54|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_54|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_59|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_267, ~y$w_buff0~0=v_~y$w_buff0~0_590, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_378, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_229, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, ~y~0=v_~y~0_770, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_59|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_59|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_857, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_59|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_326, ~y$mem_tmp~0=v_~y$mem_tmp~0_227, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_29, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_258, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_61|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_266, ~y$w_buff0~0=v_~y$w_buff0~0_588, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, ~y$flush_delayed~0=v_~y$flush_delayed~0_246, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ~y~0=v_~y~0_769, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_59|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_156, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_29|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_29, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_165, ~weak$$choice0~0=v_~weak$$choice0~0_196, ~y$w_buff1~0=v_~y$w_buff1~0_544, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_378, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_228, ~weak$$choice2~0=v_~weak$$choice2~0_257, ~x~0=v_~x~0_83, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_29|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_370, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_796} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd3~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, P1Thread1of1ForFork2_~arg#1.offset, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [404] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_221 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_209 256) 0)))) (.cse2 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_222 256) 0)) .cse5))) (and (= v_~y~0_181 (ite .cse0 v_~y$w_buff0~0_106 (ite .cse1 v_~y$w_buff1~0_109 v_~y~0_182))) (= (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_209) v_~y$w_buff1_used~0_208) (= v_~y$r_buff0_thd2~0_28 (ite .cse2 0 v_~y$r_buff0_thd2~0_29)) (= v_~y$w_buff0_used~0_221 (ite .cse0 0 v_~y$w_buff0_used~0_222)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_28 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_208 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_222, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_182, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_209} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_221, ~y$w_buff1~0=v_~y$w_buff1~0_109, ~y$w_buff0~0=v_~y$w_buff0~0_106, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_28, ~y~0=v_~y~0_181, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:53:25,775 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] $Ultimate##0-->P1FINAL: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_911 256) 0)) (.cse7 (= (mod v_~y$r_buff0_thd3~0_297 256) 0))) (let ((.cse15 (and .cse13 .cse7))) (let ((.cse3 (not (= (mod v_~weak$$choice2~0_271 256) 0))) (.cse14 (or .cse15 .cse7)) (.cse9 (not .cse7))) (let ((.cse1 (ite .cse3 1 (ite .cse14 1 (ite .cse9 0 1))))) (let ((.cse6 (= (mod .cse1 256) 0))) (let ((.cse12 (ite .cse3 v_~y$w_buff0_used~0_911 (ite (or .cse6 .cse15 .cse7) v_~y$w_buff0_used~0_911 0)))) (let ((.cse4 (= (mod .cse12 256) 0)) (.cse11 (not (= (mod v_~y$r_buff0_thd2~0_262 256) 0)))) (let ((.cse0 (not .cse6)) (.cse2 (ite .cse14 v_~y~0_821 (ite .cse9 v_~y$w_buff0~0_624 v_~y$w_buff0~0_625))) (.cse8 (not (= (mod v_~y$w_buff0_used~0_909 256) 0))) (.cse10 (and (not .cse4) .cse11))) (and (= v_~y$r_buff0_thd1~0_335 v_~y$r_buff1_thd1~0_336) (= (ite .cse0 0 .cse1) v_~y$w_buff0_used~0_909) (= v_~weak$$choice2~0_271 |v_P2Thread1of1ForFork0_#t~nondet6_82|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_43| v_P2Thread1of1ForFork0_~arg.offset_43) (= .cse2 v_~__unbuffered_p2_EBX~0_170) (= v_~weak$$choice0~0_210 |v_P2Thread1of1ForFork0_#t~nondet5_82|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_65| |v_P1Thread1of1ForFork2_~arg#1.base_65|) (= 2 v_~y$w_buff0~0_624) (= v_~y$r_buff1_thd3~0_284 (ite .cse3 v_~y$r_buff0_thd3~0_297 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd3~0_296 256) 0))) (or (and .cse4 .cse5) .cse6 (and .cse7 .cse5))) v_~y$r_buff0_thd3~0_297 0))) (= |v_P1Thread1of1ForFork2_#res#1.base_41| 0) (= (ite .cse8 0 1) v_~y$r_buff0_thd2~0_260) (= (ite .cse3 v_~y$r_buff0_thd3~0_297 (ite (or .cse6 .cse7 (and .cse4 .cse7)) v_~y$r_buff0_thd3~0_297 (ite (and .cse9 .cse0) 0 v_~y$r_buff0_thd3~0_297))) v_~y$r_buff0_thd3~0_296) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_67| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_67|) (= v_~y~0_819 (ite .cse0 v_~y$w_buff0~0_624 (ite .cse10 v_~y$w_buff1~0_574 (ite .cse3 v_~y$mem_tmp~0_241 .cse2)))) (= (ite (or (and .cse8 (not (= (mod v_~y$r_buff0_thd2~0_260 256) 0))) (and .cse11 (not (= (mod v_~y$w_buff1_used~0_842 256) 0)))) 0 v_~y$r_buff0_thd2~0_262) v_~y$r_buff1_thd2~0_191) (= |v_P2Thread1of1ForFork0_#in~arg.base_43| v_P2Thread1of1ForFork0_~arg.base_43) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_67| 0)) (= v_~y~0_821 v_~y$mem_tmp~0_241) (= |v_P1Thread1of1ForFork2_#res#1.offset_41| 0) (= v_~y$r_buff0_thd0~0_384 v_~y$r_buff1_thd0~0_376) (= v_~x~0_97 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_65| |v_P1Thread1of1ForFork2_~arg#1.offset_65|) (= v_~x~0_97 v_~__unbuffered_p2_EAX~0_160) (= v_~__unbuffered_cnt~0_449 (+ v_~__unbuffered_cnt~0_450 1)) (= v_~y$w_buff1_used~0_842 (ite (or .cse8 .cse10) 0 .cse12)) (= v_~y$flush_delayed~0_260 0) (= v_~y$w_buff1~0_574 v_~y$w_buff0~0_625) (= (ite .cse13 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_67|)))))))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_43|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_911, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_82|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_82|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_65|, ~y$w_buff0~0=v_~y$w_buff0~0_625, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_297, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_384, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_262, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_335, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_450, ~y~0=v_~y~0_821, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_43|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_65|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_65|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_909, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_65|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_336, P1Thread1of1ForFork2_#res#1.base=|v_P1Thread1of1ForFork2_#res#1.base_41|, ~y$mem_tmp~0=v_~y$mem_tmp~0_241, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_43, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_284, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_67|, ~y$w_buff0~0=v_~y$w_buff0~0_624, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_296, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_335, ~y$flush_delayed~0=v_~y$flush_delayed~0_260, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_160, ~y~0=v_~y~0_819, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_65|, P1Thread1of1ForFork2_#res#1.offset=|v_P1Thread1of1ForFork2_#res#1.offset_41|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_65|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_170, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_43|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_43, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_67|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_191, ~weak$$choice0~0=v_~weak$$choice0~0_210, ~y$w_buff1~0=v_~y$w_buff1~0_574, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_384, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_260, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_449, ~weak$$choice2~0=v_~weak$$choice2~0_271, ~x~0=v_~x~0_97, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_43|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_376, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_842} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~y$r_buff1_thd1~0, P1Thread1of1ForFork2_#res#1.base, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, P1Thread1of1ForFork2_~arg#1.offset, P1Thread1of1ForFork2_#res#1.offset, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [411] L830-->L837: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_139 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_46 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd3~0_40 256) 0)))) (let ((.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_125 256) 0)))) (.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_140 256) 0)) .cse5))) (and (= v_~y$r_buff0_thd3~0_45 (ite .cse0 0 v_~y$r_buff0_thd3~0_46)) (= v_~y~0_97 (ite .cse1 v_~y$w_buff0~0_58 (ite .cse2 v_~y$w_buff1~0_51 v_~y~0_98))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_125) v_~y$w_buff1_used~0_124) (= v_~y$w_buff0_used~0_139 (ite .cse1 0 v_~y$w_buff0_used~0_140)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_124 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_45 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_40) v_~y$r_buff1_thd3~0_39)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_40, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_140, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_139, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_97, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:53:26,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [581] $Ultimate##0-->L807: Formula: (let ((.cse3 (= 0 (mod v_~y$w_buff0_used~0_899 256))) (.cse7 (= (mod v_~y$r_buff0_thd3~0_289 256) 0))) (let ((.cse15 (and .cse3 .cse7))) (let ((.cse5 (not (= (mod v_~weak$$choice2~0_267 256) 0))) (.cse14 (or .cse7 .cse15)) (.cse10 (not .cse7))) (let ((.cse12 (ite .cse5 1 (ite .cse14 1 (ite .cse10 0 1))))) (let ((.cse8 (= (mod .cse12 256) 0))) (let ((.cse2 (ite .cse5 v_~y$w_buff0_used~0_899 (ite (or .cse7 .cse15 .cse8) v_~y$w_buff0_used~0_899 0)))) (let ((.cse11 (not (= (mod v_~y$r_buff0_thd2~0_250 256) 0))) (.cse9 (= (mod .cse2 256) 0))) (let ((.cse1 (and .cse11 (not .cse9))) (.cse6 (ite .cse14 v_~y~0_809 (ite .cse10 v_~y$w_buff0~0_616 v_~y$w_buff0~0_617))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_897 256) 0))) (.cse4 (not .cse8))) (and (= v_~y$r_buff0_thd2~0_248 (ite .cse0 0 1)) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_61| |v_P1Thread1of1ForFork2_~arg#1.offset_61|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_61| |v_P1Thread1of1ForFork2_~arg#1.base_61|) (= v_~y$r_buff0_thd1~0_331 v_~y$r_buff1_thd1~0_332) (= v_~y~0_809 v_~y$mem_tmp~0_237) (= v_~y$w_buff1_used~0_834 (ite (or .cse0 .cse1) 0 .cse2)) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63| (ite .cse3 1 0)) (= v_~y$w_buff1~0_570 v_~y$w_buff0~0_617) (= v_~y~0_807 (ite .cse4 v_~y$w_buff0~0_616 (ite .cse1 v_~y$w_buff1~0_570 (ite .cse5 v_~y$mem_tmp~0_237 .cse6)))) (= v_~y$r_buff0_thd0~0_380 v_~y$r_buff1_thd0~0_372) (= v_~y$r_buff0_thd3~0_288 (ite .cse5 v_~y$r_buff0_thd3~0_289 (ite (or .cse7 .cse8 (and .cse7 .cse9)) v_~y$r_buff0_thd3~0_289 (ite (and .cse10 .cse4) 0 v_~y$r_buff0_thd3~0_289)))) (= v_~weak$$choice2~0_267 |v_P2Thread1of1ForFork0_#t~nondet6_74|) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|) (= v_~__unbuffered_p2_EBX~0_166 .cse6) (= 2 v_~y$w_buff0~0_616) (= v_~__unbuffered_cnt~0_441 (+ v_~__unbuffered_cnt~0_442 1)) (= |v_P2Thread1of1ForFork0_#in~arg.offset_39| v_P2Thread1of1ForFork0_~arg.offset_39) (= v_~x~0_93 1) (= v_~y$r_buff1_thd2~0_183 (ite (or (and .cse11 (not (= (mod v_~y$w_buff1_used~0_834 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_248 256) 0)) .cse0)) 0 v_~y$r_buff0_thd2~0_250)) (= v_~y$w_buff0_used~0_897 (ite .cse4 0 .cse12)) (= v_~y$r_buff1_thd3~0_280 (ite .cse5 v_~y$r_buff0_thd3~0_289 (ite (let ((.cse13 (= (mod v_~y$r_buff0_thd3~0_288 256) 0))) (or (and .cse13 .cse9) (and .cse7 .cse13) .cse8)) v_~y$r_buff0_thd3~0_289 0))) (= |v_P2Thread1of1ForFork0_#in~arg.base_39| v_P2Thread1of1ForFork0_~arg.base_39) (= v_~y$flush_delayed~0_256 0) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_63| 0)) (= v_~x~0_93 v_~__unbuffered_p2_EAX~0_156) (= v_~weak$$choice0~0_206 |v_P2Thread1of1ForFork0_#t~nondet5_74|)))))))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_899, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_74|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_74|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_61|, ~y$w_buff0~0=v_~y$w_buff0~0_617, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_289, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_380, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_250, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_331, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_442, ~y~0=v_~y~0_809, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_61|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_61|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_897, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_61|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_332, ~y$mem_tmp~0=v_~y$mem_tmp~0_237, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_280, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63|, ~y$w_buff0~0=v_~y$w_buff0~0_616, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_288, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_331, ~y$flush_delayed~0=v_~y$flush_delayed~0_256, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_156, ~y~0=v_~y~0_807, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_61|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_61|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_166, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_39, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_183, ~weak$$choice0~0=v_~weak$$choice0~0_206, ~y$w_buff1~0=v_~y$w_buff1~0_570, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_380, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_248, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_441, ~weak$$choice2~0=v_~weak$$choice2~0_267, ~x~0=v_~x~0_93, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_372, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_834} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, P1Thread1of1ForFork2_~arg#1.offset, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [411] L830-->L837: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_139 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_46 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd3~0_40 256) 0)))) (let ((.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_125 256) 0)))) (.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_140 256) 0)) .cse5))) (and (= v_~y$r_buff0_thd3~0_45 (ite .cse0 0 v_~y$r_buff0_thd3~0_46)) (= v_~y~0_97 (ite .cse1 v_~y$w_buff0~0_58 (ite .cse2 v_~y$w_buff1~0_51 v_~y~0_98))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_125) v_~y$w_buff1_used~0_124) (= v_~y$w_buff0_used~0_139 (ite .cse1 0 v_~y$w_buff0_used~0_140)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_124 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_45 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_40) v_~y$r_buff1_thd3~0_39)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_40, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_140, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_139, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_97, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:53:26,856 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [582] $Ultimate##0-->P1EXIT: Formula: (let ((.cse9 (= (mod v_~y$w_buff0_used~0_905 256) 0)) (.cse5 (= (mod v_~y$r_buff0_thd3~0_293 256) 0))) (let ((.cse15 (and .cse9 .cse5))) (let ((.cse4 (not (= (mod v_~weak$$choice2~0_269 256) 0))) (.cse14 (or .cse5 .cse15)) (.cse8 (not .cse5))) (let ((.cse1 (ite .cse4 1 (ite .cse14 1 (ite .cse8 0 1))))) (let ((.cse7 (= (mod .cse1 256) 0))) (let ((.cse12 (ite .cse4 v_~y$w_buff0_used~0_905 (ite (or .cse5 .cse15 .cse7) v_~y$w_buff0_used~0_905 0)))) (let ((.cse3 (not (= (mod v_~y$r_buff0_thd2~0_256 256) 0))) (.cse6 (= (mod .cse12 256) 0))) (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_903 256) 0))) (.cse0 (not .cse7)) (.cse11 (and .cse3 (not .cse6))) (.cse13 (ite .cse14 v_~y~0_815 (ite .cse8 v_~y$w_buff0~0_620 v_~y$w_buff0~0_621)))) (and (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_63| |v_P1Thread1of1ForFork2_~arg#1.offset_63|) (= (ite .cse0 0 .cse1) v_~y$w_buff0_used~0_903) (= v_~x~0_95 1) (= |v_P1Thread1of1ForFork2_#res#1.base_39| 0) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_254 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_838 256) 0)))) 0 v_~y$r_buff0_thd2~0_256) v_~y$r_buff1_thd2~0_187) (= v_~y~0_815 v_~y$mem_tmp~0_239) (= (ite .cse4 v_~y$r_buff0_thd3~0_293 (ite (or (and .cse5 .cse6) .cse5 .cse7) v_~y$r_buff0_thd3~0_293 (ite (and .cse8 .cse0) 0 v_~y$r_buff0_thd3~0_293))) v_~y$r_buff0_thd3~0_292) (= (ite .cse2 0 1) v_~y$r_buff0_thd2~0_254) (= |v_P2Thread1of1ForFork0_#in~arg.base_41| v_P2Thread1of1ForFork0_~arg.base_41) (= v_~y$r_buff0_thd1~0_333 v_~y$r_buff1_thd1~0_334) (= (ite .cse9 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_65|) (= v_~y$r_buff1_thd3~0_282 (ite .cse4 v_~y$r_buff0_thd3~0_293 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_292 256) 0))) (or (and .cse5 .cse10) (and .cse6 .cse10) .cse7)) v_~y$r_buff0_thd3~0_293 0))) (= v_~y$r_buff0_thd0~0_382 v_~y$r_buff1_thd0~0_374) (= v_~weak$$choice2~0_269 |v_P2Thread1of1ForFork0_#t~nondet6_78|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_63| |v_P1Thread1of1ForFork2_~arg#1.base_63|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_41| v_P2Thread1of1ForFork0_~arg.offset_41) (= v_~y$w_buff1~0_572 v_~y$w_buff0~0_621) (= v_~y$flush_delayed~0_258 0) (= v_~__unbuffered_cnt~0_445 (+ v_~__unbuffered_cnt~0_446 1)) (= v_~weak$$choice0~0_208 |v_P2Thread1of1ForFork0_#t~nondet5_78|) (= v_~x~0_95 v_~__unbuffered_p2_EAX~0_158) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_65| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_65|) (= (ite (or .cse11 .cse2) 0 .cse12) v_~y$w_buff1_used~0_838) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_65| 0)) (= .cse13 v_~__unbuffered_p2_EBX~0_168) (= v_~y~0_813 (ite .cse0 v_~y$w_buff0~0_620 (ite .cse11 v_~y$w_buff1~0_572 (ite .cse4 v_~y$mem_tmp~0_239 .cse13)))) (= 2 v_~y$w_buff0~0_620) (= |v_P1Thread1of1ForFork2_#res#1.offset_39| 0)))))))))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_41|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_905, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_78|, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_78|, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_63|, ~y$w_buff0~0=v_~y$w_buff0~0_621, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_293, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_382, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_256, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_333, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_446, ~y~0=v_~y~0_815, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_41|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_63|} OutVars{P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_63|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_903, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_63|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_334, P1Thread1of1ForFork2_#res#1.base=|v_P1Thread1of1ForFork2_#res#1.base_39|, ~y$mem_tmp~0=v_~y$mem_tmp~0_239, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_282, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_65|, ~y$w_buff0~0=v_~y$w_buff0~0_620, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_292, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_333, ~y$flush_delayed~0=v_~y$flush_delayed~0_258, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_158, ~y~0=v_~y~0_813, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_63|, P1Thread1of1ForFork2_#res#1.offset=|v_P1Thread1of1ForFork2_#res#1.offset_39|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_63|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_168, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_41|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_41, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_65|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_187, ~weak$$choice0~0=v_~weak$$choice0~0_208, ~y$w_buff1~0=v_~y$w_buff1~0_572, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_382, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_254, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_445, ~weak$$choice2~0=v_~weak$$choice2~0_269, ~x~0=v_~x~0_95, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_41|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_374, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_838} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg#1.base, ~y$w_buff0_used~0, P2Thread1of1ForFork0_#t~nondet6, P2Thread1of1ForFork0_#t~nondet5, ~y$r_buff1_thd1~0, P1Thread1of1ForFork2_#res#1.base, ~y$mem_tmp~0, P2Thread1of1ForFork0_~arg.base, ~y$r_buff1_thd3~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX~0, ~y~0, P1Thread1of1ForFork2_~arg#1.offset, P1Thread1of1ForFork2_#res#1.offset, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [411] L830-->L837: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_139 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_46 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd3~0_40 256) 0)))) (let ((.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_125 256) 0)))) (.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_140 256) 0)) .cse5))) (and (= v_~y$r_buff0_thd3~0_45 (ite .cse0 0 v_~y$r_buff0_thd3~0_46)) (= v_~y~0_97 (ite .cse1 v_~y$w_buff0~0_58 (ite .cse2 v_~y$w_buff1~0_51 v_~y~0_98))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_125) v_~y$w_buff1_used~0_124) (= v_~y$w_buff0_used~0_139 (ite .cse1 0 v_~y$w_buff0_used~0_140)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_124 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_45 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_40) v_~y$r_buff1_thd3~0_39)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_40, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_140, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_125} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_139, ~y$w_buff1~0=v_~y$w_buff1~0_51, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_97, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_124} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:53:27,350 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [566] L859-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse23 (not (= (mod v_~y$r_buff0_thd0~0_369 256) 0)))) (let ((.cse11 (and (not (= (mod v_~y$w_buff0_used~0_812 256) 0)) .cse23))) (let ((.cse15 (ite .cse11 0 v_~y$w_buff0_used~0_812))) (let ((.cse18 (= (mod .cse15 256) 0))) (let ((.cse21 (not .cse18))) (let ((.cse22 (and .cse23 .cse21))) (let ((.cse1 (ite .cse22 0 v_~y$r_buff0_thd0~0_369)) (.cse20 (not (= (mod v_~y$r_buff1_thd0~0_361 256) 0)))) (let ((.cse12 (and (not (= (mod v_~y$w_buff1_used~0_757 256) 0)) .cse20)) (.cse3 (= (mod .cse1 256) 0))) (let ((.cse6 (not .cse3)) (.cse13 (ite (or .cse12 .cse22) 0 v_~y$w_buff1_used~0_757))) (let ((.cse19 (= (mod .cse13 256) 0)) (.cse17 (and .cse6 .cse21))) (let ((.cse7 (ite (or (and (not .cse19) .cse20) .cse17) 0 v_~y$r_buff1_thd0~0_361))) (let ((.cse8 (= (mod .cse7 256) 0))) (let ((.cse14 (and .cse19 .cse3)) (.cse2 (and .cse3 .cse8))) (let ((.cse16 (or .cse14 .cse2 .cse18))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_756 256) 0)) (.cse10 (ite .cse16 v_~y$mem_tmp~0_216 (ite .cse17 v_~y$w_buff0~0_555 v_~y$w_buff1~0_517))) (.cse5 (= (mod v_~y$w_buff0_used~0_811 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_246 256) 0)))) (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_427 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_108) (= v_~y$r_buff0_thd0~0_368 (ite .cse0 .cse1 (ite (or .cse2 (and .cse3 .cse4) .cse5) .cse1 (ite (and .cse6 (not .cse5)) 0 .cse1)))) (= v_~y$r_buff1_thd0~0_360 (ite .cse0 .cse7 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd0~0_368 256) 0))) (or (and .cse8 .cse9) (and .cse4 .cse9) .cse5)) .cse7 0))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_89| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_107| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_89| 0)) (= (mod v_~main$tmp_guard0~0_108 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (= v_~weak$$choice0~0_185 |v_ULTIMATE.start_main_#t~nondet13#1_219|) (= v_~main$tmp_guard1~0_126 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_144 1) (= v_~__unbuffered_p2_EBX~0_154 0) (= v_~__unbuffered_p0_EAX~0_154 1) (= 2 .cse10))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99| (mod v_~main$tmp_guard1~0_126 256)) (= v_~y~0_728 (ite .cse0 v_~y$mem_tmp~0_216 .cse10)) (= v_~y$w_buff1~0_517 v_~y$w_buff1~0_516) (= v_~y$mem_tmp~0_216 (ite .cse11 v_~y$w_buff0~0_555 (ite .cse12 v_~y$w_buff1~0_517 v_~y~0_729))) (= v_~y$flush_delayed~0_235 0) (= v_~y$w_buff0~0_555 v_~y$w_buff0~0_554) (= (ite .cse0 .cse13 (ite (or .cse14 .cse2 .cse5) .cse13 0)) v_~y$w_buff1_used~0_756) (= (ite .cse0 .cse15 (ite .cse16 .cse15 (ite .cse17 0 .cse15))) v_~y$w_buff0_used~0_811) (= |v_ULTIMATE.start_main_#t~nondet14#1_231| v_~weak$$choice2~0_246) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_107| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|))))))))))))))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_154, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_812, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_231|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_517, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_369, ~y$w_buff0~0=v_~y$w_buff0~0_555, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_219|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_144, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_427, ~y~0=v_~y~0_729, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_361, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_757} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_107|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_811, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_126, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_101|, ~y$mem_tmp~0=v_~y$mem_tmp~0_216, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_154, ~y$w_buff0~0=v_~y$w_buff0~0_554, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_89|, ~y$flush_delayed~0=v_~y$flush_delayed~0_235, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_144, ~y~0=v_~y~0_728, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_154, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_108, ~weak$$choice0~0=v_~weak$$choice0~0_185, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~y$w_buff1~0=v_~y$w_buff1~0_516, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_368, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_427, ~weak$$choice2~0=v_~weak$$choice2~0_246, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_360, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet14#1, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~nondet13#1, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [396] L768-->L775: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd1~0_56 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_66 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_183 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= 0 (mod v_~y$w_buff0_used~0_184 256))))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_173 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd1~0_66) v_~y$r_buff0_thd1~0_65) (= (ite .cse1 0 v_~y$w_buff0_used~0_184) v_~y$w_buff0_used~0_183) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_173) v_~y$w_buff1_used~0_172) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_172 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_65 256) 0)))) 0 v_~y$r_buff1_thd1~0_56) v_~y$r_buff1_thd1~0_55) (= v_~y~0_143 (ite .cse1 v_~y$w_buff0~0_78 (ite .cse2 v_~y$w_buff1~0_77 v_~y~0_144)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_184, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, ~y~0=v_~y~0_144, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_55, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_183, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y~0=v_~y~0_143, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 00:53:28,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [566] L859-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse23 (not (= (mod v_~y$r_buff0_thd0~0_369 256) 0)))) (let ((.cse11 (and (not (= (mod v_~y$w_buff0_used~0_812 256) 0)) .cse23))) (let ((.cse15 (ite .cse11 0 v_~y$w_buff0_used~0_812))) (let ((.cse18 (= (mod .cse15 256) 0))) (let ((.cse21 (not .cse18))) (let ((.cse22 (and .cse23 .cse21))) (let ((.cse1 (ite .cse22 0 v_~y$r_buff0_thd0~0_369)) (.cse20 (not (= (mod v_~y$r_buff1_thd0~0_361 256) 0)))) (let ((.cse12 (and (not (= (mod v_~y$w_buff1_used~0_757 256) 0)) .cse20)) (.cse3 (= (mod .cse1 256) 0))) (let ((.cse6 (not .cse3)) (.cse13 (ite (or .cse12 .cse22) 0 v_~y$w_buff1_used~0_757))) (let ((.cse19 (= (mod .cse13 256) 0)) (.cse17 (and .cse6 .cse21))) (let ((.cse7 (ite (or (and (not .cse19) .cse20) .cse17) 0 v_~y$r_buff1_thd0~0_361))) (let ((.cse8 (= (mod .cse7 256) 0))) (let ((.cse14 (and .cse19 .cse3)) (.cse2 (and .cse3 .cse8))) (let ((.cse16 (or .cse14 .cse2 .cse18))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_756 256) 0)) (.cse10 (ite .cse16 v_~y$mem_tmp~0_216 (ite .cse17 v_~y$w_buff0~0_555 v_~y$w_buff1~0_517))) (.cse5 (= (mod v_~y$w_buff0_used~0_811 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_246 256) 0)))) (and (= (ite (= (ite (= v_~__unbuffered_cnt~0_427 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_108) (= v_~y$r_buff0_thd0~0_368 (ite .cse0 .cse1 (ite (or .cse2 (and .cse3 .cse4) .cse5) .cse1 (ite (and .cse6 (not .cse5)) 0 .cse1)))) (= v_~y$r_buff1_thd0~0_360 (ite .cse0 .cse7 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd0~0_368 256) 0))) (or (and .cse8 .cse9) (and .cse4 .cse9) .cse5)) .cse7 0))) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_89| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_107| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_89| 0)) (= (mod v_~main$tmp_guard0~0_108 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (= v_~weak$$choice0~0_185 |v_ULTIMATE.start_main_#t~nondet13#1_219|) (= v_~main$tmp_guard1~0_126 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_144 1) (= v_~__unbuffered_p2_EBX~0_154 0) (= v_~__unbuffered_p0_EAX~0_154 1) (= 2 .cse10))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99| (mod v_~main$tmp_guard1~0_126 256)) (= v_~y~0_728 (ite .cse0 v_~y$mem_tmp~0_216 .cse10)) (= v_~y$w_buff1~0_517 v_~y$w_buff1~0_516) (= v_~y$mem_tmp~0_216 (ite .cse11 v_~y$w_buff0~0_555 (ite .cse12 v_~y$w_buff1~0_517 v_~y~0_729))) (= v_~y$flush_delayed~0_235 0) (= v_~y$w_buff0~0_555 v_~y$w_buff0~0_554) (= (ite .cse0 .cse13 (ite (or .cse14 .cse2 .cse5) .cse13 0)) v_~y$w_buff1_used~0_756) (= (ite .cse0 .cse15 (ite .cse16 .cse15 (ite .cse17 0 .cse15))) v_~y$w_buff0_used~0_811) (= |v_ULTIMATE.start_main_#t~nondet14#1_231| v_~weak$$choice2~0_246) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_107| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|))))))))))))))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_154, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_812, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_231|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_517, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_369, ~y$w_buff0~0=v_~y$w_buff0~0_555, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_219|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_144, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_427, ~y~0=v_~y~0_729, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_361, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_757} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_107|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_811, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_126, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_101|, ~y$mem_tmp~0=v_~y$mem_tmp~0_216, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_154, ~y$w_buff0~0=v_~y$w_buff0~0_554, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_89|, ~y$flush_delayed~0=v_~y$flush_delayed~0_235, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_144, ~y~0=v_~y~0_728, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_154, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_108, ~weak$$choice0~0=v_~weak$$choice0~0_185, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_99|, ~y$w_buff1~0=v_~y$w_buff1~0_516, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_368, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_427, ~weak$$choice2~0=v_~weak$$choice2~0_246, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_360, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet14#1, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~nondet13#1, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [467] $Ultimate##0-->L745: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_240 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_240, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 00:53:28,459 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [588] L859-3-->L775: Formula: (let ((.cse32 (not (= (mod v_~y$r_buff0_thd0~0_395 256) 0)))) (let ((.cse15 (and (not (= (mod v_~y$w_buff0_used~0_949 256) 0)) .cse32))) (let ((.cse26 (ite .cse15 0 v_~y$w_buff0_used~0_949))) (let ((.cse27 (= (mod .cse26 256) 0))) (let ((.cse30 (not .cse27))) (let ((.cse31 (and .cse32 .cse30))) (let ((.cse29 (not (= (mod v_~y$r_buff1_thd0~0_387 256) 0))) (.cse1 (ite .cse31 0 v_~y$r_buff0_thd0~0_395))) (let ((.cse4 (= (mod .cse1 256) 0)) (.cse16 (and .cse29 (not (= (mod v_~y$w_buff1_used~0_872 256) 0))))) (let ((.cse24 (ite (or .cse16 .cse31) 0 v_~y$w_buff1_used~0_872)) (.cse7 (not .cse4))) (let ((.cse23 (and .cse7 .cse30)) (.cse28 (= (mod .cse24 256) 0))) (let ((.cse9 (ite (or .cse23 (and (not .cse28) .cse29)) 0 v_~y$r_buff1_thd0~0_387))) (let ((.cse11 (= (mod .cse9 256) 0))) (let ((.cse2 (and .cse4 .cse11)) (.cse25 (and .cse4 .cse28))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_284 256) 0))) (.cse22 (or .cse27 .cse2 .cse25))) (let ((.cse19 (ite .cse0 .cse26 (ite .cse22 .cse26 (ite .cse23 0 .cse26))))) (let ((.cse3 (= (mod .cse19 256) 0))) (let ((.cse20 (ite .cse0 .cse24 (ite (or .cse2 .cse3 .cse25) .cse24 0)))) (let ((.cse5 (= (mod .cse20 256) 0)) (.cse13 (not (= (mod v_~y$r_buff1_thd1~0_353 256) 0))) (.cse14 (not (= (mod v_~y$w_buff0_used~0_947 256) 0))) (.cse6 (not .cse3)) (.cse21 (not (= (mod v_~y$r_buff0_thd1~0_352 256) 0)))) (let ((.cse12 (ite .cse22 v_~y$mem_tmp~0_254 (ite .cse23 v_~y$w_buff0~0_652 v_~y$w_buff1~0_592))) (.cse17 (and .cse6 .cse21)) (.cse8 (and .cse21 .cse14)) (.cse18 (and (not .cse5) .cse13))) (and (= v_~y$r_buff0_thd0~0_394 (ite .cse0 .cse1 (ite (or .cse2 .cse3 (and .cse4 .cse5)) .cse1 (ite (and .cse6 .cse7) 0 .cse1)))) (= v_~y$r_buff0_thd1~0_351 (ite .cse8 0 v_~y$r_buff0_thd1~0_352)) (= v_~y$r_buff1_thd0~0_386 (ite .cse0 .cse9 (ite (let ((.cse10 (= (mod v_~y$r_buff0_thd0~0_394 256) 0))) (or (and .cse10 .cse11) (and .cse10 .cse5) .cse3)) .cse9 0))) (= |v_ULTIMATE.start_main_#t~nondet14#1_235| v_~weak$$choice2~0_284) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_109| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_465 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_110) (= v_~weak$$choice0~0_223 |v_ULTIMATE.start_main_#t~nondet13#1_223|) (= v_~y$w_buff1~0_592 v_~y$w_buff1~0_591) (= v_~y$flush_delayed~0_273 0) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EAX~0_170 1) (= 2 .cse12) (= v_~__unbuffered_p0_EAX~0_170 1) (= v_~__unbuffered_p2_EBX~0_182 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_128) (= v_~y$r_buff1_thd1~0_352 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_870 256) 0)) .cse13) (and (not (= (mod v_~y$r_buff0_thd1~0_351 256) 0)) .cse14)) 0 v_~y$r_buff1_thd1~0_353)) (= (ite .cse15 v_~y$w_buff0~0_652 (ite .cse16 v_~y$w_buff1~0_592 v_~y~0_859)) v_~y$mem_tmp~0_254) (= v_~y$w_buff0~0_652 v_~y$w_buff0~0_651) (= v_~y~0_857 (ite .cse17 v_~y$w_buff0~0_651 (ite .cse18 v_~y$w_buff1~0_591 (ite .cse0 v_~y$mem_tmp~0_254 .cse12)))) (= v_~y$w_buff0_used~0_947 (ite .cse17 0 .cse19)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_101| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_109|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_101| (mod v_~main$tmp_guard1~0_128 256)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77| (mod v_~main$tmp_guard0~0_110 256)) (= (ite (or .cse8 .cse18) 0 .cse20) v_~y$w_buff1_used~0_870))))))))))))))))))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_182, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_949, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_235|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_353, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_170, ~y$w_buff1~0=v_~y$w_buff1~0_592, ~y$w_buff0~0=v_~y$w_buff0~0_652, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_395, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_352, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_223|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_170, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_465, ~y~0=v_~y~0_859, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_387, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_872} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_109|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_947, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_128, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_103|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_352, ~y$mem_tmp~0=v_~y$mem_tmp~0_254, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_170, ~y$w_buff0~0=v_~y$w_buff0~0_651, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_91|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_351, ~y$flush_delayed~0=v_~y$flush_delayed~0_273, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_170, ~y~0=v_~y~0_857, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_182, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_109|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_110, ~weak$$choice0~0=v_~weak$$choice0~0_223, ~y$w_buff1~0=v_~y$w_buff1~0_591, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_101|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_394, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_465, ~weak$$choice2~0=v_~weak$$choice2~0_284, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_386, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_870, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~nondet14#1, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~nondet13#1, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [467] $Ultimate##0-->L745: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~y~0_240 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_240, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~y~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 00:53:29,005 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:53:29,006 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5099 [2022-12-13 00:53:29,006 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 398 flow [2022-12-13 00:53:29,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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:53:29,006 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:29,006 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:29,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 00:53:29,006 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:53:29,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:29,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1348482211, now seen corresponding path program 1 times [2022-12-13 00:53:29,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:29,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500758076] [2022-12-13 00:53:29,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:29,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:29,833 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:53:29,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:29,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500758076] [2022-12-13 00:53:29,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500758076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:29,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:29,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:53:29,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580678511] [2022-12-13 00:53:29,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:29,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:53:29,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:29,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:53:29,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:53:29,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-13 00:53:29,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 398 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:29,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:29,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-13 00:53:29,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:30,011 INFO L130 PetriNetUnfolder]: 216/429 cut-off events. [2022-12-13 00:53:30,011 INFO L131 PetriNetUnfolder]: For 2970/2986 co-relation queries the response was YES. [2022-12-13 00:53:30,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 429 events. 216/429 cut-off events. For 2970/2986 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 2201 event pairs, 4 based on Foata normal form. 70/374 useless extension candidates. Maximal degree in co-relation 1822. Up to 177 conditions per place. [2022-12-13 00:53:30,013 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 0 selfloop transitions, 0 changer transitions 65/65 dead transitions. [2022-12-13 00:53:30,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 65 transitions, 571 flow [2022-12-13 00:53:30,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:53:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:53:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-13 00:53:30,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3735632183908046 [2022-12-13 00:53:30,014 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 398 flow. Second operand 6 states and 65 transitions. [2022-12-13 00:53:30,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 65 transitions, 571 flow [2022-12-13 00:53:30,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 65 transitions, 359 flow, removed 38 selfloop flow, removed 21 redundant places. [2022-12-13 00:53:30,017 INFO L231 Difference]: Finished difference. Result has 42 places, 0 transitions, 0 flow [2022-12-13 00:53:30,017 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=42, PETRI_TRANSITIONS=0} [2022-12-13 00:53:30,017 INFO L295 CegarLoopForPetriNet]: 72 programPoint places, -30 predicate places. [2022-12-13 00:53:30,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:30,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 0 transitions, 0 flow [2022-12-13 00:53:30,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 00:53:30,018 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 00:53:30,018 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:53:30,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 00:53:30,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 00:53:30,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 00:53:30,018 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:30,018 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 00:53:30,019 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 00:53:30,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:30,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:53:30,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:53:30,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:53:30,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:53:30,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:53:30,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:53:30,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 00:53:30,023 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:30,026 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:53:30,027 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:53:30,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:53:30 BasicIcfg [2022-12-13 00:53:30,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:53:30,029 INFO L158 Benchmark]: Toolchain (without parser) took 40143.01ms. Allocated memory was 179.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 152.5MB in the beginning and 832.9MB in the end (delta: -680.4MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-13 00:53:30,030 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 109.5MB in the beginning and 109.4MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:53:30,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.48ms. Allocated memory is still 179.3MB. Free memory was 152.5MB in the beginning and 149.3MB in the end (delta: 3.2MB). Peak memory consumption was 28.0MB. Max. memory is 8.0GB. [2022-12-13 00:53:30,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.61ms. Allocated memory is still 179.3MB. Free memory was 149.3MB in the beginning and 146.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:53:30,030 INFO L158 Benchmark]: Boogie Preprocessor took 49.87ms. Allocated memory is still 179.3MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:53:30,030 INFO L158 Benchmark]: RCFGBuilder took 787.58ms. Allocated memory is still 179.3MB. Free memory was 144.5MB in the beginning and 133.2MB in the end (delta: 11.3MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. [2022-12-13 00:53:30,031 INFO L158 Benchmark]: TraceAbstraction took 38611.03ms. Allocated memory was 179.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 132.1MB in the beginning and 832.9MB in the end (delta: -700.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-13 00:53:30,032 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 109.5MB in the beginning and 109.4MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 634.48ms. Allocated memory is still 179.3MB. Free memory was 152.5MB in the beginning and 149.3MB in the end (delta: 3.2MB). Peak memory consumption was 28.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.61ms. Allocated memory is still 179.3MB. Free memory was 149.3MB in the beginning and 146.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.87ms. Allocated memory is still 179.3MB. Free memory was 146.6MB in the beginning and 144.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 787.58ms. Allocated memory is still 179.3MB. Free memory was 144.5MB in the beginning and 133.2MB in the end (delta: 11.3MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. * TraceAbstraction took 38611.03ms. Allocated memory was 179.3MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 132.1MB in the beginning and 832.9MB in the end (delta: -700.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 114 PlacesBefore, 72 PlacesAfterwards, 106 TransitionsBefore, 63 TransitionsAfterwards, 2022 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3019, independent: 2892, independent conditional: 2892, independent unconditional: 0, dependent: 127, dependent conditional: 127, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3019, independent: 2892, independent conditional: 0, independent unconditional: 2892, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3019, independent: 2892, independent conditional: 0, independent unconditional: 2892, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3019, independent: 2892, independent conditional: 0, independent unconditional: 2892, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1819, independent: 1761, independent conditional: 0, independent unconditional: 1761, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1819, independent: 1746, independent conditional: 0, independent unconditional: 1746, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 442, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 417, dependent conditional: 0, dependent unconditional: 417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3019, independent: 1131, independent conditional: 0, independent unconditional: 1131, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 1819, unknown conditional: 0, unknown unconditional: 1819] , Statistics on independence cache: Total cache size (in pairs): 3487, Positive cache size: 3429, Positive conditional cache size: 0, Positive unconditional cache size: 3429, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 223, independent: 187, independent conditional: 187, 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: 223, independent: 187, independent conditional: 11, independent unconditional: 176, dependent: 36, dependent conditional: 9, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 223, independent: 187, independent conditional: 11, independent unconditional: 176, dependent: 36, dependent conditional: 9, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 223, independent: 187, independent conditional: 11, independent unconditional: 176, dependent: 36, dependent conditional: 9, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 191, independent: 165, independent conditional: 10, independent unconditional: 155, dependent: 26, dependent conditional: 6, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 191, independent: 159, independent conditional: 0, independent unconditional: 159, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 26, dependent conditional: 6, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 51, dependent conditional: 21, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 223, independent: 22, independent conditional: 1, independent unconditional: 21, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 191, unknown conditional: 16, unknown unconditional: 175] , Statistics on independence cache: Total cache size (in pairs): 191, Positive cache size: 165, Positive conditional cache size: 10, Positive unconditional cache size: 155, Negative cache size: 26, Negative conditional cache size: 6, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 43 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 612 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 181, independent: 147, independent conditional: 147, 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: 181, independent: 147, independent conditional: 11, independent unconditional: 136, dependent: 34, dependent conditional: 1, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 181, independent: 147, independent conditional: 0, independent unconditional: 147, 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: 181, independent: 147, independent conditional: 0, independent unconditional: 147, 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: 41, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 41, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 90, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 181, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 41, unknown conditional: 0, unknown unconditional: 41] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 193, Positive conditional cache size: 10, Positive unconditional cache size: 183, Negative cache size: 39, Negative conditional cache size: 6, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 608 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 183, independent: 150, independent conditional: 1, independent unconditional: 149, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 183, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 183, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 33, dependent conditional: 0, dependent unconditional: 33, 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: 183, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 193, Positive conditional cache size: 10, Positive unconditional cache size: 183, Negative cache size: 39, Negative conditional cache size: 6, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 49 PlacesBefore, 48 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 720 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 357, independent: 329, independent conditional: 329, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 357, independent: 329, independent conditional: 106, independent unconditional: 223, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 357, independent: 329, independent conditional: 42, independent unconditional: 287, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 357, independent: 329, independent conditional: 42, independent unconditional: 287, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 357, independent: 306, independent conditional: 42, independent unconditional: 264, dependent: 27, dependent conditional: 2, dependent unconditional: 25, unknown: 24, unknown conditional: 1, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 249, Positive conditional cache size: 10, Positive unconditional cache size: 239, Negative cache size: 40, Negative conditional cache size: 7, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 64, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 68, independent conditional: 6, independent unconditional: 62, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 68, independent conditional: 2, independent unconditional: 66, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 68, independent conditional: 2, independent unconditional: 66, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 58, independent conditional: 2, independent unconditional: 56, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 259, Positive conditional cache size: 10, Positive unconditional cache size: 249, Negative cache size: 41, Negative conditional cache size: 7, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 54 PlacesBefore, 53 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 684 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 280, independent: 263, independent conditional: 263, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 280, independent: 263, independent conditional: 96, independent unconditional: 167, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 280, independent: 263, independent conditional: 67, independent unconditional: 196, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 280, independent: 263, independent conditional: 67, independent unconditional: 196, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 6, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 280, independent: 238, independent conditional: 61, independent unconditional: 177, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 25, unknown conditional: 6, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 320, Positive conditional cache size: 16, Positive unconditional cache size: 304, Negative cache size: 41, Negative conditional cache size: 7, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 57 PlacesBefore, 57 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 762 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 270, independent: 246, independent conditional: 246, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 270, independent: 246, independent conditional: 96, independent unconditional: 150, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 270, independent: 246, independent conditional: 43, independent unconditional: 203, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 270, independent: 246, independent conditional: 43, independent unconditional: 203, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 270, independent: 239, independent conditional: 42, independent unconditional: 197, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 9, unknown conditional: 1, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 395, Positive cache size: 352, Positive conditional cache size: 17, Positive unconditional cache size: 335, Negative cache size: 43, Negative conditional cache size: 7, 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, 61 PlacesBefore, 60 PlacesAfterwards, 59 TransitionsBefore, 58 TransitionsAfterwards, 800 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 131, independent: 109, independent conditional: 109, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 131, independent: 109, independent conditional: 67, independent unconditional: 42, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 131, independent: 109, independent conditional: 50, independent unconditional: 59, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 131, independent: 109, independent conditional: 50, independent unconditional: 59, dependent: 22, dependent conditional: 0, dependent unconditional: 22, 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: 131, independent: 109, independent conditional: 50, independent unconditional: 59, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 360, Positive conditional cache size: 17, Positive unconditional cache size: 343, Negative cache size: 43, Negative conditional cache size: 7, Negative unconditional cache size: 36, 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.1s, 58 PlacesBefore, 58 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 788 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 38, independent conditional: 16, independent unconditional: 22, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 38, independent conditional: 15, independent unconditional: 23, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 38, independent conditional: 15, independent unconditional: 23, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 36, independent conditional: 15, independent unconditional: 21, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 409, Positive cache size: 365, Positive conditional cache size: 17, Positive unconditional cache size: 348, Negative cache size: 44, Negative conditional cache size: 7, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 411, Positive cache size: 366, Positive conditional cache size: 17, Positive unconditional cache size: 349, Negative cache size: 45, Negative conditional cache size: 7, Negative unconditional cache size: 38, 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: 2.0s, 61 PlacesBefore, 58 PlacesAfterwards, 67 TransitionsBefore, 64 TransitionsAfterwards, 724 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 46, independent conditional: 28, independent unconditional: 18, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 18, dependent conditional: 0, dependent unconditional: 18, 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: 64, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 375, Positive conditional cache size: 17, Positive unconditional cache size: 358, Negative cache size: 45, Negative conditional cache size: 7, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 375, Positive conditional cache size: 17, Positive unconditional cache size: 358, Negative cache size: 45, Negative conditional cache size: 7, Negative unconditional cache size: 38, 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, 69 PlacesBefore, 69 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 832 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 375, Positive conditional cache size: 17, Positive unconditional cache size: 358, Negative cache size: 45, Negative conditional cache size: 7, Negative unconditional cache size: 38, 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: 1.7s, 68 PlacesBefore, 66 PlacesAfterwards, 73 TransitionsBefore, 71 TransitionsAfterwards, 820 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, independent: 77, independent conditional: 77, 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: 77, independent: 77, independent conditional: 77, 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: 77, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 77, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 465, Positive cache size: 420, Positive conditional cache size: 29, Positive unconditional cache size: 391, Negative cache size: 45, Negative conditional cache size: 7, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 465, Positive cache size: 420, Positive conditional cache size: 29, Positive unconditional cache size: 391, Negative cache size: 45, Negative conditional cache size: 7, Negative unconditional cache size: 38, 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, 68 PlacesBefore, 68 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 840 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 465, Positive cache size: 420, Positive conditional cache size: 29, Positive unconditional cache size: 391, Negative cache size: 45, Negative conditional cache size: 7, Negative unconditional cache size: 38, 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: 1.0s, 72 PlacesBefore, 72 PlacesAfterwards, 84 TransitionsBefore, 82 TransitionsAfterwards, 884 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 79, independent conditional: 79, 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: 79, independent: 79, independent conditional: 79, 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: 79, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 435, Positive conditional cache size: 38, Positive unconditional cache size: 397, Negative cache size: 45, Negative conditional cache size: 7, Negative unconditional cache size: 38, 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: 5.1s, 65 PlacesBefore, 62 PlacesAfterwards, 43 TransitionsBefore, 44 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, independent: 106, independent conditional: 106, 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: 106, independent: 106, independent conditional: 100, independent unconditional: 6, 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: 106, independent: 106, independent conditional: 77, independent unconditional: 29, 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: 106, independent: 106, independent conditional: 77, independent unconditional: 29, 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: 24, independent: 24, independent conditional: 16, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, independent: 82, independent conditional: 61, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 16, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 497, Positive conditional cache size: 54, Positive unconditional cache size: 443, Negative cache size: 45, Negative conditional cache size: 7, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 497, Positive conditional cache size: 54, Positive unconditional cache size: 443, Negative cache size: 45, Negative conditional cache size: 7, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 38.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 735 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 735 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 293 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2344 IncrementalHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 293 mSolverCounterUnsat, 3 mSDtfsCounter, 2344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=794occurred in iteration=17, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 2434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 00:53:30,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...