/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/safe024_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:50,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:52:50,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:52:50,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:52:50,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:52:50,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:52:50,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:52:50,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:52:50,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:52:50,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:52:50,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:52:50,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:52:50,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:52:50,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:52:50,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:52:50,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:52:50,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:52:50,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:52:50,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:52:50,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:52:50,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:52:50,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:52:50,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:52:50,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:52:50,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:52:50,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:52:50,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:52:50,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:52:50,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:52:50,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:52:50,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:52:50,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:52:50,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:52:50,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:52:50,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:52:50,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:52:50,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:52:50,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:52:50,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:52:50,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:52:50,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:52:50,364 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:50,389 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:52:50,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:52:50,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:52:50,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:52:50,391 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:52:50,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:52:50,392 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:52:50,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:52:50,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:52:50,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:52:50,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:52:50,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:52:50,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:52:50,393 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:52:50,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:52:50,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:52:50,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:52:50,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:52:50,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:52:50,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:52:50,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:52:50,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:52:50,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:52:50,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:52:50,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:52:50,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:52:50,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:52:50,395 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:52:50,395 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:50,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:52:50,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:52:50,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:52:50,664 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:52:50,664 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:52:50,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:52:51,685 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:52:51,948 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:52:51,949 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:52:51,967 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbcbf7c52/af1de78d15724f4994216f364d44f60d/FLAG17bc5d1f1 [2022-12-13 00:52:51,986 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbcbf7c52/af1de78d15724f4994216f364d44f60d [2022-12-13 00:52:51,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:52:51,990 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:52:51,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:52:51,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:52:51,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:52:51,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:52:51" (1/1) ... [2022-12-13 00:52:51,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27757636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:51, skipping insertion in model container [2022-12-13 00:52:51,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:52:51" (1/1) ... [2022-12-13 00:52:52,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:52:52,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:52:52,228 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 00:52:52,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:52:52,409 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:52:52,417 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 00:52:52,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:52:52,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:52:52,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:52:52,498 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:52:52,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:52 WrapperNode [2022-12-13 00:52:52,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:52:52,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:52:52,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:52:52,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:52:52,505 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:52" (1/1) ... [2022-12-13 00:52:52,520 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:52" (1/1) ... [2022-12-13 00:52:52,544 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-12-13 00:52:52,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:52:52,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:52:52,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:52:52,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:52:52,554 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:52" (1/1) ... [2022-12-13 00:52:52,554 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:52" (1/1) ... [2022-12-13 00:52:52,557 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:52" (1/1) ... [2022-12-13 00:52:52,557 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:52" (1/1) ... [2022-12-13 00:52:52,563 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:52" (1/1) ... [2022-12-13 00:52:52,564 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:52" (1/1) ... [2022-12-13 00:52:52,566 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:52" (1/1) ... [2022-12-13 00:52:52,567 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:52" (1/1) ... [2022-12-13 00:52:52,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:52:52,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:52:52,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:52:52,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:52:52,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:52" (1/1) ... [2022-12-13 00:52:52,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:52:52,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:52:52,615 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:52,638 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:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:52:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:52:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:52:52,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:52:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:52:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:52:52,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:52:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:52:52,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:52:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:52:52,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:52:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:52:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:52:52,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:52:52,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:52:52,652 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:52,819 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:52:52,820 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:52:53,102 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:52:53,201 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:52:53,201 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:52:53,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:53 BoogieIcfgContainer [2022-12-13 00:52:53,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:52:53,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:52:53,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:52:53,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:52:53,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:52:51" (1/3) ... [2022-12-13 00:52:53,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112c27e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:52:53, skipping insertion in model container [2022-12-13 00:52:53,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:52:52" (2/3) ... [2022-12-13 00:52:53,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112c27e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:52:53, skipping insertion in model container [2022-12-13 00:52:53,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:52:53" (3/3) ... [2022-12-13 00:52:53,210 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:52:53,224 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:52:53,225 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:52:53,225 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:52:53,270 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:52:53,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 00:52:53,351 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 00:52:53,351 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:53,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 00:52:53,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 00:52:53,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-13 00:52:53,362 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:53,378 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 00:52:53,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-13 00:52:53,419 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 00:52:53,419 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:53,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 00:52:53,423 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 00:52:53,423 INFO L226 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-13 00:52:57,440 INFO L241 LiptonReduction]: Total number of compositions: 85 [2022-12-13 00:52:57,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:52:57,454 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;@40490368, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:52:57,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:52:57,466 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-13 00:52:57,466 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:57,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:57,467 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:52:57,467 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:57,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:57,471 INFO L85 PathProgramCache]: Analyzing trace with hash 463088845, now seen corresponding path program 1 times [2022-12-13 00:52:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:57,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022759532] [2022-12-13 00:52:57,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:57,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:57,719 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:57,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:57,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022759532] [2022-12-13 00:52:57,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022759532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:57,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:57,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:52:57,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804874889] [2022-12-13 00:52:57,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:57,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:52:57,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:57,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:52:57,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:52:57,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 60 [2022-12-13 00:52:57,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:57,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:57,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 60 [2022-12-13 00:52:57,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:58,735 INFO L130 PetriNetUnfolder]: 7624/12014 cut-off events. [2022-12-13 00:52:58,735 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 00:52:58,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22991 conditions, 12014 events. 7624/12014 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 83455 event pairs, 2133 based on Foata normal form. 0/7312 useless extension candidates. Maximal degree in co-relation 22980. Up to 9237 conditions per place. [2022-12-13 00:52:58,769 INFO L137 encePairwiseOnDemand]: 55/60 looper letters, 32 selfloop transitions, 2 changer transitions 50/95 dead transitions. [2022-12-13 00:52:58,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 95 transitions, 370 flow [2022-12-13 00:52:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:52:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:52:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-12-13 00:52:58,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2022-12-13 00:52:58,778 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 129 flow. Second operand 3 states and 122 transitions. [2022-12-13 00:52:58,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 95 transitions, 370 flow [2022-12-13 00:52:58,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 95 transitions, 366 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:52:58,783 INFO L231 Difference]: Finished difference. Result has 66 places, 32 transitions, 74 flow [2022-12-13 00:52:58,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=66, PETRI_TRANSITIONS=32} [2022-12-13 00:52:58,786 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2022-12-13 00:52:58,787 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:58,787 INFO L89 Accepts]: Start accepts. Operand has 66 places, 32 transitions, 74 flow [2022-12-13 00:52:58,789 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:58,789 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:58,789 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 32 transitions, 74 flow [2022-12-13 00:52:58,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2022-12-13 00:52:58,793 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 00:52:58,793 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:58,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 75 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:52:58,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 74 flow [2022-12-13 00:52:58,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-13 00:52:58,912 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:58,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 00:52:58,914 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2022-12-13 00:52:58,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:52:58,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:58,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:58,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:52:58,916 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:52:58,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:58,916 INFO L85 PathProgramCache]: Analyzing trace with hash 912458532, now seen corresponding path program 1 times [2022-12-13 00:52:58,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:58,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680964112] [2022-12-13 00:52:58,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:58,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:59,069 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,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:59,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680964112] [2022-12-13 00:52:59,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680964112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:59,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:59,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:52:59,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539532295] [2022-12-13 00:52:59,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:59,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:52:59,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:59,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:52:59,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:52:59,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:52:59,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 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:52:59,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:59,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:52:59,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:59,333 INFO L130 PetriNetUnfolder]: 1399/2309 cut-off events. [2022-12-13 00:52:59,333 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-12-13 00:52:59,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4565 conditions, 2309 events. 1399/2309 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 12577 event pairs, 299 based on Foata normal form. 0/1817 useless extension candidates. Maximal degree in co-relation 4555. Up to 1676 conditions per place. [2022-12-13 00:52:59,344 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 29 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2022-12-13 00:52:59,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 164 flow [2022-12-13 00:52:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:52:59,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:52:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 00:52:59,346 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:52:59,346 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 3 states and 64 transitions. [2022-12-13 00:52:59,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 164 flow [2022-12-13 00:52:59,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:52:59,347 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 76 flow [2022-12-13 00:52:59,347 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2022-12-13 00:52:59,348 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -27 predicate places. [2022-12-13 00:52:59,348 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:59,348 INFO L89 Accepts]: Start accepts. Operand has 42 places, 31 transitions, 76 flow [2022-12-13 00:52:59,349 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:59,349 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:59,349 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 76 flow [2022-12-13 00:52:59,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 76 flow [2022-12-13 00:52:59,352 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 00:52:59,352 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:52:59,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 70 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:52:59,353 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 76 flow [2022-12-13 00:52:59,353 INFO L226 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-13 00:52:59,366 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:52:59,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 00:52:59,367 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 76 flow [2022-12-13 00:52:59,367 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:52:59,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:59,367 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:59,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:52:59,367 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:52:59,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:59,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1778556934, now seen corresponding path program 1 times [2022-12-13 00:52:59,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:59,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026309985] [2022-12-13 00:52:59,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:59,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:52:59,451 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,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:52:59,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026309985] [2022-12-13 00:52:59,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026309985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:52:59,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:52:59,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:52:59,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880657776] [2022-12-13 00:52:59,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:52:59,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:52:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:52:59,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:52:59,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:52:59,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 00:52:59,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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:52:59,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:52:59,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 00:52:59,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:52:59,705 INFO L130 PetriNetUnfolder]: 1708/2803 cut-off events. [2022-12-13 00:52:59,705 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2022-12-13 00:52:59,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5689 conditions, 2803 events. 1708/2803 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 15794 event pairs, 360 based on Foata normal form. 120/2410 useless extension candidates. Maximal degree in co-relation 5678. Up to 1037 conditions per place. [2022-12-13 00:52:59,716 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 36 selfloop transitions, 3 changer transitions 7/55 dead transitions. [2022-12-13 00:52:59,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 221 flow [2022-12-13 00:52:59,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:52:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:52:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-13 00:52:59,720 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2022-12-13 00:52:59,721 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 76 flow. Second operand 4 states and 84 transitions. [2022-12-13 00:52:59,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 221 flow [2022-12-13 00:52:59,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:52:59,722 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 86 flow [2022-12-13 00:52:59,723 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2022-12-13 00:52:59,724 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -25 predicate places. [2022-12-13 00:52:59,724 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:52:59,724 INFO L89 Accepts]: Start accepts. Operand has 44 places, 31 transitions, 86 flow [2022-12-13 00:52:59,725 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:52:59,726 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:52:59,726 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 86 flow [2022-12-13 00:52:59,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 31 transitions, 86 flow [2022-12-13 00:52:59,729 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 00:52:59,729 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 00:52:59,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 31 events. 0/31 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 64 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:52:59,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 31 transitions, 86 flow [2022-12-13 00:52:59,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 482 [2022-12-13 00:52:59,831 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:52:59,832 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 00:52:59,833 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 84 flow [2022-12-13 00:52:59,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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:52:59,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:52:59,833 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:52:59,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:52:59,833 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:52:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:52:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1856445360, now seen corresponding path program 1 times [2022-12-13 00:52:59,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:52:59,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547047237] [2022-12-13 00:52:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:52:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:52:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:00,008 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:00,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:00,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547047237] [2022-12-13 00:53:00,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547047237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:00,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:00,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:53:00,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132779612] [2022-12-13 00:53:00,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:00,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:53:00,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:00,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:53:00,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:53:00,011 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2022-12-13 00:53:00,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 84 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:00,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:00,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2022-12-13 00:53:00,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:00,245 INFO L130 PetriNetUnfolder]: 1689/2639 cut-off events. [2022-12-13 00:53:00,245 INFO L131 PetriNetUnfolder]: For 819/819 co-relation queries the response was YES. [2022-12-13 00:53:00,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6144 conditions, 2639 events. 1689/2639 cut-off events. For 819/819 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 13540 event pairs, 469 based on Foata normal form. 186/1936 useless extension candidates. Maximal degree in co-relation 6131. Up to 2047 conditions per place. [2022-12-13 00:53:00,256 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 33 selfloop transitions, 10 changer transitions 31/80 dead transitions. [2022-12-13 00:53:00,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 80 transitions, 360 flow [2022-12-13 00:53:00,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:53:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:53:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-13 00:53:00,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7066666666666667 [2022-12-13 00:53:00,258 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 84 flow. Second operand 5 states and 106 transitions. [2022-12-13 00:53:00,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 80 transitions, 360 flow [2022-12-13 00:53:00,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 80 transitions, 333 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 00:53:00,261 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 162 flow [2022-12-13 00:53:00,261 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-12-13 00:53:00,262 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -23 predicate places. [2022-12-13 00:53:00,262 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:00,262 INFO L89 Accepts]: Start accepts. Operand has 46 places, 39 transitions, 162 flow [2022-12-13 00:53:00,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:00,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:00,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 39 transitions, 162 flow [2022-12-13 00:53:00,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 162 flow [2022-12-13 00:53:00,295 INFO L130 PetriNetUnfolder]: 351/621 cut-off events. [2022-12-13 00:53:00,295 INFO L131 PetriNetUnfolder]: For 171/360 co-relation queries the response was YES. [2022-12-13 00:53:00,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 621 events. 351/621 cut-off events. For 171/360 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 3588 event pairs, 189 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 1705. Up to 478 conditions per place. [2022-12-13 00:53:00,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 39 transitions, 162 flow [2022-12-13 00:53:00,299 INFO L226 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-13 00:53:00,313 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:00,314 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 00:53:00,314 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 162 flow [2022-12-13 00:53:00,315 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:00,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:00,315 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:00,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:53:00,315 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:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:00,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1120035377, now seen corresponding path program 1 times [2022-12-13 00:53:00,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:00,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616870046] [2022-12-13 00:53:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:00,414 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:00,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:00,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616870046] [2022-12-13 00:53:00,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616870046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:00,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:00,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:00,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205273114] [2022-12-13 00:53:00,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:00,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:53:00,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:00,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:53:00,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:53:00,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2022-12-13 00:53:00,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:00,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:00,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2022-12-13 00:53:00,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:00,651 INFO L130 PetriNetUnfolder]: 1021/1776 cut-off events. [2022-12-13 00:53:00,651 INFO L131 PetriNetUnfolder]: For 622/622 co-relation queries the response was YES. [2022-12-13 00:53:00,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5835 conditions, 1776 events. 1021/1776 cut-off events. For 622/622 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9694 event pairs, 127 based on Foata normal form. 165/1372 useless extension candidates. Maximal degree in co-relation 5821. Up to 1003 conditions per place. [2022-12-13 00:53:00,659 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 40 selfloop transitions, 19 changer transitions 30/95 dead transitions. [2022-12-13 00:53:00,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 95 transitions, 578 flow [2022-12-13 00:53:00,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:53:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:53:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2022-12-13 00:53:00,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7055555555555556 [2022-12-13 00:53:00,661 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 162 flow. Second operand 6 states and 127 transitions. [2022-12-13 00:53:00,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 95 transitions, 578 flow [2022-12-13 00:53:00,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 95 transitions, 566 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:53:00,671 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 302 flow [2022-12-13 00:53:00,672 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2022-12-13 00:53:00,672 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -19 predicate places. [2022-12-13 00:53:00,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:00,672 INFO L89 Accepts]: Start accepts. Operand has 50 places, 48 transitions, 302 flow [2022-12-13 00:53:00,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:00,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:00,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 48 transitions, 302 flow [2022-12-13 00:53:00,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 48 transitions, 302 flow [2022-12-13 00:53:00,697 INFO L130 PetriNetUnfolder]: 243/486 cut-off events. [2022-12-13 00:53:00,697 INFO L131 PetriNetUnfolder]: For 726/1197 co-relation queries the response was YES. [2022-12-13 00:53:00,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2034 conditions, 486 events. 243/486 cut-off events. For 726/1197 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 2768 event pairs, 54 based on Foata normal form. 2/266 useless extension candidates. Maximal degree in co-relation 2020. Up to 361 conditions per place. [2022-12-13 00:53:00,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 48 transitions, 302 flow [2022-12-13 00:53:00,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-13 00:53:00,702 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:00,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 00:53:00,703 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 302 flow [2022-12-13 00:53:00,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:00,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:00,704 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:00,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:53:00,704 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:00,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:00,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2144225461, now seen corresponding path program 1 times [2022-12-13 00:53:00,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:00,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37685920] [2022-12-13 00:53:00,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:00,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:00,887 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:00,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:00,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37685920] [2022-12-13 00:53:00,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37685920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:00,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:00,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:53:00,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679676908] [2022-12-13 00:53:00,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:00,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:53:00,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:00,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:53:00,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:53:00,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2022-12-13 00:53:00,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:00,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:00,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2022-12-13 00:53:00,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:01,083 INFO L130 PetriNetUnfolder]: 499/981 cut-off events. [2022-12-13 00:53:01,083 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2022-12-13 00:53:01,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3975 conditions, 981 events. 499/981 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5159 event pairs, 46 based on Foata normal form. 99/769 useless extension candidates. Maximal degree in co-relation 3958. Up to 550 conditions per place. [2022-12-13 00:53:01,091 INFO L137 encePairwiseOnDemand]: 18/30 looper letters, 31 selfloop transitions, 28 changer transitions 15/80 dead transitions. [2022-12-13 00:53:01,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 80 transitions, 603 flow [2022-12-13 00:53:01,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:53:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:53:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2022-12-13 00:53:01,093 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5619047619047619 [2022-12-13 00:53:01,093 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 302 flow. Second operand 7 states and 118 transitions. [2022-12-13 00:53:01,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 80 transitions, 603 flow [2022-12-13 00:53:01,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 500 flow, removed 39 selfloop flow, removed 5 redundant places. [2022-12-13 00:53:01,119 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 300 flow [2022-12-13 00:53:01,119 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2022-12-13 00:53:01,121 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -17 predicate places. [2022-12-13 00:53:01,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:01,121 INFO L89 Accepts]: Start accepts. Operand has 52 places, 48 transitions, 300 flow [2022-12-13 00:53:01,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:01,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:01,122 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 48 transitions, 300 flow [2022-12-13 00:53:01,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 300 flow [2022-12-13 00:53:01,141 INFO L130 PetriNetUnfolder]: 81/243 cut-off events. [2022-12-13 00:53:01,141 INFO L131 PetriNetUnfolder]: For 271/445 co-relation queries the response was YES. [2022-12-13 00:53:01,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 243 events. 81/243 cut-off events. For 271/445 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1261 event pairs, 0 based on Foata normal form. 1/130 useless extension candidates. Maximal degree in co-relation 948. Up to 163 conditions per place. [2022-12-13 00:53:01,143 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 48 transitions, 300 flow [2022-12-13 00:53:01,143 INFO L226 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-13 00:53:01,579 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:53:01,580 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 459 [2022-12-13 00:53:01,580 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 294 flow [2022-12-13 00:53:01,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:53:01,580 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:01,580 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:01,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:53:01,580 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:01,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:01,580 INFO L85 PathProgramCache]: Analyzing trace with hash -786076998, now seen corresponding path program 1 times [2022-12-13 00:53:01,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:01,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836683755] [2022-12-13 00:53:01,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:01,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:01,778 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:01,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:01,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836683755] [2022-12-13 00:53:01,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836683755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:01,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:01,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:53:01,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343953378] [2022-12-13 00:53:01,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:01,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:53:01,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:01,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:53:01,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:53:01,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2022-12-13 00:53:01,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 294 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:01,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:01,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2022-12-13 00:53:01,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:01,892 INFO L130 PetriNetUnfolder]: 480/883 cut-off events. [2022-12-13 00:53:01,892 INFO L131 PetriNetUnfolder]: For 1781/1850 co-relation queries the response was YES. [2022-12-13 00:53:01,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3613 conditions, 883 events. 480/883 cut-off events. For 1781/1850 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4697 event pairs, 10 based on Foata normal form. 70/749 useless extension candidates. Maximal degree in co-relation 3596. Up to 466 conditions per place. [2022-12-13 00:53:01,896 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 57 selfloop transitions, 5 changer transitions 16/92 dead transitions. [2022-12-13 00:53:01,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 92 transitions, 732 flow [2022-12-13 00:53:01,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:53:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:53:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 00:53:01,898 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2022-12-13 00:53:01,898 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 294 flow. Second operand 5 states and 91 transitions. [2022-12-13 00:53:01,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 92 transitions, 732 flow [2022-12-13 00:53:01,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 92 transitions, 558 flow, removed 48 selfloop flow, removed 6 redundant places. [2022-12-13 00:53:01,911 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 228 flow [2022-12-13 00:53:01,911 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2022-12-13 00:53:01,911 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -21 predicate places. [2022-12-13 00:53:01,911 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:01,911 INFO L89 Accepts]: Start accepts. Operand has 48 places, 48 transitions, 228 flow [2022-12-13 00:53:01,912 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:01,912 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:01,915 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 48 transitions, 228 flow [2022-12-13 00:53:01,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 48 transitions, 228 flow [2022-12-13 00:53:01,927 INFO L130 PetriNetUnfolder]: 100/235 cut-off events. [2022-12-13 00:53:01,928 INFO L131 PetriNetUnfolder]: For 219/228 co-relation queries the response was YES. [2022-12-13 00:53:01,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 235 events. 100/235 cut-off events. For 219/228 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1253 event pairs, 0 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 649. Up to 118 conditions per place. [2022-12-13 00:53:01,930 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 48 transitions, 228 flow [2022-12-13 00:53:01,930 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 00:53:01,931 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:53:01,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 00:53:01,933 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 228 flow [2022-12-13 00:53:01,933 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:01,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:01,933 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:01,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:53:01,934 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:01,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1063397124, now seen corresponding path program 2 times [2022-12-13 00:53:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:01,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912946070] [2022-12-13 00:53:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:02,105 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,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:02,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912946070] [2022-12-13 00:53:02,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912946070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:02,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:02,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:53:02,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882395521] [2022-12-13 00:53:02,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:02,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:53:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:02,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:53:02,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:53:02,108 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2022-12-13 00:53:02,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 228 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:02,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:02,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2022-12-13 00:53:02,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:02,232 INFO L130 PetriNetUnfolder]: 469/875 cut-off events. [2022-12-13 00:53:02,232 INFO L131 PetriNetUnfolder]: For 998/1041 co-relation queries the response was YES. [2022-12-13 00:53:02,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2892 conditions, 875 events. 469/875 cut-off events. For 998/1041 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4630 event pairs, 36 based on Foata normal form. 58/729 useless extension candidates. Maximal degree in co-relation 2875. Up to 394 conditions per place. [2022-12-13 00:53:02,236 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 41 selfloop transitions, 3 changer transitions 39/95 dead transitions. [2022-12-13 00:53:02,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 95 transitions, 606 flow [2022-12-13 00:53:02,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:53:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:53:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-13 00:53:02,237 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-13 00:53:02,238 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 228 flow. Second operand 6 states and 102 transitions. [2022-12-13 00:53:02,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 95 transitions, 606 flow [2022-12-13 00:53:02,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 95 transitions, 606 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:53:02,243 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 213 flow [2022-12-13 00:53:02,243 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-13 00:53:02,243 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -15 predicate places. [2022-12-13 00:53:02,243 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:02,243 INFO L89 Accepts]: Start accepts. Operand has 54 places, 43 transitions, 213 flow [2022-12-13 00:53:02,244 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:02,244 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:02,244 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 213 flow [2022-12-13 00:53:02,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 43 transitions, 213 flow [2022-12-13 00:53:02,255 INFO L130 PetriNetUnfolder]: 81/186 cut-off events. [2022-12-13 00:53:02,255 INFO L131 PetriNetUnfolder]: For 307/310 co-relation queries the response was YES. [2022-12-13 00:53:02,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 186 events. 81/186 cut-off events. For 307/310 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 916 event pairs, 0 based on Foata normal form. 1/87 useless extension candidates. Maximal degree in co-relation 537. Up to 109 conditions per place. [2022-12-13 00:53:02,256 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 43 transitions, 213 flow [2022-12-13 00:53:02,256 INFO L226 LiptonReduction]: Number of co-enabled transitions 256 [2022-12-13 00:53:02,565 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:53:02,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 322 [2022-12-13 00:53:02,565 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 211 flow [2022-12-13 00:53:02,565 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:02,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:02,566 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:02,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:53:02,566 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:02,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:02,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1062047519, now seen corresponding path program 1 times [2022-12-13 00:53:02,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:02,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175908552] [2022-12-13 00:53:02,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:02,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:53:02,957 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,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:53:02,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175908552] [2022-12-13 00:53:02,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175908552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:53:02,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:53:02,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:53:02,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446668096] [2022-12-13 00:53:02,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:53:02,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:53:02,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:53:02,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:53:02,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:53:02,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 00:53:02,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 211 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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:02,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:53:02,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 00:53:02,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:53:03,100 INFO L130 PetriNetUnfolder]: 267/513 cut-off events. [2022-12-13 00:53:03,101 INFO L131 PetriNetUnfolder]: For 1054/1074 co-relation queries the response was YES. [2022-12-13 00:53:03,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 513 events. 267/513 cut-off events. For 1054/1074 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2726 event pairs, 5 based on Foata normal form. 42/415 useless extension candidates. Maximal degree in co-relation 1731. Up to 202 conditions per place. [2022-12-13 00:53:03,103 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 37 selfloop transitions, 4 changer transitions 24/76 dead transitions. [2022-12-13 00:53:03,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 516 flow [2022-12-13 00:53:03,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:53:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:53:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-13 00:53:03,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2022-12-13 00:53:03,105 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 211 flow. Second operand 6 states and 73 transitions. [2022-12-13 00:53:03,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 516 flow [2022-12-13 00:53:03,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 494 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-13 00:53:03,107 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 207 flow [2022-12-13 00:53:03,108 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2022-12-13 00:53:03,109 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -21 predicate places. [2022-12-13 00:53:03,109 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:53:03,109 INFO L89 Accepts]: Start accepts. Operand has 48 places, 41 transitions, 207 flow [2022-12-13 00:53:03,111 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:53:03,111 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:53:03,111 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 41 transitions, 207 flow [2022-12-13 00:53:03,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 207 flow [2022-12-13 00:53:03,122 INFO L130 PetriNetUnfolder]: 90/206 cut-off events. [2022-12-13 00:53:03,123 INFO L131 PetriNetUnfolder]: For 300/300 co-relation queries the response was YES. [2022-12-13 00:53:03,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 206 events. 90/206 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1002 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 627. Up to 109 conditions per place. [2022-12-13 00:53:03,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 207 flow [2022-12-13 00:53:03,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-13 00:53:03,911 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] L789-->L799: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff1_thd2~0_108 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_383 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_146 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_384 256) 0)) .cse5)) (.cse3 (and .cse5 .cse2)) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_333 256) 0))))) (and (= v_~x$w_buff0_used~0_383 (ite .cse0 0 v_~x$w_buff0_used~0_384)) (= v_~x$r_buff1_thd2~0_107 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_332 256) 0)) .cse1) (and (not (= (mod v_~x$r_buff0_thd2~0_145 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_108)) (= v_~__unbuffered_cnt~0_397 (+ v_~__unbuffered_cnt~0_398 1)) (= (ite .cse3 0 v_~x$r_buff0_thd2~0_146) v_~x$r_buff0_thd2~0_145) (= (ite .cse0 v_~x$w_buff0~0_254 (ite .cse4 v_~x$w_buff1~0_223 v_~x~0_298)) v_~x~0_297) (= v_~x$w_buff1_used~0_332 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_333))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_254, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_108, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_333, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_398, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_146, ~x~0=v_~x~0_298, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_384} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_254, ~x$w_buff1~0=v_~x$w_buff1~0_223, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_107, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_397, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_145, ~x~0=v_~x~0_297, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_383} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [475] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd0~0_100 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_107 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_342 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_343 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_293 256) 0))))) (and (= v_~x$w_buff0_used~0_342 (ite .cse0 0 v_~x$w_buff0_used~0_343)) (= v_~x$r_buff1_thd0~0_99 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_106 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_292 256) 0)))) 0 v_~x$r_buff1_thd0~0_100)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~x$w_buff1_used~0_292 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_293)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_87|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_395 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_100) (= v_~x$r_buff0_thd0~0_106 (ite .cse3 0 v_~x$r_buff0_thd0~0_107)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_87| 0) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= (ite .cse0 v_~x$w_buff0~0_232 (ite .cse4 v_~x$w_buff1~0_202 v_~x~0_258)) v_~x~0_257) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_114 0) (= v_~__unbuffered_p2_EAX~0_92 1) (= v_~__unbuffered_p2_EBX~0_86 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_70)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_232, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_86, ~x$w_buff1~0=v_~x$w_buff1~0_202, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_293, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_395, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_100, ~x~0=v_~x~0_258, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_343} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_232, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_106, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_87|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_86, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_77|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_202, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_292, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_342, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_395, ~x~0=v_~x~0_257, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:53:04,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [478] L789-->P1FINAL: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_112 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_387 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_150 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_337 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_388 256) 0)) .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_336 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd2~0_149 256) 0)))) 0 v_~x$r_buff1_thd2~0_112) v_~x$r_buff1_thd2~0_111) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_150) v_~x$r_buff0_thd2~0_149) (= v_~__unbuffered_cnt~0_401 (+ v_~__unbuffered_cnt~0_402 1)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_337) v_~x$w_buff1_used~0_336) (= |v_P1Thread1of1ForFork0_#res#1.base_43| 0) (= (ite .cse4 v_~x$w_buff0~0_256 (ite .cse3 v_~x$w_buff1~0_225 v_~x~0_302)) v_~x~0_301) (= v_~x$w_buff0_used~0_387 (ite .cse4 0 v_~x$w_buff0_used~0_388)) (= |v_P1Thread1of1ForFork0_#res#1.offset_43| 0)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_256, ~x$w_buff1~0=v_~x$w_buff1~0_225, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_112, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_337, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_402, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_150, ~x~0=v_~x~0_302, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_388} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_256, ~x$w_buff1~0=v_~x$w_buff1~0_225, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_111, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_336, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_401, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_43|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_149, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_43|, ~x~0=v_~x~0_301, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_387} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#res#1.offset, ~x~0, ~x$w_buff0_used~0] and [475] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd0~0_100 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_107 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_342 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_343 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_293 256) 0))))) (and (= v_~x$w_buff0_used~0_342 (ite .cse0 0 v_~x$w_buff0_used~0_343)) (= v_~x$r_buff1_thd0~0_99 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_106 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_292 256) 0)))) 0 v_~x$r_buff1_thd0~0_100)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~x$w_buff1_used~0_292 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_293)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_87|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_395 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_100) (= v_~x$r_buff0_thd0~0_106 (ite .cse3 0 v_~x$r_buff0_thd0~0_107)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_87| 0) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= (ite .cse0 v_~x$w_buff0~0_232 (ite .cse4 v_~x$w_buff1~0_202 v_~x~0_258)) v_~x~0_257) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_114 0) (= v_~__unbuffered_p2_EAX~0_92 1) (= v_~__unbuffered_p2_EBX~0_86 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_70)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_232, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_86, ~x$w_buff1~0=v_~x$w_buff1~0_202, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_293, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_395, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_100, ~x~0=v_~x~0_258, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_343} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_232, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_106, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_87|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_86, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_77|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_202, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_292, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_342, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_395, ~x~0=v_~x~0_257, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:53:04,538 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [479] L789-->P1EXIT: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd2~0_116 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_391 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_154 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_392 256) 0)))) (.cse4 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_341 256) 0))))) (and (= (ite .cse0 v_~x$w_buff0~0_258 (ite .cse1 v_~x$w_buff1~0_227 v_~x~0_306)) v_~x~0_305) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_340 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd2~0_153 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_116) v_~x$r_buff1_thd2~0_115) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_154) v_~x$r_buff0_thd2~0_153) (= (ite .cse0 0 v_~x$w_buff0_used~0_392) v_~x$w_buff0_used~0_391) (= |v_P1Thread1of1ForFork0_#res#1.offset_45| 0) (= |v_P1Thread1of1ForFork0_#res#1.base_45| 0) (= v_~__unbuffered_cnt~0_405 (+ v_~__unbuffered_cnt~0_406 1)) (= v_~x$w_buff1_used~0_340 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_341))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_258, ~x$w_buff1~0=v_~x$w_buff1~0_227, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_406, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_154, ~x~0=v_~x~0_306, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_258, ~x$w_buff1~0=v_~x$w_buff1~0_227, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_340, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_405, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_45|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_153, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_45|, ~x~0=v_~x~0_305, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#res#1.offset, ~x~0, ~x$w_buff0_used~0] and [475] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd0~0_100 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_107 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_342 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_343 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_293 256) 0))))) (and (= v_~x$w_buff0_used~0_342 (ite .cse0 0 v_~x$w_buff0_used~0_343)) (= v_~x$r_buff1_thd0~0_99 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_106 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_292 256) 0)))) 0 v_~x$r_buff1_thd0~0_100)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~x$w_buff1_used~0_292 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_293)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_87|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_395 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_100) (= v_~x$r_buff0_thd0~0_106 (ite .cse3 0 v_~x$r_buff0_thd0~0_107)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_87| 0) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= (ite .cse0 v_~x$w_buff0~0_232 (ite .cse4 v_~x$w_buff1~0_202 v_~x~0_258)) v_~x~0_257) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_114 0) (= v_~__unbuffered_p2_EAX~0_92 1) (= v_~__unbuffered_p2_EBX~0_86 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_70)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_232, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_86, ~x$w_buff1~0=v_~x$w_buff1~0_202, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_293, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_395, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_100, ~x~0=v_~x~0_258, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_343} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_232, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_106, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_87|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_86, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_77|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_202, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_292, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_342, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_395, ~x~0=v_~x~0_257, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 00:53:04,870 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L789-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (not (= (mod v_~x$r_buff0_thd2~0_221 256) 0)))) (let ((.cse4 (and .cse14 (not (= (mod v_~x$w_buff0_used~0_478 256) 0))))) (let ((.cse1 (ite .cse4 0 v_~x$w_buff0_used~0_478))) (let ((.cse8 (not (= (mod .cse1 256) 0))) (.cse7 (not (= (mod v_~x$r_buff1_thd2~0_180 256) 0)))) (let ((.cse5 (and (not (= (mod v_~x$w_buff1_used~0_424 256) 0)) .cse7)) (.cse12 (and .cse8 .cse14))) (let ((.cse11 (ite (or .cse5 .cse12) 0 v_~x$w_buff1_used~0_424))) (let ((.cse6 (not (= (mod .cse11 256) 0))) (.cse10 (not (= (mod v_~x$r_buff1_thd0~0_104 256) 0))) (.cse9 (not (= (mod v_~x$w_buff0_used~0_476 256) 0))) (.cse13 (not (= (mod v_~x$r_buff0_thd0~0_111 256) 0)))) (let ((.cse0 (and .cse13 .cse8)) (.cse2 (and .cse13 .cse9)) (.cse3 (and .cse6 .cse10))) (and (= (ite .cse0 0 .cse1) v_~x$w_buff0_used~0_476) (= v_~main$tmp_guard1~0_72 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_124 0) (= v_~__unbuffered_p2_EAX~0_96 1) (= v_~__unbuffered_p2_EBX~0_90 0))) 1 0) 0) 0 1)) (= v_~x$r_buff0_thd0~0_110 (ite .cse2 0 v_~x$r_buff0_thd0~0_111)) (= (mod v_~main$tmp_guard1~0_72 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_89|) (= (ite .cse0 v_~x$w_buff0~0_297 (ite .cse3 v_~x$w_buff1~0_263 (ite .cse4 v_~x$w_buff0~0_297 (ite .cse5 v_~x$w_buff1~0_263 v_~x~0_389)))) v_~x~0_387) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|) (= (ite (or (and .cse6 .cse7) (and .cse8 (not (= (mod v_~x$r_buff0_thd2~0_220 256) 0)))) 0 v_~x$r_buff1_thd2~0_180) v_~x$r_buff1_thd2~0_179) (= v_~__unbuffered_cnt~0_472 (+ v_~__unbuffered_cnt~0_473 1)) (= v_~x$r_buff1_thd0~0_103 (ite (or (and .cse9 (not (= (mod v_~x$r_buff0_thd0~0_110 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_422 256) 0)) .cse10)) 0 v_~x$r_buff1_thd0~0_104)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_89| 0) (= v_~x$w_buff1_used~0_422 (ite (or .cse2 .cse3) 0 .cse11)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_472 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_102) (= (mod v_~main$tmp_guard0~0_102 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0)) (= v_~x$r_buff0_thd2~0_220 (ite .cse12 0 v_~x$r_buff0_thd2~0_221))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_297, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_90, ~x$w_buff1~0=v_~x$w_buff1~0_263, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_424, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_180, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_104, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_221, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_478, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_124, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_473, ~x~0=v_~x~0_389} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_297, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_110, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_89|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_90, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_79|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_93|, ~x$w_buff1~0=v_~x$w_buff1~0_263, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_422, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_179, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_102, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_220, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_476, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_124, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_73|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_472, ~x~0=v_~x~0_387, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_71|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [472] $Ultimate##0-->L789: Formula: (and (= v_~x$w_buff0~0_215 v_~x$w_buff1~0_188) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_29| |v_P1Thread1of1ForFork0_~arg#1.offset_29|) (= v_~x$w_buff0~0_214 1) (= v_~x$r_buff1_thd0~0_89 v_~x$r_buff0_thd0~0_96) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.base_29| |v_P1Thread1of1ForFork0_#in~arg#1.base_29|) (= v_~x$w_buff0_used~0_322 1) (= v_~x$w_buff0_used~0_323 v_~x$w_buff1_used~0_276) (= v_~y~0_44 1) (= v_~x$r_buff0_thd2~0_110 1) (= v_~x$r_buff1_thd2~0_79 v_~x$r_buff0_thd2~0_111) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_322 256) 0)) (not (= (mod v_~x$w_buff1_used~0_276 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= v_~x$r_buff0_thd1~0_141 v_~x$r_buff1_thd1~0_146) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= v_~x$r_buff1_thd3~0_97 v_~x$r_buff0_thd3~0_101)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_215, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_111, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_323} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_214, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_29|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_188, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_79, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_276, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_146, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_89, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_322, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~y~0=v_~y~0_44} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] [2022-12-13 00:53:05,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] L789-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (not (= (mod v_~x$r_buff0_thd2~0_225 256) 0)))) (let ((.cse2 (and .cse14 (not (= (mod v_~x$w_buff0_used~0_484 256) 0))))) (let ((.cse4 (ite .cse2 0 v_~x$w_buff0_used~0_484))) (let ((.cse12 (not (= (mod .cse4 256) 0))) (.cse10 (not (= (mod v_~x$r_buff1_thd2~0_184 256) 0)))) (let ((.cse3 (and .cse10 (not (= (mod v_~x$w_buff1_used~0_430 256) 0)))) (.cse7 (and .cse14 .cse12))) (let ((.cse9 (ite (or .cse3 .cse7) 0 v_~x$w_buff1_used~0_430))) (let ((.cse6 (not (= 0 (mod v_~x$w_buff0_used~0_482 256)))) (.cse11 (not (= (mod .cse9 256) 0))) (.cse5 (not (= (mod v_~x$r_buff1_thd0~0_108 256) 0))) (.cse13 (not (= (mod v_~x$r_buff0_thd0~0_115 256) 0)))) (let ((.cse0 (and .cse12 .cse13)) (.cse1 (and .cse11 .cse5)) (.cse8 (and .cse6 .cse13))) (and (= |v_P1Thread1of1ForFork0_#res#1.base_67| 0) (= (ite .cse0 v_~x$w_buff0~0_299 (ite .cse1 v_~x$w_buff1~0_265 (ite .cse2 v_~x$w_buff0~0_299 (ite .cse3 v_~x$w_buff1~0_265 v_~x~0_395)))) v_~x~0_393) (= v_~main$tmp_guard0~0_104 (ite (= (ite (= v_~__unbuffered_cnt~0_476 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_75| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_91|) (= v_~x$w_buff0_used~0_482 (ite .cse0 0 .cse4)) (= v_~x$r_buff1_thd0~0_107 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_428 256) 0)) .cse5) (and .cse6 (not (= (mod v_~x$r_buff0_thd0~0_114 256) 0)))) 0 v_~x$r_buff1_thd0~0_108)) (= (ite .cse7 0 v_~x$r_buff0_thd2~0_225) v_~x$r_buff0_thd2~0_224) (= v_~x$w_buff1_used~0_428 (ite (or .cse8 .cse1) 0 .cse9)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_89| 0)) (= v_~x$r_buff0_thd0~0_114 (ite .cse8 0 v_~x$r_buff0_thd0~0_115)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_75| (mod v_~main$tmp_guard1~0_74 256)) (= |v_P1Thread1of1ForFork0_#res#1.offset_67| 0) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_91| 0) (= (mod v_~main$tmp_guard0~0_104 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|) (= (ite (or (and .cse10 .cse11) (and .cse12 (not (= (mod v_~x$r_buff0_thd2~0_224 256) 0)))) 0 v_~x$r_buff1_thd2~0_184) v_~x$r_buff1_thd2~0_183) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_89| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|) (= v_~main$tmp_guard1~0_74 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_126 0) (= v_~__unbuffered_p2_EBX~0_92 0) (= v_~__unbuffered_p2_EAX~0_98 1))) 1 0) 0) 0 1)) (= v_~__unbuffered_cnt~0_476 (+ v_~__unbuffered_cnt~0_477 1))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_299, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_115, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_92, ~x$w_buff1~0=v_~x$w_buff1~0_265, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_430, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_184, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_108, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_225, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_484, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_126, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_477, ~x~0=v_~x~0_395} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_299, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_114, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_91|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_92, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_81|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_95|, ~x$w_buff1~0=v_~x$w_buff1~0_265, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_428, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_183, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_104, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_224, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_482, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_126, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_75|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_89|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_476, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_67|, ~x~0=v_~x~0_393, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_67|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~x~0, P1Thread1of1ForFork0_#res#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [472] $Ultimate##0-->L789: Formula: (and (= v_~x$w_buff0~0_215 v_~x$w_buff1~0_188) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_29| |v_P1Thread1of1ForFork0_~arg#1.offset_29|) (= v_~x$w_buff0~0_214 1) (= v_~x$r_buff1_thd0~0_89 v_~x$r_buff0_thd0~0_96) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.base_29| |v_P1Thread1of1ForFork0_#in~arg#1.base_29|) (= v_~x$w_buff0_used~0_322 1) (= v_~x$w_buff0_used~0_323 v_~x$w_buff1_used~0_276) (= v_~y~0_44 1) (= v_~x$r_buff0_thd2~0_110 1) (= v_~x$r_buff1_thd2~0_79 v_~x$r_buff0_thd2~0_111) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_322 256) 0)) (not (= (mod v_~x$w_buff1_used~0_276 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= v_~x$r_buff0_thd1~0_141 v_~x$r_buff1_thd1~0_146) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= v_~x$r_buff1_thd3~0_97 v_~x$r_buff0_thd3~0_101)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_215, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_111, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_323} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_214, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_29|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_188, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_79, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_276, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_146, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_89, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_322, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~y~0=v_~y~0_44} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] [2022-12-13 00:53:05,709 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L789-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (not (= (mod v_~x$r_buff0_thd2~0_229 256) 0)))) (let ((.cse11 (and (not (= (mod v_~x$w_buff0_used~0_490 256) 0)) .cse14))) (let ((.cse10 (ite .cse11 0 v_~x$w_buff0_used~0_490))) (let ((.cse8 (not (= (mod .cse10 256) 0))) (.cse6 (not (= (mod v_~x$r_buff1_thd2~0_188 256) 0)))) (let ((.cse12 (and .cse6 (not (= (mod v_~x$w_buff1_used~0_436 256) 0)))) (.cse5 (and .cse8 .cse14))) (let ((.cse4 (ite (or .cse12 .cse5) 0 v_~x$w_buff1_used~0_436))) (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_488 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd0~0_112 256) 0))) (.cse7 (not (= (mod .cse4 256) 0))) (.cse13 (not (= (mod v_~x$r_buff0_thd0~0_119 256) 0)))) (let ((.cse9 (and .cse8 .cse13)) (.cse3 (and .cse0 .cse7)) (.cse2 (and .cse13 .cse1))) (and (= v_~main$tmp_guard1~0_76 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_94 0) (= v_~__unbuffered_p0_EAX~0_128 0) (= v_~__unbuffered_p2_EAX~0_100 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (= (mod v_~main$tmp_guard0~0_106 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (= |v_P1Thread1of1ForFork0_#res#1.base_69| 0) (= |v_P1Thread1of1ForFork0_#res#1.offset_69| 0) (= v_~x$r_buff1_thd0~0_111 (ite (or (and (not (= 0 (mod v_~x$w_buff1_used~0_434 256))) .cse0) (and (not (= 0 (mod v_~x$r_buff0_thd0~0_118 256))) .cse1)) 0 v_~x$r_buff1_thd0~0_112)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_77| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|) (= (ite (or .cse2 .cse3) 0 .cse4) v_~x$w_buff1_used~0_434) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_93| 0) (= (mod v_~main$tmp_guard1~0_76 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_77|) (= (ite .cse5 0 v_~x$r_buff0_thd2~0_229) v_~x$r_buff0_thd2~0_228) (= v_~main$tmp_guard0~0_106 (ite (= (ite (= v_~__unbuffered_cnt~0_480 3) 1 0) 0) 0 1)) (= (ite (or (and .cse6 .cse7) (and .cse8 (not (= (mod v_~x$r_buff0_thd2~0_228 256) 0)))) 0 v_~x$r_buff1_thd2~0_188) v_~x$r_buff1_thd2~0_187) (= v_~x$w_buff0_used~0_488 (ite .cse9 0 .cse10)) (= v_~__unbuffered_cnt~0_480 (+ v_~__unbuffered_cnt~0_481 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| 0)) (= (ite .cse9 v_~x$w_buff0~0_301 (ite .cse3 v_~x$w_buff1~0_267 (ite .cse11 v_~x$w_buff0~0_301 (ite .cse12 v_~x$w_buff1~0_267 v_~x~0_401)))) v_~x~0_399) (= v_~x$r_buff0_thd0~0_118 (ite .cse2 0 v_~x$r_buff0_thd0~0_119))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_301, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_119, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~x$w_buff1~0=v_~x$w_buff1~0_267, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_436, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_188, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_112, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_229, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_490, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_100, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_481, ~x~0=v_~x~0_401} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_301, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_118, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_93|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_83|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_97|, ~x$w_buff1~0=v_~x$w_buff1~0_267, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_434, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_187, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_76, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_106, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_111, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_228, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_488, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_77|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_91|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_100, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_480, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_69|, ~x~0=v_~x~0_399, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_69|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, ~x~0, P1Thread1of1ForFork0_#res#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [472] $Ultimate##0-->L789: Formula: (and (= v_~x$w_buff0~0_215 v_~x$w_buff1~0_188) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_29| |v_P1Thread1of1ForFork0_~arg#1.offset_29|) (= v_~x$w_buff0~0_214 1) (= v_~x$r_buff1_thd0~0_89 v_~x$r_buff0_thd0~0_96) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.base_29| |v_P1Thread1of1ForFork0_#in~arg#1.base_29|) (= v_~x$w_buff0_used~0_322 1) (= v_~x$w_buff0_used~0_323 v_~x$w_buff1_used~0_276) (= v_~y~0_44 1) (= v_~x$r_buff0_thd2~0_110 1) (= v_~x$r_buff1_thd2~0_79 v_~x$r_buff0_thd2~0_111) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_322 256) 0)) (not (= (mod v_~x$w_buff1_used~0_276 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= v_~x$r_buff0_thd1~0_141 v_~x$r_buff1_thd1~0_146) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= v_~x$r_buff1_thd3~0_97 v_~x$r_buff0_thd3~0_101)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_215, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_111, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_323} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_214, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_29|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_188, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_79, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_276, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_146, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_89, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_322, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~y~0=v_~y~0_44} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] [2022-12-13 00:53:06,165 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd0~0_100 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_107 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_342 256) 0)))) (let ((.cse3 (and .cse5 .cse1)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_343 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_293 256) 0))))) (and (= v_~x$w_buff0_used~0_342 (ite .cse0 0 v_~x$w_buff0_used~0_343)) (= v_~x$r_buff1_thd0~0_99 (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_106 256) 0)) .cse1) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_292 256) 0)))) 0 v_~x$r_buff1_thd0~0_100)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= v_~x$w_buff1_used~0_292 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_293)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_87|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_395 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_100) (= v_~x$r_buff0_thd0~0_106 (ite .cse3 0 v_~x$r_buff0_thd0~0_107)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_87| 0) (= (mod v_~main$tmp_guard0~0_100 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|) (= (ite .cse0 v_~x$w_buff0~0_232 (ite .cse4 v_~x$w_buff1~0_202 v_~x~0_258)) v_~x~0_257) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_114 0) (= v_~__unbuffered_p2_EAX~0_92 1) (= v_~__unbuffered_p2_EBX~0_86 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_70)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_232, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_107, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_86, ~x$w_buff1~0=v_~x$w_buff1~0_202, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_293, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_395, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_100, ~x~0=v_~x~0_258, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_343} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_232, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_106, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_87|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_86, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_77|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_202, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_292, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_100, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_342, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_71|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_395, ~x~0=v_~x~0_257, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_69|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [472] $Ultimate##0-->L789: Formula: (and (= v_~x$w_buff0~0_215 v_~x$w_buff1~0_188) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_29| |v_P1Thread1of1ForFork0_~arg#1.offset_29|) (= v_~x$w_buff0~0_214 1) (= v_~x$r_buff1_thd0~0_89 v_~x$r_buff0_thd0~0_96) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.base_29| |v_P1Thread1of1ForFork0_#in~arg#1.base_29|) (= v_~x$w_buff0_used~0_322 1) (= v_~x$w_buff0_used~0_323 v_~x$w_buff1_used~0_276) (= v_~y~0_44 1) (= v_~x$r_buff0_thd2~0_110 1) (= v_~x$r_buff1_thd2~0_79 v_~x$r_buff0_thd2~0_111) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_322 256) 0)) (not (= (mod v_~x$w_buff1_used~0_276 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= v_~x$r_buff0_thd1~0_141 v_~x$r_buff1_thd1~0_146) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= v_~x$r_buff1_thd3~0_97 v_~x$r_buff0_thd3~0_101)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_215, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_111, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_323} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_214, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_29|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_188, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_97, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_79, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_276, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_146, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_89, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_322, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~y~0=v_~y~0_44} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] [2022-12-13 00:53:06,527 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [489] L789-->L789: Formula: (let ((.cse8 (not (= (mod v_~x$r_buff0_thd2~0_234 256) 0)))) (let ((.cse6 (and (not (= (mod v_~x$w_buff0_used~0_496 256) 0)) .cse8))) (let ((.cse1 (ite .cse6 0 v_~x$w_buff0_used~0_496))) (let ((.cse7 (not (= (mod .cse1 256) 0))) (.cse2 (not (= (mod v_~x$r_buff0_thd0~0_123 256) 0)))) (let ((.cse3 (not (= (mod v_~x$w_buff1_used~0_440 256) 0))) (.cse0 (and .cse7 .cse2)) (.cse4 (and .cse7 .cse8))) (and (= v_~main$tmp_guard0~0_108 (ite (= (ite (= v_~__unbuffered_cnt~0_484 3) 1 0) 0) 0 1)) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= v_~x$w_buff0~0_303 1) (= v_~x$w_buff0~0_304 v_~x$w_buff1~0_269) (= v_~x$w_buff1_used~0_440 (ite .cse0 0 .cse1)) (= v_~x$r_buff0_thd0~0_122 (ite (and .cse2 .cse3) 0 v_~x$r_buff0_thd0~0_123)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_102 1) (= v_~__unbuffered_p0_EAX~0_130 0) (= v_~__unbuffered_p2_EBX~0_96 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_78) (= v_~__unbuffered_cnt~0_484 (+ v_~__unbuffered_cnt~0_485 1)) (= v_~x$r_buff0_thd0~0_122 v_~x$r_buff1_thd0~0_115) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_93| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= (mod v_~main$tmp_guard1~0_78 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_79|) (= v_~x$r_buff1_thd2~0_191 (ite .cse4 0 v_~x$r_buff0_thd2~0_234)) (= v_~x$r_buff0_thd3~0_165 v_~x$r_buff1_thd3~0_161) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_93| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_494 256) 0)) .cse3)) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|) (= (ite .cse0 v_~x$w_buff0~0_304 (let ((.cse5 (and (not (= (mod v_~x$w_buff1_used~0_442 256) 0)) (not (= (mod v_~x$r_buff1_thd2~0_193 256) 0))))) (ite (and (not (= (mod v_~x$r_buff1_thd0~0_117 256) 0)) (not (= (mod (ite (or .cse4 .cse5) 0 v_~x$w_buff1_used~0_442) 256) 0))) v_~x$w_buff1~0_270 (ite .cse6 v_~x$w_buff0~0_304 (ite .cse5 v_~x$w_buff1~0_270 v_~x~0_406))))) v_~x~0_405) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_79| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_95|) (= v_~x$r_buff0_thd1~0_175 v_~x$r_buff1_thd1~0_182) (= |v_P1Thread1of1ForFork0_~arg#1.base_35| |v_P1Thread1of1ForFork0_#in~arg#1.base_35|) (= (mod v_~main$tmp_guard0~0_108 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= v_~x$w_buff0_used~0_494 1) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_95| 0) (= v_~y~0_56 1) (= v_~x$r_buff0_thd2~0_232 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_35| |v_P1Thread1of1ForFork0_~arg#1.offset_35|))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_304, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_123, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_175, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_96, ~x$w_buff1~0=v_~x$w_buff1~0_270, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_442, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_193, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_165, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_234, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_117, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_496, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_130, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_102, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_485, ~x~0=v_~x~0_406} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_303, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_175, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_35|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_95|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_99|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_161, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_182, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_78, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_39|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_165, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_130, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_93|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_102, ~y~0=v_~y~0_56, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_122, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_39|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_35|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_96, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_85|, ~x$w_buff1~0=v_~x$w_buff1~0_269, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_191, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_440, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_108, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_232, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_115, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_494, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_79|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_484, ~x~0=v_~x~0_405, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre9#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~x$r_buff0_thd0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ULTIMATE.start_main_#t~nondet10#1, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [473] $Ultimate##0-->L809: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~y~0_50 v_~__unbuffered_p2_EAX~0_86) (= v_~__unbuffered_p2_EBX~0_80 v_~z~0_41) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_41, ~y~0=v_~y~0_50} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_41, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] [2022-12-13 00:53:06,876 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [490] L789-->L789: Formula: (let ((.cse6 (not (= (mod v_~x$r_buff0_thd2~0_240 256) 0)))) (let ((.cse5 (and (not (= (mod v_~x$w_buff0_used~0_502 256) 0)) .cse6))) (let ((.cse8 (ite .cse5 0 v_~x$w_buff0_used~0_502))) (let ((.cse0 (not (= (mod v_~x$r_buff0_thd0~0_127 256) 0))) (.cse7 (not (= (mod .cse8 256) 0)))) (let ((.cse2 (and .cse0 .cse7))) (let ((.cse1 (ite .cse2 0 .cse8)) (.cse3 (and .cse6 .cse7))) (and (= v_~x$r_buff0_thd0~0_126 (ite (and .cse0 (not (= (mod .cse1 256) 0))) 0 v_~x$r_buff0_thd0~0_127)) (= (ite .cse2 v_~x$w_buff0~0_308 (let ((.cse4 (and (not (= (mod v_~x$r_buff1_thd2~0_199 256) 0)) (not (= (mod v_~x$w_buff1_used~0_448 256) 0))))) (ite (and (not (= (mod (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_448) 256) 0)) (not (= (mod v_~x$r_buff1_thd0~0_123 256) 0))) v_~x$w_buff1~0_274 (ite .cse5 v_~x$w_buff0~0_308 (ite .cse4 v_~x$w_buff1~0_274 v_~x~0_410))))) v_~x~0_409) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_500 256))) (not (= (mod v_~x$w_buff1_used~0_446 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79| (mod v_~main$tmp_guard0~0_110 256)) (= v_~x$w_buff0~0_307 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_37| |v_P1Thread1of1ForFork0_#in~arg#1.base_37|) (= v_~x$r_buff0_thd1~0_177 v_~x$r_buff1_thd1~0_184) (= .cse1 v_~x$w_buff1_used~0_446) (= v_~x$w_buff0_used~0_500 1) (= (ite (= (ite (= v_~__unbuffered_cnt~0_488 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_110) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_81| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_97|) (= (ite .cse3 0 v_~x$r_buff0_thd2~0_240) v_~x$r_buff1_thd2~0_197) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| 0)) (= v_~x$r_buff0_thd3~0_167 v_~x$r_buff1_thd3~0_163) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_41| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_81| (mod v_~main$tmp_guard1~0_80 256)) (= v_~x$w_buff0~0_308 v_~x$w_buff1~0_273) (= |v_P1Thread1of1ForFork0_#res#1.offset_71| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_95| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_97| 0) (= v_~x$r_buff0_thd2~0_238 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_37| |v_P1Thread1of1ForFork0_~arg#1.offset_37|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_41| 0)) (= |v_P1Thread1of1ForFork0_#res#1.base_71| 0) (= v_~__unbuffered_cnt~0_488 (+ v_~__unbuffered_cnt~0_489 1)) (= v_~y~0_58 1) (= v_~x$r_buff0_thd0~0_126 v_~x$r_buff1_thd0~0_121) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EAX~0_132 0) (= v_~__unbuffered_p2_EAX~0_104 1) (= v_~__unbuffered_p2_EBX~0_98 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_80)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_308, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_177, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_98, ~x$w_buff1~0=v_~x$w_buff1~0_274, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_448, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_199, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_167, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_240, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_123, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_37|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_502, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_132, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_104, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_489, ~x~0=v_~x~0_410} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_307, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_177, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_37|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_97|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_101|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_163, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_167, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_37|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_132, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_95|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_104, ~y~0=v_~y~0_58, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_71|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_71|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_41|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_98, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_87|, ~x$w_buff1~0=v_~x$w_buff1~0_273, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_197, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_446, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_110, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_238, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_121, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_500, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_81|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_488, ~x~0=v_~x~0_409, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre9#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset, ~x$r_buff0_thd0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ULTIMATE.start_main_#t~nondet10#1, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [473] $Ultimate##0-->L809: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~y~0_50 v_~__unbuffered_p2_EAX~0_86) (= v_~__unbuffered_p2_EBX~0_80 v_~z~0_41) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_41, ~y~0=v_~y~0_50} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_41, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] [2022-12-13 00:53:07,261 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [491] L789-->L789: Formula: (let ((.cse7 (not (= (mod v_~x$r_buff0_thd2~0_246 256) 0)))) (let ((.cse5 (and .cse7 (not (= (mod v_~x$w_buff0_used~0_508 256) 0))))) (let ((.cse8 (ite .cse5 0 v_~x$w_buff0_used~0_508))) (let ((.cse6 (not (= (mod .cse8 256) 0))) (.cse2 (not (= (mod v_~x$r_buff0_thd0~0_131 256) 0)))) (let ((.cse3 (and .cse6 .cse2))) (let ((.cse1 (ite .cse3 0 .cse8)) (.cse0 (and .cse6 .cse7))) (and (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_39| |v_P1Thread1of1ForFork0_~arg#1.offset_39|) (= (ite .cse0 0 v_~x$r_buff0_thd2~0_246) v_~x$r_buff1_thd2~0_203) (= v_~x$r_buff0_thd2~0_244 1) (= |v_P1Thread1of1ForFork0_#res#1.base_73| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= v_~__unbuffered_cnt~0_492 (+ v_~__unbuffered_cnt~0_493 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_99|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= v_~x$r_buff0_thd1~0_179 v_~x$r_buff1_thd1~0_186) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_99| 0) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|) (= (mod v_~main$tmp_guard0~0_112 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83| (mod v_~main$tmp_guard1~0_82 256)) (= v_~x$w_buff0~0_311 1) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_506 256) 0)) (not (= (mod v_~x$w_buff1_used~0_452 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_492 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_112) (= |v_P1Thread1of1ForFork0_~arg#1.base_39| |v_P1Thread1of1ForFork0_#in~arg#1.base_39|) (= v_~x$w_buff0~0_312 v_~x$w_buff1~0_277) (= |v_P1Thread1of1ForFork0_#res#1.offset_73| 0) (= v_~y~0_60 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| 0)) (= v_~main$tmp_guard1~0_82 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_100 0) (= v_~__unbuffered_p0_EAX~0_134 0) (= v_~__unbuffered_p2_EAX~0_106 1))) 1 0) 0) 0 1)) (= v_~x$w_buff0_used~0_506 1) (= v_~x$w_buff1_used~0_452 .cse1) (= v_~x$r_buff0_thd3~0_169 v_~x$r_buff1_thd3~0_165) (= v_~x$r_buff0_thd0~0_130 (ite (and (not (= (mod .cse1 256) 0)) .cse2) 0 v_~x$r_buff0_thd0~0_131)) (= v_~x$r_buff0_thd0~0_130 v_~x$r_buff1_thd0~0_127) (= (ite .cse3 v_~x$w_buff0~0_312 (let ((.cse4 (and (not (= (mod v_~x$r_buff1_thd2~0_205 256) 0)) (not (= (mod v_~x$w_buff1_used~0_454 256) 0))))) (ite (and (not (= 0 (mod v_~x$r_buff1_thd0~0_129 256))) (not (= (mod (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_454) 256) 0))) v_~x$w_buff1~0_278 (ite .cse5 v_~x$w_buff0~0_312 (ite .cse4 v_~x$w_buff1~0_278 v_~x~0_414))))) v_~x~0_413)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_312, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_131, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_179, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ~x$w_buff1~0=v_~x$w_buff1~0_278, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_454, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_205, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_246, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_129, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_508, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_39|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_134, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_493, ~x~0=v_~x~0_414} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_311, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_179, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_39|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_99|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_103|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_165, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_186, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_39|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_39|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_134, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ~y~0=v_~y~0_60, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_73|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_73|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_89|, ~x$w_buff1~0=v_~x$w_buff1~0_277, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_203, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_452, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_112, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_244, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_506, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_83|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_492, ~x~0=v_~x~0_413, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre9#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset, ~x$r_buff0_thd0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ULTIMATE.start_main_#t~nondet10#1, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [473] $Ultimate##0-->L809: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~y~0_50 v_~__unbuffered_p2_EAX~0_86) (= v_~__unbuffered_p2_EBX~0_80 v_~z~0_41) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_41, ~y~0=v_~y~0_50} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_41, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] [2022-12-13 00:53:07,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] L838-3-->L789: Formula: (let ((.cse1 (not (= (mod v_~x$r_buff0_thd0~0_135 256) 0)))) (let ((.cse2 (not (= (mod v_~x$w_buff1_used~0_458 256) 0))) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_514 256) 0)) .cse1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| 0)) (= (mod v_~main$tmp_guard0~0_114 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_496 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_114) (= v_~y~0_62 1) (= v_~x$w_buff0~0_316 v_~x$w_buff1~0_281) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_85|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|) (= |v_P1Thread1of1ForFork0_~arg#1.base_41| |v_P1Thread1of1ForFork0_#in~arg#1.base_41|) (= v_~x$w_buff0~0_315 1) (= v_~x$r_buff0_thd0~0_134 v_~x$r_buff1_thd0~0_133) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|) (= v_~x$r_buff0_thd1~0_181 v_~x$r_buff1_thd1~0_188) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_41| |v_P1Thread1of1ForFork0_~arg#1.offset_41|) (= (ite .cse0 v_~x$w_buff0~0_316 (ite (and (not (= (mod v_~x$r_buff1_thd0~0_135 256) 0)) (not (= (mod v_~x$w_buff1_used~0_460 256) 0))) v_~x$w_buff1~0_282 v_~x~0_418)) v_~x~0_417) (= v_~x$r_buff0_thd3~0_171 v_~x$r_buff1_thd3~0_167) (= v_~x$r_buff0_thd2~0_250 1) (= v_~x$r_buff0_thd2~0_251 v_~x$r_buff1_thd2~0_209) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_101| 0) (= v_~x$r_buff0_thd0~0_134 (ite (and .cse1 .cse2) 0 v_~x$r_buff0_thd0~0_135)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_512 256) 0)) .cse2)) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|) (= v_~x$w_buff1_used~0_458 (ite .cse0 0 v_~x$w_buff0_used~0_514)) (= v_~x$w_buff0_used~0_512 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45| 0)) (= (mod v_~main$tmp_guard1~0_84 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_85|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_102 0) (= v_~__unbuffered_p0_EAX~0_136 0) (= v_~__unbuffered_p2_EAX~0_108 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_84)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_316, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_135, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_181, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_282, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_460, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_171, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_251, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_135, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_41|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_514, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_496, ~x~0=v_~x~0_418} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_315, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_181, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_41|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_101|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_105|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_167, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_188, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_171, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_41|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_99|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_108, ~y~0=v_~y~0_62, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_91|, ~x$w_buff1~0=v_~x$w_buff1~0_281, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_209, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_458, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_114, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_250, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_133, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_512, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_85|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_496, ~x~0=v_~x~0_417, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_83|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~main$tmp_guard0~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [473] $Ultimate##0-->L809: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~y~0_50 v_~__unbuffered_p2_EAX~0_86) (= v_~__unbuffered_p2_EBX~0_80 v_~z~0_41) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_41, ~y~0=v_~y~0_50} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_41, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] [2022-12-13 00:53:07,912 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:53:07,913 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4804 [2022-12-13 00:53:07,913 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 383 flow [2022-12-13 00:53:07,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 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:07,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:53:07,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:07,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:53:07,913 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:07,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:53:07,914 INFO L85 PathProgramCache]: Analyzing trace with hash -112359004, now seen corresponding path program 1 times [2022-12-13 00:53:07,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:53:07,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32723405] [2022-12-13 00:53:07,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:53:07,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:53:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:53:07,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:53:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:53:07,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:53:07,994 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:53:07,995 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:53:08,004 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:53:08,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:53:08,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:53:08,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:53:08,005 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:53:08,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:53:08,006 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:53:08,010 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:53:08,010 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:53:08,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:53:08 BasicIcfg [2022-12-13 00:53:08,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:53:08,069 INFO L158 Benchmark]: Toolchain (without parser) took 16079.71ms. Allocated memory was 167.8MB in the beginning and 543.2MB in the end (delta: 375.4MB). Free memory was 142.9MB in the beginning and 188.0MB in the end (delta: -45.1MB). Peak memory consumption was 330.5MB. Max. memory is 8.0GB. [2022-12-13 00:53:08,069 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 167.8MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:53:08,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.74ms. Allocated memory is still 167.8MB. Free memory was 142.9MB in the beginning and 116.4MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 00:53:08,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.98ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 114.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:53:08,070 INFO L158 Benchmark]: Boogie Preprocessor took 24.67ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 112.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:53:08,070 INFO L158 Benchmark]: RCFGBuilder took 634.20ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 80.2MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-13 00:53:08,070 INFO L158 Benchmark]: TraceAbstraction took 14862.53ms. Allocated memory was 167.8MB in the beginning and 543.2MB in the end (delta: 375.4MB). Free memory was 79.2MB in the beginning and 188.0MB in the end (delta: -108.8MB). Peak memory consumption was 266.6MB. Max. memory is 8.0GB. [2022-12-13 00:53:08,071 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.09ms. Allocated memory is still 167.8MB. Free memory is still 145.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 506.74ms. Allocated memory is still 167.8MB. Free memory was 142.9MB in the beginning and 116.4MB in the end (delta: 26.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.98ms. Allocated memory is still 167.8MB. Free memory was 116.4MB in the beginning and 114.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.67ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 112.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 634.20ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 80.2MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 14862.53ms. Allocated memory was 167.8MB in the beginning and 543.2MB in the end (delta: 375.4MB). Free memory was 79.2MB in the beginning and 188.0MB in the end (delta: -108.8MB). Peak memory consumption was 266.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 113 PlacesBefore, 69 PlacesAfterwards, 105 TransitionsBefore, 60 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 85 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3408, independent: 3294, independent conditional: 3294, independent unconditional: 0, dependent: 114, dependent conditional: 114, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3408, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3408, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3408, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1828, independent: 1785, independent conditional: 0, independent unconditional: 1785, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1828, independent: 1763, independent conditional: 0, independent unconditional: 1763, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 185, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3408, independent: 1509, independent conditional: 0, independent unconditional: 1509, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 1828, unknown conditional: 0, unknown unconditional: 1828] , Statistics on independence cache: Total cache size (in pairs): 3423, Positive cache size: 3380, Positive conditional cache size: 0, Positive unconditional cache size: 3380, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, 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, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 228, independent: 194, independent conditional: 194, 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: 228, independent: 194, independent conditional: 10, independent unconditional: 184, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 228, independent: 194, independent conditional: 10, independent unconditional: 184, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 228, independent: 194, independent conditional: 10, independent unconditional: 184, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 190, independent: 167, independent conditional: 10, independent unconditional: 157, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 190, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 100, dependent conditional: 12, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 228, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 190, unknown conditional: 12, unknown unconditional: 178] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 167, Positive conditional cache size: 10, Positive unconditional cache size: 157, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, 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, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 180, independent conditional: 180, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 210, independent: 180, independent conditional: 7, independent unconditional: 173, dependent: 30, dependent conditional: 2, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 210, independent: 180, independent conditional: 0, independent unconditional: 180, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 210, independent: 180, independent conditional: 0, independent unconditional: 180, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 176, Positive conditional cache size: 10, Positive unconditional cache size: 166, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 376, independent: 321, independent conditional: 321, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 376, independent: 321, independent conditional: 27, independent unconditional: 294, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 376, independent: 321, independent conditional: 0, independent unconditional: 321, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 376, independent: 321, independent conditional: 0, independent unconditional: 321, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 376, independent: 312, independent conditional: 0, independent unconditional: 312, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 194, Positive conditional cache size: 10, Positive unconditional cache size: 184, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 83, independent conditional: 83, 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: 107, independent: 83, independent conditional: 4, independent unconditional: 79, 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: 107, independent: 83, independent conditional: 3, independent unconditional: 80, 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: 107, independent: 83, independent conditional: 3, independent unconditional: 80, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, independent: 83, independent conditional: 3, independent unconditional: 80, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 194, Positive conditional cache size: 10, Positive unconditional cache size: 184, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, 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, 48 PlacesBefore, 48 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 143, independent: 110, independent conditional: 110, 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: 143, independent: 110, independent conditional: 28, independent unconditional: 82, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 143, independent: 110, independent conditional: 27, independent unconditional: 83, 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: 143, independent: 110, independent conditional: 27, independent unconditional: 83, 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: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 143, independent: 102, independent conditional: 19, independent unconditional: 83, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 229, Positive cache size: 202, Positive conditional cache size: 18, Positive unconditional cache size: 184, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, 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.4s, 50 PlacesBefore, 47 PlacesAfterwards, 48 TransitionsBefore, 45 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 349, independent: 285, independent conditional: 285, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 349, independent: 285, independent conditional: 123, independent unconditional: 162, dependent: 64, dependent conditional: 4, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 349, independent: 285, independent conditional: 116, independent unconditional: 169, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 349, independent: 285, independent conditional: 116, independent unconditional: 169, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 349, independent: 279, independent conditional: 112, independent unconditional: 167, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 212, Positive conditional cache size: 22, Positive unconditional cache size: 190, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 73, independent: 52, independent conditional: 10, independent unconditional: 42, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 21, dependent conditional: 0, dependent unconditional: 21, 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: 73, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 212, Positive conditional cache size: 22, Positive unconditional cache size: 190, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 49 PlacesBefore, 48 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 381, independent: 323, independent conditional: 323, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 381, independent: 323, independent conditional: 210, independent unconditional: 113, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 381, independent: 323, independent conditional: 200, independent unconditional: 123, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 381, independent: 323, independent conditional: 200, independent unconditional: 123, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 23, independent conditional: 13, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 381, independent: 300, independent conditional: 187, independent unconditional: 113, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 27, unknown conditional: 13, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 251, Positive conditional cache size: 35, Positive unconditional cache size: 216, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 46 PlacesBefore, 47 PlacesAfterwards, 41 TransitionsBefore, 45 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 407, independent: 360, independent conditional: 360, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 407, independent: 360, independent conditional: 275, independent unconditional: 85, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 410, independent: 360, independent conditional: 246, independent unconditional: 114, dependent: 50, dependent conditional: 3, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 410, independent: 360, independent conditional: 246, independent unconditional: 114, dependent: 50, dependent conditional: 3, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 27, independent conditional: 19, independent unconditional: 8, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 136, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 74, dependent conditional: 55, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 410, independent: 333, independent conditional: 227, independent unconditional: 106, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 32, unknown conditional: 22, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 348, Positive conditional cache size: 54, Positive unconditional cache size: 294, Negative cache size: 38, Negative conditional cache size: 5, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2345; [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2345, ((void *)0), P0, ((void *)0))=-1, t2345={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2346; [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2346, ((void *)0), P1, ((void *)0))=0, t2345={5:0}, t2346={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t2347; [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2347, ((void *)0), P2, ((void *)0))=1, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L746] 1 z = 1 [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 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: 14.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 800 IncrementalHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 1 mSDtfsCounter, 800 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=383occurred in iteration=9, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:53:08,109 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...