/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:33:06,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:33:06,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:33:06,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:33:06,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:33:06,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:33:06,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:33:06,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:33:06,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:33:06,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:33:06,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:33:06,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:33:06,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:33:06,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:33:06,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:33:06,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:33:06,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:33:06,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:33:06,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:33:06,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:33:06,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:33:06,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:33:06,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:33:06,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:33:06,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:33:06,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:33:06,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:33:06,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:33:06,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:33:06,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:33:06,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:33:06,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:33:06,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:33:06,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:33:06,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:33:06,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:33:06,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:33:06,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:33:06,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:33:06,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:33:06,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:33:06,256 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:33:06,288 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:33:06,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:33:06,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:33:06,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:33:06,291 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:33:06,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:33:06,292 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:33:06,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:33:06,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:33:06,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:33:06,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:33:06,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:33:06,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:33:06,293 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:33:06,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:33:06,294 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:33:06,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:33:06,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:33:06,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:33:06,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:33:06,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:33:06,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:33:06,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:33:06,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:33:06,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:33:06,295 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:33:06,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:33:06,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:33:06,295 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:33:06,296 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 09:33:06,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:33:06,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:33:06,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:33:06,574 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:33:06,575 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:33:06,576 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i [2022-12-13 09:33:07,672 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:33:07,896 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:33:07,897 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_power.opt.i [2022-12-13 09:33:07,917 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d49b60c/fc00c6c257d846039cf007bfe14f82c3/FLAG7e70d55a5 [2022-12-13 09:33:07,931 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d49b60c/fc00c6c257d846039cf007bfe14f82c3 [2022-12-13 09:33:07,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:33:07,935 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:33:07,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:33:07,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:33:07,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:33:07,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:33:07" (1/1) ... [2022-12-13 09:33:07,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3fddb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:07, skipping insertion in model container [2022-12-13 09:33:07,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:33:07" (1/1) ... [2022-12-13 09:33:07,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:33:08,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:33:08,174 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/safe009_power.opt.i[951,964] [2022-12-13 09:33:08,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:33:08,390 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:33:08,400 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/safe009_power.opt.i[951,964] [2022-12-13 09:33:08,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:33:08,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:33:08,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:33:08,498 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:33:08,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:08 WrapperNode [2022-12-13 09:33:08,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:33:08,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:33:08,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:33:08,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:33:08,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:08" (1/1) ... [2022-12-13 09:33:08,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:08" (1/1) ... [2022-12-13 09:33:08,543 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2022-12-13 09:33:08,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:33:08,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:33:08,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:33:08,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:33:08,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:08" (1/1) ... [2022-12-13 09:33:08,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:08" (1/1) ... [2022-12-13 09:33:08,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:08" (1/1) ... [2022-12-13 09:33:08,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:08" (1/1) ... [2022-12-13 09:33:08,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:08" (1/1) ... [2022-12-13 09:33:08,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:08" (1/1) ... [2022-12-13 09:33:08,569 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:08" (1/1) ... [2022-12-13 09:33:08,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:08" (1/1) ... [2022-12-13 09:33:08,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:33:08,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:33:08,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:33:08,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:33:08,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:08" (1/1) ... [2022-12-13 09:33:08,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:33:08,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:33:08,620 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 09:33:08,644 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 09:33:08,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 09:33:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:33:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:33:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:33:08,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:33:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:33:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:33:08,661 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:33:08,661 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:33:08,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:33:08,662 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:33:08,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:33:08,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:33:08,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:33:08,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:33:08,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:33:08,664 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 09:33:08,832 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:33:08,834 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:33:09,197 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:33:09,514 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:33:09,515 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:33:09,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:33:09 BoogieIcfgContainer [2022-12-13 09:33:09,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:33:09,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:33:09,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:33:09,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:33:09,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:33:07" (1/3) ... [2022-12-13 09:33:09,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3995f074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:33:09, skipping insertion in model container [2022-12-13 09:33:09,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:33:08" (2/3) ... [2022-12-13 09:33:09,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3995f074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:33:09, skipping insertion in model container [2022-12-13 09:33:09,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:33:09" (3/3) ... [2022-12-13 09:33:09,524 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.opt.i [2022-12-13 09:33:09,538 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:33:09,539 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:33:09,539 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:33:09,602 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:33:09,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 09:33:09,700 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 09:33:09,701 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:33:09,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 09:33:09,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 09:33:09,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2022-12-13 09:33:09,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:33:09,729 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-13 09:33:09,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2022-12-13 09:33:09,775 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 09:33:09,775 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:33:09,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 09:33:09,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-13 09:33:09,780 INFO L226 LiptonReduction]: Number of co-enabled transitions 1832 [2022-12-13 09:33:21,263 INFO L241 LiptonReduction]: Total number of compositions: 102 [2022-12-13 09:33:21,278 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:33:21,284 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;@19fa3227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:33:21,284 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 09:33:21,287 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-13 09:33:21,287 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:33:21,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:33:21,288 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 09:33:21,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:33:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:21,293 INFO L85 PathProgramCache]: Analyzing trace with hash 25881098, now seen corresponding path program 1 times [2022-12-13 09:33:21,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:21,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180242808] [2022-12-13 09:33:21,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:21,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:21,670 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 09:33:21,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:21,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180242808] [2022-12-13 09:33:21,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180242808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:33:21,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:33:21,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:33:21,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149888415] [2022-12-13 09:33:21,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:33:21,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:33:21,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:21,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:33:21,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:33:21,695 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 64 [2022-12-13 09:33:21,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:21,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:33:21,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 64 [2022-12-13 09:33:21,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:33:24,044 INFO L130 PetriNetUnfolder]: 9665/14590 cut-off events. [2022-12-13 09:33:24,044 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-13 09:33:24,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28451 conditions, 14590 events. 9665/14590 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 101177 event pairs, 2765 based on Foata normal form. 0/8854 useless extension candidates. Maximal degree in co-relation 28440. Up to 9645 conditions per place. [2022-12-13 09:33:24,089 INFO L137 encePairwiseOnDemand]: 60/64 looper letters, 35 selfloop transitions, 2 changer transitions 61/107 dead transitions. [2022-12-13 09:33:24,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 107 transitions, 423 flow [2022-12-13 09:33:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:33:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2022-12-13 09:33:24,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2022-12-13 09:33:24,101 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 137 flow. Second operand 3 states and 130 transitions. [2022-12-13 09:33:24,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 107 transitions, 423 flow [2022-12-13 09:33:24,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 107 transitions, 418 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:33:24,107 INFO L231 Difference]: Finished difference. Result has 71 places, 31 transitions, 72 flow [2022-12-13 09:33:24,108 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=71, PETRI_TRANSITIONS=31} [2022-12-13 09:33:24,116 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2022-12-13 09:33:24,116 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:33:24,117 INFO L89 Accepts]: Start accepts. Operand has 71 places, 31 transitions, 72 flow [2022-12-13 09:33:24,120 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:33:24,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:33:24,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 31 transitions, 72 flow [2022-12-13 09:33:24,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 72 flow [2022-12-13 09:33:24,140 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 09:33:24,141 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:33:24,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 83 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:33:24,143 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 72 flow [2022-12-13 09:33:24,144 INFO L226 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-13 09:33:24,276 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:33:24,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-13 09:33:24,278 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 72 flow [2022-12-13 09:33:24,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:24,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:33:24,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:33:24,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:33:24,279 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:33:24,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:24,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1836399436, now seen corresponding path program 1 times [2022-12-13 09:33:24,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:24,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028170884] [2022-12-13 09:33:24,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:24,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:24,556 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 09:33:24,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:24,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028170884] [2022-12-13 09:33:24,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028170884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:33:24,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:33:24,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:33:24,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152390608] [2022-12-13 09:33:24,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:33:24,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:33:24,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:24,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:33:24,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:33:24,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 09:33:24,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:24,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:33:24,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 09:33:24,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:33:24,956 INFO L130 PetriNetUnfolder]: 1354/2115 cut-off events. [2022-12-13 09:33:24,956 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-13 09:33:24,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4307 conditions, 2115 events. 1354/2115 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11176 event pairs, 204 based on Foata normal form. 25/1785 useless extension candidates. Maximal degree in co-relation 4297. Up to 1811 conditions per place. [2022-12-13 09:33:24,971 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 34 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-12-13 09:33:24,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 176 flow [2022-12-13 09:33:24,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:33:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 09:33:24,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6881720430107527 [2022-12-13 09:33:24,973 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 72 flow. Second operand 3 states and 64 transitions. [2022-12-13 09:33:24,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 176 flow [2022-12-13 09:33:24,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:33:24,979 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 76 flow [2022-12-13 09:33:24,979 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-12-13 09:33:24,980 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -33 predicate places. [2022-12-13 09:33:24,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:33:24,980 INFO L89 Accepts]: Start accepts. Operand has 41 places, 31 transitions, 76 flow [2022-12-13 09:33:24,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:33:24,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:33:24,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 76 flow [2022-12-13 09:33:24,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 76 flow [2022-12-13 09:33:25,015 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 09:33:25,016 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:33:25,016 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 8. Compared 84 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 09:33:25,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 76 flow [2022-12-13 09:33:25,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-13 09:33:25,090 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:33:25,091 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 09:33:25,091 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 76 flow [2022-12-13 09:33:25,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:25,092 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:33:25,092 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:33:25,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:33:25,092 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:33:25,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:25,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1093806750, now seen corresponding path program 1 times [2022-12-13 09:33:25,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:25,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130424283] [2022-12-13 09:33:25,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:25,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:25,253 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 09:33:25,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:25,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130424283] [2022-12-13 09:33:25,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130424283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:33:25,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:33:25,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:33:25,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637025140] [2022-12-13 09:33:25,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:33:25,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:33:25,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:25,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:33:25,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:33:25,256 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 09:33:25,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:25,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:33:25,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 09:33:25,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:33:25,873 INFO L130 PetriNetUnfolder]: 2553/4042 cut-off events. [2022-12-13 09:33:25,878 INFO L131 PetriNetUnfolder]: For 355/355 co-relation queries the response was YES. [2022-12-13 09:33:25,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8299 conditions, 4042 events. 2553/4042 cut-off events. For 355/355 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22418 event pairs, 407 based on Foata normal form. 150/3528 useless extension candidates. Maximal degree in co-relation 8288. Up to 1963 conditions per place. [2022-12-13 09:33:25,900 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 39 selfloop transitions, 4 changer transitions 9/60 dead transitions. [2022-12-13 09:33:25,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 245 flow [2022-12-13 09:33:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:33:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:33:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-13 09:33:25,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6935483870967742 [2022-12-13 09:33:25,906 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 76 flow. Second operand 4 states and 86 transitions. [2022-12-13 09:33:25,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 245 flow [2022-12-13 09:33:25,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:33:25,908 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 98 flow [2022-12-13 09:33:25,908 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-12-13 09:33:25,909 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -30 predicate places. [2022-12-13 09:33:25,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:33:25,909 INFO L89 Accepts]: Start accepts. Operand has 44 places, 33 transitions, 98 flow [2022-12-13 09:33:25,910 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:33:25,910 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:33:25,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 98 flow [2022-12-13 09:33:25,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 98 flow [2022-12-13 09:33:25,919 INFO L130 PetriNetUnfolder]: 3/51 cut-off events. [2022-12-13 09:33:25,920 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-13 09:33:25,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 51 events. 3/51 cut-off events. For 11/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 173 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 76. Up to 10 conditions per place. [2022-12-13 09:33:25,921 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 98 flow [2022-12-13 09:33:25,921 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 09:33:26,007 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:33:26,008 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99 [2022-12-13 09:33:26,008 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 98 flow [2022-12-13 09:33:26,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:26,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:33:26,009 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:33:26,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:33:26,009 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:33:26,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash 451727153, now seen corresponding path program 1 times [2022-12-13 09:33:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:26,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737118579] [2022-12-13 09:33:26,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:26,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:26,243 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 09:33:26,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:26,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737118579] [2022-12-13 09:33:26,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737118579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:33:26,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:33:26,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:33:26,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861562541] [2022-12-13 09:33:26,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:33:26,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:33:26,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:26,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:33:26,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:33:26,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 09:33:26,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:26,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:33:26,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 09:33:26,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:33:26,647 INFO L130 PetriNetUnfolder]: 1375/2183 cut-off events. [2022-12-13 09:33:26,647 INFO L131 PetriNetUnfolder]: For 969/969 co-relation queries the response was YES. [2022-12-13 09:33:26,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5049 conditions, 2183 events. 1375/2183 cut-off events. For 969/969 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10774 event pairs, 875 based on Foata normal form. 20/1827 useless extension candidates. Maximal degree in co-relation 5036. Up to 1851 conditions per place. [2022-12-13 09:33:26,663 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 34 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2022-12-13 09:33:26,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 206 flow [2022-12-13 09:33:26,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:26,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:33:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 09:33:26,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2022-12-13 09:33:26,664 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 98 flow. Second operand 3 states and 63 transitions. [2022-12-13 09:33:26,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 206 flow [2022-12-13 09:33:26,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 196 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 09:33:26,667 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 99 flow [2022-12-13 09:33:26,667 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-12-13 09:33:26,668 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -29 predicate places. [2022-12-13 09:33:26,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:33:26,668 INFO L89 Accepts]: Start accepts. Operand has 45 places, 33 transitions, 99 flow [2022-12-13 09:33:26,669 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:33:26,669 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:33:26,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 99 flow [2022-12-13 09:33:26,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 99 flow [2022-12-13 09:33:26,679 INFO L130 PetriNetUnfolder]: 3/51 cut-off events. [2022-12-13 09:33:26,680 INFO L131 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2022-12-13 09:33:26,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 51 events. 3/51 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 181 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 74. Up to 10 conditions per place. [2022-12-13 09:33:26,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 33 transitions, 99 flow [2022-12-13 09:33:26,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-13 09:33:26,843 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:33:26,845 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-13 09:33:26,845 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 99 flow [2022-12-13 09:33:26,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:26,845 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:33:26,845 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:33:26,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:33:26,845 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:33:26,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1118838739, now seen corresponding path program 1 times [2022-12-13 09:33:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:26,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012989141] [2022-12-13 09:33:26,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:26,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:27,032 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 09:33:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:27,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012989141] [2022-12-13 09:33:27,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012989141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:33:27,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:33:27,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:33:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762946010] [2022-12-13 09:33:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:33:27,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:33:27,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:27,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:33:27,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:33:27,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 09:33:27,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:27,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:33:27,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 09:33:27,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:33:27,510 INFO L130 PetriNetUnfolder]: 2068/3310 cut-off events. [2022-12-13 09:33:27,511 INFO L131 PetriNetUnfolder]: For 1415/1415 co-relation queries the response was YES. [2022-12-13 09:33:27,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7255 conditions, 3310 events. 2068/3310 cut-off events. For 1415/1415 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18485 event pairs, 848 based on Foata normal form. 100/2795 useless extension candidates. Maximal degree in co-relation 7241. Up to 1671 conditions per place. [2022-12-13 09:33:27,525 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 37 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-13 09:33:27,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 213 flow [2022-12-13 09:33:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:33:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-13 09:33:27,527 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6881720430107527 [2022-12-13 09:33:27,527 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 99 flow. Second operand 3 states and 64 transitions. [2022-12-13 09:33:27,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 213 flow [2022-12-13 09:33:27,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:33:27,529 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 106 flow [2022-12-13 09:33:27,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-12-13 09:33:27,530 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -28 predicate places. [2022-12-13 09:33:27,530 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:33:27,530 INFO L89 Accepts]: Start accepts. Operand has 46 places, 33 transitions, 106 flow [2022-12-13 09:33:27,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:33:27,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:33:27,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 106 flow [2022-12-13 09:33:27,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 33 transitions, 106 flow [2022-12-13 09:33:27,539 INFO L130 PetriNetUnfolder]: 0/53 cut-off events. [2022-12-13 09:33:27,539 INFO L131 PetriNetUnfolder]: For 16/18 co-relation queries the response was YES. [2022-12-13 09:33:27,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 53 events. 0/53 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 201 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-13 09:33:27,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 106 flow [2022-12-13 09:33:27,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-13 09:33:27,688 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:33:27,689 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 09:33:27,690 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 106 flow [2022-12-13 09:33:27,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:27,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:33:27,690 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:33:27,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:33:27,690 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:33:27,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:27,691 INFO L85 PathProgramCache]: Analyzing trace with hash 55605905, now seen corresponding path program 1 times [2022-12-13 09:33:27,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:27,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940942487] [2022-12-13 09:33:27,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:27,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:28,724 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 09:33:28,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:28,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940942487] [2022-12-13 09:33:28,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940942487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:33:28,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:33:28,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:33:28,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180793127] [2022-12-13 09:33:28,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:33:28,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:33:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:28,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:33:28,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:33:28,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2022-12-13 09:33:28,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 09:33:28,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:33:28,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2022-12-13 09:33:28,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:33:29,273 INFO L130 PetriNetUnfolder]: 2052/3335 cut-off events. [2022-12-13 09:33:29,273 INFO L131 PetriNetUnfolder]: For 1593/1613 co-relation queries the response was YES. [2022-12-13 09:33:29,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7340 conditions, 3335 events. 2052/3335 cut-off events. For 1593/1613 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 19240 event pairs, 269 based on Foata normal form. 40/2750 useless extension candidates. Maximal degree in co-relation 7326. Up to 2091 conditions per place. [2022-12-13 09:33:29,291 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 48 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2022-12-13 09:33:29,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 310 flow [2022-12-13 09:33:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:33:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-13 09:33:29,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6645161290322581 [2022-12-13 09:33:29,296 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 106 flow. Second operand 5 states and 103 transitions. [2022-12-13 09:33:29,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 310 flow [2022-12-13 09:33:29,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 299 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 09:33:29,300 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 161 flow [2022-12-13 09:33:29,300 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-12-13 09:33:29,302 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -22 predicate places. [2022-12-13 09:33:29,302 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:33:29,302 INFO L89 Accepts]: Start accepts. Operand has 52 places, 40 transitions, 161 flow [2022-12-13 09:33:29,303 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:33:29,304 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:33:29,304 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 40 transitions, 161 flow [2022-12-13 09:33:29,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 40 transitions, 161 flow [2022-12-13 09:33:29,356 INFO L130 PetriNetUnfolder]: 123/359 cut-off events. [2022-12-13 09:33:29,356 INFO L131 PetriNetUnfolder]: For 257/270 co-relation queries the response was YES. [2022-12-13 09:33:29,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 359 events. 123/359 cut-off events. For 257/270 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2223 event pairs, 59 based on Foata normal form. 1/265 useless extension candidates. Maximal degree in co-relation 747. Up to 193 conditions per place. [2022-12-13 09:33:29,360 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 40 transitions, 161 flow [2022-12-13 09:33:29,360 INFO L226 LiptonReduction]: Number of co-enabled transitions 588 [2022-12-13 09:33:29,582 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L759-->L771: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [813] L851-3-->L853-2: Formula: (and (= (+ |v_#pthreadsForks_61| 1) |v_#pthreadsForks_60|) (not (= |v_ULTIMATE.start_main_~#t1990~0#1.base_60| 0)) (= |v_#valid_165| (store |v_#valid_166| |v_ULTIMATE.start_main_~#t1990~0#1.base_60| 1)) (= |v_#pthreadsForks_61| |v_ULTIMATE.start_main_#t~pre32#1_55|) (= |v_ULTIMATE.start_main_~#t1990~0#1.offset_42| 0) (= (select |v_#valid_166| |v_ULTIMATE.start_main_~#t1990~0#1.base_60|) 0) (< |v_#StackHeapBarrier_43| |v_ULTIMATE.start_main_~#t1990~0#1.base_60|) (= (store |v_#memory_int_366| |v_ULTIMATE.start_main_~#t1990~0#1.base_60| (store (select |v_#memory_int_366| |v_ULTIMATE.start_main_~#t1990~0#1.base_60|) |v_ULTIMATE.start_main_~#t1990~0#1.offset_42| |v_ULTIMATE.start_main_#t~pre32#1_55|)) |v_#memory_int_365|) (= (store |v_#length_85| |v_ULTIMATE.start_main_~#t1990~0#1.base_60| 4) |v_#length_84|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_43|, #pthreadsForks=|v_#pthreadsForks_61|, #valid=|v_#valid_166|, #memory_int=|v_#memory_int_366|, #length=|v_#length_85|} OutVars{ULTIMATE.start_main_~#t1990~0#1.base=|v_ULTIMATE.start_main_~#t1990~0#1.base_60|, #StackHeapBarrier=|v_#StackHeapBarrier_43|, #pthreadsForks=|v_#pthreadsForks_60|, ULTIMATE.start_main_~#t1990~0#1.offset=|v_ULTIMATE.start_main_~#t1990~0#1.offset_42|, #valid=|v_#valid_165|, #memory_int=|v_#memory_int_365|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_21|, #length=|v_#length_84|, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_55|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1990~0#1.base, #pthreadsForks, ULTIMATE.start_main_~#t1990~0#1.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet31#1, #length, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_#t~pre30#1] [2022-12-13 09:33:29,792 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L759-->L771: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [670] L824-->L831: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd3~0_35 256) 0))) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_203 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd3~0_37 256) 0)) (.cse7 (= (mod v_~x$w_buff1_used~0_184 256) 0)) (.cse1 (not .cse10)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_202 256) 0)))) (let ((.cse3 (and .cse1 .cse4)) (.cse2 (select |v_#memory_int_196| |v_~#x~0.base_134|)) (.cse6 (not .cse7)) (.cse5 (not .cse8)) (.cse0 (not .cse11))) (and (= (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_203) v_~x$w_buff0_used~0_202) (= (store |v_#memory_int_196| |v_~#x~0.base_134| (store .cse2 |v_~#x~0.offset_134| |v_P2_#t~ite27_31|)) |v_#memory_int_195|) (= v_~x$r_buff0_thd3~0_34 (ite .cse3 0 v_~x$r_buff0_thd3~0_35)) (= v_~x$r_buff1_thd3~0_36 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_34 256) 0)) .cse4) (and (not (= (mod v_~x$w_buff1_used~0_183 256) 0)) .cse5)) 0 v_~x$r_buff1_thd3~0_37)) (= (ite (or .cse3 (and .cse6 .cse5)) 0 v_~x$w_buff1_used~0_184) v_~x$w_buff1_used~0_183) (let ((.cse9 (= |v_P2_#t~mem25_28| |v_P2Thread1of1ForFork1_#t~mem25_1|))) (or (and (or (and (or .cse7 .cse8) (= (select .cse2 |v_~#x~0.offset_134|) |v_P2_#t~mem25_28|) (= |v_P2_#t~ite26_31| |v_P2_#t~mem25_28|)) (and (= |v_P2_#t~ite26_31| v_~x$w_buff1~0_81) .cse9 .cse6 .cse5)) (= |v_P2_#t~ite26_31| |v_P2_#t~ite27_31|) (or .cse10 .cse11)) (and (= |v_P2_#t~ite26_31| |v_P2Thread1of1ForFork1_#t~ite26_1|) .cse9 (= |v_P2_#t~ite27_31| v_~x$w_buff0~0_76) .cse0 .cse1))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_76, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_1|, ~#x~0.offset=|v_~#x~0.offset_134|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_1|, ~x$w_buff1~0=v_~x$w_buff1~0_81, #memory_int=|v_#memory_int_196|, ~#x~0.base=|v_~#x~0.base_134|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_184, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_35, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_203} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_76, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_1|, ~#x~0.offset=|v_~#x~0.offset_134|, ~x$w_buff1~0=v_~x$w_buff1~0_81, #memory_int=|v_#memory_int_195|, ~#x~0.base=|v_~#x~0.base_134|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_36, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_183, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_202} AuxVars[|v_P2_#t~ite27_31|, |v_P2_#t~ite26_31|, |v_P2_#t~mem25_28|] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P2Thread1of1ForFork1_#t~mem25, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-13 09:33:30,247 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L759-->L771: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [690] L2-1-->L864: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd0~0_41 256) 0))) (let ((.cse10 (= (mod v_~x$w_buff1_used~0_228 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd0~0_45 256) 0)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_256 256) 0))) (.cse3 (not .cse6)) (.cse7 (= (mod v_~x$w_buff0_used~0_257 256) 0))) (let ((.cse4 (not .cse7)) (.cse9 (select |v_#memory_int_236| |v_~#x~0.base_160|)) (.cse2 (and .cse0 .cse3)) (.cse1 (not .cse11)) (.cse8 (not .cse10))) (and (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_40 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_227 256) 0)))) 0 v_~x$r_buff1_thd0~0_45) v_~x$r_buff1_thd0~0_44) (= (ite .cse2 0 v_~x$r_buff0_thd0~0_41) v_~x$r_buff0_thd0~0_40) (= (ite (and .cse3 .cse4) 0 v_~x$w_buff0_used~0_257) v_~x$w_buff0_used~0_256) (let ((.cse5 (= |v_ULTIMATE.start_main_#t~mem34#1_33| |v_ULTIMATE.start_main_#t~mem34#1_31|))) (or (and .cse5 .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite35#1_28| |v_ULTIMATE.start_main_#t~ite35#1_30|) (= |v_ULTIMATE.start_main_#t~ite36#1_31| v_~x$w_buff0~0_124)) (and (or .cse6 .cse7) (or (and (= |v_ULTIMATE.start_main_#t~ite35#1_28| v_~x$w_buff1~0_115) .cse5 .cse1 .cse8) (and (= |v_ULTIMATE.start_main_#t~ite35#1_28| |v_ULTIMATE.start_main_#t~mem34#1_31|) (= (select .cse9 |v_~#x~0.offset_160|) |v_ULTIMATE.start_main_#t~mem34#1_31|) (or .cse10 .cse11))) (= |v_ULTIMATE.start_main_#t~ite35#1_28| |v_ULTIMATE.start_main_#t~ite36#1_31|)))) (= (store |v_#memory_int_236| |v_~#x~0.base_160| (store .cse9 |v_~#x~0.offset_160| |v_ULTIMATE.start_main_#t~ite36#1_31|)) |v_#memory_int_235|) (= (ite (or .cse2 (and .cse1 .cse8)) 0 v_~x$w_buff1_used~0_228) v_~x$w_buff1_used~0_227))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_124, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_41, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_30|, ~#x~0.offset=|v_~#x~0.offset_160|, ~x$w_buff1~0=v_~x$w_buff1~0_115, #memory_int=|v_#memory_int_236|, ~#x~0.base=|v_~#x~0.base_160|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_228, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_33|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_257} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_124, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_40, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_30|, ~#x~0.offset=|v_~#x~0.offset_160|, ~x$w_buff1~0=v_~x$w_buff1~0_115, #memory_int=|v_#memory_int_235|, ~#x~0.base=|v_~#x~0.base_160|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_227, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_44, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_256} AuxVars[|v_ULTIMATE.start_main_#t~ite35#1_28|, |v_ULTIMATE.start_main_#t~ite36#1_31|, |v_ULTIMATE.start_main_#t~mem34#1_31|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35#1, ULTIMATE.start_main_#t~ite36#1, #memory_int, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~mem34#1, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-13 09:33:30,679 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [656] L759-->L771: Formula: (and (= v_~x$w_buff0~0_Out_2 1) (= v_~x$w_buff0_used~0_Out_2 1) (= v_~x$r_buff0_thd1~0_Out_2 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_Out_2 256) 0)) (not (= (mod v_~x$w_buff0_used~0_Out_2 256) 0)))) 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3| 0)) (= v_~x$w_buff1_used~0_Out_2 v_~x$w_buff0_used~0_In_17) (= v_~x$r_buff0_thd3~0_In_3 v_~x$r_buff1_thd3~0_Out_2) (= v_~x$r_buff1_thd0~0_Out_2 v_~x$r_buff0_thd0~0_In_3) (= v_~x$r_buff0_thd1~0_In_3 v_~x$r_buff1_thd1~0_Out_2) (= v_~x$r_buff1_thd2~0_Out_2 v_~x$r_buff0_thd2~0_In_11) (= v_~x$w_buff1~0_Out_2 v_~x$w_buff0~0_In_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_21, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_In_3, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_17} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_Out_2, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_Out_2, ~x$w_buff1~0=v_~x$w_buff1~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_Out_2, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_Out_2, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_2, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_Out_2, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_In_3, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_In_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_2, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_3|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~x$w_buff1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [664] L807-->L814: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd2~0_88 256) 0))) (let ((.cse10 (= (mod v_~x$w_buff0_used~0_179 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_156 256) 0)) (.cse7 (= (mod v_~x$r_buff1_thd2~0_78 256) 0)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_178 256) 0))) (.cse5 (not .cse11))) (let ((.cse1 (and .cse6 .cse5)) (.cse0 (select |v_#memory_int_158| |v_~#x~0.base_110|)) (.cse2 (not .cse7)) (.cse3 (not .cse8)) (.cse4 (not .cse10))) (and (= (store |v_#memory_int_158| |v_~#x~0.base_110| (store .cse0 |v_~#x~0.offset_110| |v_P1_#t~ite24_25|)) |v_#memory_int_157|) (= (ite (or .cse1 (and .cse2 .cse3)) 0 v_~x$w_buff1_used~0_156) v_~x$w_buff1_used~0_155) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_179) v_~x$w_buff0_used~0_178) (= v_~x$r_buff1_thd2~0_77 (ite (or (and .cse6 (not (= 0 (mod v_~x$r_buff0_thd2~0_87 256)))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_155 256) 0)))) 0 v_~x$r_buff1_thd2~0_78)) (= v_~x$r_buff0_thd2~0_87 (ite .cse1 0 v_~x$r_buff0_thd2~0_88)) (let ((.cse9 (= |v_P1Thread1of1ForFork0_#t~mem22_1| |v_P1_#t~mem22_32|))) (or (and (= |v_P1_#t~ite23_29| |v_P1_#t~ite24_25|) (or (and (= |v_P1_#t~ite23_29| |v_P1_#t~mem22_32|) (= (select .cse0 |v_~#x~0.offset_110|) |v_P1_#t~mem22_32|) (or .cse7 .cse8)) (and (= |v_P1_#t~ite23_29| v_~x$w_buff1~0_57) .cse2 .cse9 .cse3)) (or .cse10 .cse11)) (and (= |v_P1_#t~ite24_25| v_~x$w_buff0~0_64) .cse4 (= |v_P1_#t~ite23_29| |v_P1Thread1of1ForFork0_#t~ite23_1|) .cse9 .cse5))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_1|, ~#x~0.offset=|v_~#x~0.offset_110|, ~x$w_buff1~0=v_~x$w_buff1~0_57, #memory_int=|v_#memory_int_158|, ~#x~0.base=|v_~#x~0.base_110|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_156, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_179} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~#x~0.offset=|v_~#x~0.offset_110|, ~x$w_buff1~0=v_~x$w_buff1~0_57, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_157|, ~#x~0.base=|v_~#x~0.base_110|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_77, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_178} AuxVars[|v_P1_#t~ite24_25|, |v_P1_#t~mem22_32|, |v_P1_#t~ite23_29|] AssignedVars[P1Thread1of1ForFork0_#t~mem22, P1Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0] [2022-12-13 09:33:31,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:33:31,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2070 [2022-12-13 09:33:31,372 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 173 flow [2022-12-13 09:33:31,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 09:33:31,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:33:31,373 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:33:31,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:33:31,373 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:33:31,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash 634121003, now seen corresponding path program 1 times [2022-12-13 09:33:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:31,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95678475] [2022-12-13 09:33:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:32,246 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 09:33:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:32,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95678475] [2022-12-13 09:33:32,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95678475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:33:32,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:33:32,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:33:32,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030615910] [2022-12-13 09:33:32,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:33:32,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:33:32,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:32,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:33:32,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:33:32,249 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2022-12-13 09:33:32,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 09:33:32,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:33:32,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2022-12-13 09:33:32,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:33:32,846 INFO L130 PetriNetUnfolder]: 1900/3062 cut-off events. [2022-12-13 09:33:32,846 INFO L131 PetriNetUnfolder]: For 2730/2758 co-relation queries the response was YES. [2022-12-13 09:33:32,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8439 conditions, 3062 events. 1900/3062 cut-off events. For 2730/2758 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 17297 event pairs, 905 based on Foata normal form. 4/2504 useless extension candidates. Maximal degree in co-relation 8421. Up to 2752 conditions per place. [2022-12-13 09:33:32,870 INFO L137 encePairwiseOnDemand]: 23/36 looper letters, 42 selfloop transitions, 17 changer transitions 0/69 dead transitions. [2022-12-13 09:33:32,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 434 flow [2022-12-13 09:33:32,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:33:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-13 09:33:32,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-13 09:33:32,872 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 173 flow. Second operand 5 states and 102 transitions. [2022-12-13 09:33:32,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 434 flow [2022-12-13 09:33:32,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 421 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:33:32,878 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 329 flow [2022-12-13 09:33:32,878 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2022-12-13 09:33:32,879 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -17 predicate places. [2022-12-13 09:33:32,879 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:33:32,879 INFO L89 Accepts]: Start accepts. Operand has 57 places, 55 transitions, 329 flow [2022-12-13 09:33:32,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:33:32,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:33:32,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 55 transitions, 329 flow [2022-12-13 09:33:32,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 55 transitions, 329 flow [2022-12-13 09:33:32,949 INFO L130 PetriNetUnfolder]: 124/363 cut-off events. [2022-12-13 09:33:32,950 INFO L131 PetriNetUnfolder]: For 500/527 co-relation queries the response was YES. [2022-12-13 09:33:32,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 363 events. 124/363 cut-off events. For 500/527 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2268 event pairs, 23 based on Foata normal form. 6/275 useless extension candidates. Maximal degree in co-relation 974. Up to 195 conditions per place. [2022-12-13 09:33:32,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 55 transitions, 329 flow [2022-12-13 09:33:32,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 702 [2022-12-13 09:33:32,958 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:33:32,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-13 09:33:32,962 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 329 flow [2022-12-13 09:33:32,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 09:33:32,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:33:32,963 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:33:32,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:33:32,963 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:33:32,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:32,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1817085895, now seen corresponding path program 1 times [2022-12-13 09:33:32,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:32,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772720978] [2022-12-13 09:33:32,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:32,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:33,140 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 09:33:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:33,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772720978] [2022-12-13 09:33:33,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772720978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:33:33,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:33:33,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:33:33,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216979956] [2022-12-13 09:33:33,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:33:33,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:33:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:33,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:33:33,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:33:33,142 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2022-12-13 09:33:33,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:33,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:33:33,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2022-12-13 09:33:33,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:33:33,638 INFO L130 PetriNetUnfolder]: 2810/4309 cut-off events. [2022-12-13 09:33:33,638 INFO L131 PetriNetUnfolder]: For 7558/7592 co-relation queries the response was YES. [2022-12-13 09:33:33,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13227 conditions, 4309 events. 2810/4309 cut-off events. For 7558/7592 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 23551 event pairs, 781 based on Foata normal form. 50/3004 useless extension candidates. Maximal degree in co-relation 13205. Up to 4123 conditions per place. [2022-12-13 09:33:33,662 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 57 selfloop transitions, 10 changer transitions 0/74 dead transitions. [2022-12-13 09:33:33,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 540 flow [2022-12-13 09:33:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:33:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:33:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-12-13 09:33:33,663 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2022-12-13 09:33:33,664 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 329 flow. Second operand 3 states and 71 transitions. [2022-12-13 09:33:33,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 540 flow [2022-12-13 09:33:33,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 534 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-13 09:33:33,672 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 358 flow [2022-12-13 09:33:33,672 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2022-12-13 09:33:33,672 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -14 predicate places. [2022-12-13 09:33:33,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:33:33,673 INFO L89 Accepts]: Start accepts. Operand has 60 places, 60 transitions, 358 flow [2022-12-13 09:33:33,691 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:33:33,692 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:33:33,692 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 60 transitions, 358 flow [2022-12-13 09:33:33,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 60 transitions, 358 flow [2022-12-13 09:33:33,914 INFO L130 PetriNetUnfolder]: 1178/2267 cut-off events. [2022-12-13 09:33:33,914 INFO L131 PetriNetUnfolder]: For 2285/2416 co-relation queries the response was YES. [2022-12-13 09:33:33,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6069 conditions, 2267 events. 1178/2267 cut-off events. For 2285/2416 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 17324 event pairs, 534 based on Foata normal form. 3/1337 useless extension candidates. Maximal degree in co-relation 6047. Up to 1456 conditions per place. [2022-12-13 09:33:33,938 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 60 transitions, 358 flow [2022-12-13 09:33:33,938 INFO L226 LiptonReduction]: Number of co-enabled transitions 738 [2022-12-13 09:33:33,949 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [830] L759-->L853-2: Formula: (and (= (select |v_#valid_260| |v_ULTIMATE.start_main_~#t1990~0#1.base_99|) 0) (= v_~x$r_buff0_thd1~0_287 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_663 256) 0)) (not (= (mod v_~x$w_buff0_used~0_728 256) 0)))) 1 0)) (= v_~x$r_buff0_thd3~0_158 v_~x$r_buff1_thd3~0_161) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_63| 0)) (< |v_#StackHeapBarrier_58| |v_ULTIMATE.start_main_~#t1990~0#1.base_99|) (= v_~x$w_buff0~0_432 1) (= v_~x$w_buff0_used~0_728 1) (= v_~x$r_buff0_thd1~0_288 v_~x$r_buff1_thd1~0_232) (= (store |v_#valid_260| |v_ULTIMATE.start_main_~#t1990~0#1.base_99| 1) |v_#valid_259|) (= v_~x$r_buff0_thd2~0_325 v_~x$r_buff1_thd2~0_332) (= (store |v_#memory_int_736| |v_ULTIMATE.start_main_~#t1990~0#1.base_99| (store (select |v_#memory_int_736| |v_ULTIMATE.start_main_~#t1990~0#1.base_99|) |v_ULTIMATE.start_main_~#t1990~0#1.offset_65| |v_ULTIMATE.start_main_#t~pre32#1_98|)) |v_#memory_int_735|) (not (= |v_ULTIMATE.start_main_~#t1990~0#1.base_99| 0)) (= v_~x$w_buff0_used~0_729 v_~x$w_buff1_used~0_663) (= (store |v_#length_115| |v_ULTIMATE.start_main_~#t1990~0#1.base_99| 4) |v_#length_114|) (= v_~x$r_buff0_thd0~0_199 v_~x$r_buff1_thd0~0_219) (= |v_#pthreadsForks_90| (+ |v_#pthreadsForks_91| 1)) (= v_~x$w_buff0~0_433 v_~x$w_buff1~0_393) (= |v_ULTIMATE.start_main_~#t1990~0#1.offset_65| 0) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|) (= |v_#pthreadsForks_91| |v_ULTIMATE.start_main_#t~pre32#1_98|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_433, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_199, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_288, #pthreadsForks=|v_#pthreadsForks_91|, #valid=|v_#valid_260|, #memory_int=|v_#memory_int_736|, #length=|v_#length_115|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_158, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_325, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_729} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_199, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_287, ULTIMATE.start_main_~#t1990~0#1.offset=|v_ULTIMATE.start_main_~#t1990~0#1.offset_65|, ~x$w_buff1~0=v_~x$w_buff1~0_393, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_32|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_161, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_332, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_663, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_158, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_325, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_219, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_98|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_50|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_728, ULTIMATE.start_main_~#t1990~0#1.base=|v_ULTIMATE.start_main_~#t1990~0#1.base_99|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|, #pthreadsForks=|v_#pthreadsForks_90|, #valid=|v_#valid_259|, #memory_int=|v_#memory_int_735|, #length=|v_#length_114|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1990~0#1.offset, ~x$w_buff1~0, ULTIMATE.start_main_#t~nondet31#1, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_#t~pre30#1, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1990~0#1.base, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #pthreadsForks, #valid, #memory_int, #length] and [664] L807-->L814: Formula: (let ((.cse11 (= (mod v_~x$r_buff0_thd2~0_88 256) 0))) (let ((.cse10 (= (mod v_~x$w_buff0_used~0_179 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_156 256) 0)) (.cse7 (= (mod v_~x$r_buff1_thd2~0_78 256) 0)) (.cse6 (not (= (mod v_~x$w_buff0_used~0_178 256) 0))) (.cse5 (not .cse11))) (let ((.cse1 (and .cse6 .cse5)) (.cse0 (select |v_#memory_int_158| |v_~#x~0.base_110|)) (.cse2 (not .cse7)) (.cse3 (not .cse8)) (.cse4 (not .cse10))) (and (= (store |v_#memory_int_158| |v_~#x~0.base_110| (store .cse0 |v_~#x~0.offset_110| |v_P1_#t~ite24_25|)) |v_#memory_int_157|) (= (ite (or .cse1 (and .cse2 .cse3)) 0 v_~x$w_buff1_used~0_156) v_~x$w_buff1_used~0_155) (= (ite (and .cse4 .cse5) 0 v_~x$w_buff0_used~0_179) v_~x$w_buff0_used~0_178) (= v_~x$r_buff1_thd2~0_77 (ite (or (and .cse6 (not (= 0 (mod v_~x$r_buff0_thd2~0_87 256)))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_155 256) 0)))) 0 v_~x$r_buff1_thd2~0_78)) (= v_~x$r_buff0_thd2~0_87 (ite .cse1 0 v_~x$r_buff0_thd2~0_88)) (let ((.cse9 (= |v_P1Thread1of1ForFork0_#t~mem22_1| |v_P1_#t~mem22_32|))) (or (and (= |v_P1_#t~ite23_29| |v_P1_#t~ite24_25|) (or (and (= |v_P1_#t~ite23_29| |v_P1_#t~mem22_32|) (= (select .cse0 |v_~#x~0.offset_110|) |v_P1_#t~mem22_32|) (or .cse7 .cse8)) (and (= |v_P1_#t~ite23_29| v_~x$w_buff1~0_57) .cse2 .cse9 .cse3)) (or .cse10 .cse11)) (and (= |v_P1_#t~ite24_25| v_~x$w_buff0~0_64) .cse4 (= |v_P1_#t~ite23_29| |v_P1Thread1of1ForFork0_#t~ite23_1|) .cse9 .cse5))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_1|, ~#x~0.offset=|v_~#x~0.offset_110|, ~x$w_buff1~0=v_~x$w_buff1~0_57, #memory_int=|v_#memory_int_158|, ~#x~0.base=|v_~#x~0.base_110|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_78, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_156, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_1|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_179} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~#x~0.offset=|v_~#x~0.offset_110|, ~x$w_buff1~0=v_~x$w_buff1~0_57, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_1|, #memory_int=|v_#memory_int_157|, ~#x~0.base=|v_~#x~0.base_110|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_77, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_178} AuxVars[|v_P1_#t~ite24_25|, |v_P1_#t~mem22_32|, |v_P1_#t~ite23_29|] AssignedVars[P1Thread1of1ForFork0_#t~mem22, P1Thread1of1ForFork0_#t~ite24, #memory_int, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0] [2022-12-13 09:33:34,643 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [830] L759-->L853-2: Formula: (and (= (select |v_#valid_260| |v_ULTIMATE.start_main_~#t1990~0#1.base_99|) 0) (= v_~x$r_buff0_thd1~0_287 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_663 256) 0)) (not (= (mod v_~x$w_buff0_used~0_728 256) 0)))) 1 0)) (= v_~x$r_buff0_thd3~0_158 v_~x$r_buff1_thd3~0_161) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_63| 0)) (< |v_#StackHeapBarrier_58| |v_ULTIMATE.start_main_~#t1990~0#1.base_99|) (= v_~x$w_buff0~0_432 1) (= v_~x$w_buff0_used~0_728 1) (= v_~x$r_buff0_thd1~0_288 v_~x$r_buff1_thd1~0_232) (= (store |v_#valid_260| |v_ULTIMATE.start_main_~#t1990~0#1.base_99| 1) |v_#valid_259|) (= v_~x$r_buff0_thd2~0_325 v_~x$r_buff1_thd2~0_332) (= (store |v_#memory_int_736| |v_ULTIMATE.start_main_~#t1990~0#1.base_99| (store (select |v_#memory_int_736| |v_ULTIMATE.start_main_~#t1990~0#1.base_99|) |v_ULTIMATE.start_main_~#t1990~0#1.offset_65| |v_ULTIMATE.start_main_#t~pre32#1_98|)) |v_#memory_int_735|) (not (= |v_ULTIMATE.start_main_~#t1990~0#1.base_99| 0)) (= v_~x$w_buff0_used~0_729 v_~x$w_buff1_used~0_663) (= (store |v_#length_115| |v_ULTIMATE.start_main_~#t1990~0#1.base_99| 4) |v_#length_114|) (= v_~x$r_buff0_thd0~0_199 v_~x$r_buff1_thd0~0_219) (= |v_#pthreadsForks_90| (+ |v_#pthreadsForks_91| 1)) (= v_~x$w_buff0~0_433 v_~x$w_buff1~0_393) (= |v_ULTIMATE.start_main_~#t1990~0#1.offset_65| 0) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|) (= |v_#pthreadsForks_91| |v_ULTIMATE.start_main_#t~pre32#1_98|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_433, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_199, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_288, #pthreadsForks=|v_#pthreadsForks_91|, #valid=|v_#valid_260|, #memory_int=|v_#memory_int_736|, #length=|v_#length_115|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_158, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_325, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_729} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_199, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_287, ULTIMATE.start_main_~#t1990~0#1.offset=|v_ULTIMATE.start_main_~#t1990~0#1.offset_65|, ~x$w_buff1~0=v_~x$w_buff1~0_393, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_32|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_161, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_332, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_663, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_158, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_325, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_219, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_98|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_50|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_728, ULTIMATE.start_main_~#t1990~0#1.base=|v_ULTIMATE.start_main_~#t1990~0#1.base_99|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|, #pthreadsForks=|v_#pthreadsForks_90|, #valid=|v_#valid_259|, #memory_int=|v_#memory_int_735|, #length=|v_#length_114|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1990~0#1.offset, ~x$w_buff1~0, ULTIMATE.start_main_#t~nondet31#1, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_#t~pre30#1, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1990~0#1.base, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #pthreadsForks, #valid, #memory_int, #length] and [657] L771-->L778: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse7 (= (mod v_~x$r_buff1_thd1~0_37 256) 0)) (.cse0 (not .cse9)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_196 256) 0))) (.cse10 (= (mod v_~x$w_buff0_used~0_197 256) 0)) (.cse6 (= (mod v_~x$w_buff1_used~0_176 256) 0))) (let ((.cse3 (not .cse6)) (.cse1 (not .cse10)) (.cse2 (and .cse0 .cse11)) (.cse4 (not .cse7)) (.cse5 (select |v_#memory_int_188| |v_~#x~0.base_128|))) (and (= v_~x$w_buff0_used~0_196 (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_197)) (= (ite (or .cse2 (and .cse3 .cse4)) 0 v_~x$w_buff1_used~0_176) v_~x$w_buff1_used~0_175) (let ((.cse8 (= |v_P0_#t~mem3#1_36| |v_P0Thread1of1ForFork2_#t~mem3#1_1|))) (or (and (or (and (= |v_P0_#t~mem3#1_36| (select .cse5 |v_~#x~0.offset_128|)) (or .cse6 .cse7) (= |v_P0_#t~mem3#1_36| |v_P0_#t~ite4#1_33|)) (and .cse3 .cse8 .cse4 (= |v_P0_#t~ite4#1_33| v_~x$w_buff1~0_75))) (= |v_P0_#t~ite4#1_33| |v_P0_#t~ite5#1_31|) (or .cse9 .cse10)) (and .cse0 .cse1 (= |v_P0_#t~ite5#1_31| v_~x$w_buff0~0_74) (= |v_P0_#t~ite4#1_33| |v_P0Thread1of1ForFork2_#t~ite4#1_1|) .cse8))) (= (ite .cse2 0 v_~x$r_buff0_thd1~0_44) v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd1~0_36 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse11) (and (not (= (mod v_~x$w_buff1_used~0_175 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_37)) (= (store |v_#memory_int_188| |v_~#x~0.base_128| (store .cse5 |v_~#x~0.offset_128| |v_P0_#t~ite5#1_31|)) |v_#memory_int_187|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_74, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~#x~0.offset=|v_~#x~0.offset_128|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_188|, ~#x~0.base=|v_~#x~0.base_128|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_176, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_197} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_74, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~#x~0.offset=|v_~#x~0.offset_128|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_187|, ~#x~0.base=|v_~#x~0.base_128|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_36, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_196} AuxVars[|v_P0_#t~mem3#1_36|, |v_P0_#t~ite5#1_31|, |v_P0_#t~ite4#1_33|] AssignedVars[~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, P0Thread1of1ForFork2_#t~ite4#1, P0Thread1of1ForFork2_#t~ite5#1, ~x$w_buff0_used~0] [2022-12-13 09:33:35,136 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:33:35,137 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1465 [2022-12-13 09:33:35,137 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 376 flow [2022-12-13 09:33:35,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:35,137 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:33:35,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:33:35,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:33:35,137 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:33:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1414679205, now seen corresponding path program 1 times [2022-12-13 09:33:35,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:35,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705328531] [2022-12-13 09:33:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:35,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:35,288 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 09:33:35,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:35,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705328531] [2022-12-13 09:33:35,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705328531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:33:35,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:33:35,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:33:35,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538040909] [2022-12-13 09:33:35,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:33:35,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:33:35,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:35,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:33:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:33:35,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2022-12-13 09:33:35,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 376 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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 09:33:35,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:33:35,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2022-12-13 09:33:35,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:33:35,656 INFO L130 PetriNetUnfolder]: 1435/2518 cut-off events. [2022-12-13 09:33:35,656 INFO L131 PetriNetUnfolder]: For 4168/4190 co-relation queries the response was YES. [2022-12-13 09:33:35,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9374 conditions, 2518 events. 1435/2518 cut-off events. For 4168/4190 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 15126 event pairs, 162 based on Foata normal form. 157/1907 useless extension candidates. Maximal degree in co-relation 9349. Up to 1873 conditions per place. [2022-12-13 09:33:35,671 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 66 selfloop transitions, 19 changer transitions 0/92 dead transitions. [2022-12-13 09:33:35,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 92 transitions, 721 flow [2022-12-13 09:33:35,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:33:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:33:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-12-13 09:33:35,673 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6381578947368421 [2022-12-13 09:33:35,673 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 376 flow. Second operand 4 states and 97 transitions. [2022-12-13 09:33:35,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 92 transitions, 721 flow [2022-12-13 09:33:35,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 707 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 09:33:35,679 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 474 flow [2022-12-13 09:33:35,679 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=474, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2022-12-13 09:33:35,680 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2022-12-13 09:33:35,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:33:35,680 INFO L89 Accepts]: Start accepts. Operand has 63 places, 69 transitions, 474 flow [2022-12-13 09:33:35,681 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:33:35,681 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:33:35,681 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 69 transitions, 474 flow [2022-12-13 09:33:35,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 69 transitions, 474 flow [2022-12-13 09:33:35,883 INFO L130 PetriNetUnfolder]: 605/1424 cut-off events. [2022-12-13 09:33:35,883 INFO L131 PetriNetUnfolder]: For 2035/2237 co-relation queries the response was YES. [2022-12-13 09:33:35,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5067 conditions, 1424 events. 605/1424 cut-off events. For 2035/2237 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 11211 event pairs, 138 based on Foata normal form. 16/897 useless extension candidates. Maximal degree in co-relation 5043. Up to 907 conditions per place. [2022-12-13 09:33:35,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 69 transitions, 474 flow [2022-12-13 09:33:35,897 INFO L226 LiptonReduction]: Number of co-enabled transitions 710 [2022-12-13 09:33:36,531 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [816] L853-3-->L2-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [837] L759-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (= (mod v_~x$r_buff0_thd0~0_216 256) 0))) (let ((.cse7 (not (= (mod v_~x$w_buff0_used~0_774 256) 0))) (.cse2 (not .cse0))) (let ((.cse1 (select |v_#memory_int_774| |v_~#x~0.base_371|)) (.cse3 (= (mod v_~x$w_buff0_used~0_775 256) 0)) (.cse8 (and .cse7 .cse2))) (and (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_376 1) (= v_~y~0_197 2) (= 2 v_~__unbuffered_p0_EAX~0_182))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_178) (= v_~x$w_buff0~0_464 1) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_147| (mod v_~main$tmp_guard1~0_178 256)) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite35#1_215| |v_ULTIMATE.start_main_#t~ite36#1_167|) (= |v_ULTIMATE.start_main_#t~mem34#1_218| |v_ULTIMATE.start_main_#t~ite35#1_215|) (= |v_ULTIMATE.start_main_#t~mem34#1_218| (select .cse1 |v_~#x~0.offset_371|))) (and (= |v_ULTIMATE.start_main_#t~ite35#1_217| |v_ULTIMATE.start_main_#t~ite35#1_215|) (= |v_ULTIMATE.start_main_#t~mem34#1_218| |v_ULTIMATE.start_main_#t~mem34#1_220|) (= v_~x$w_buff0~0_464 |v_ULTIMATE.start_main_#t~ite36#1_167|) .cse2)) (= (ite .cse3 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_77|) (= v_~x$r_buff0_thd1~0_323 1) (= v_~x$r_buff0_thd3~0_174 v_~x$r_buff1_thd3~0_177) (= (store |v_#memory_int_774| |v_~#x~0.base_371| (store .cse1 |v_~#x~0.offset_371| |v_ULTIMATE.start_main_#t~ite36#1_167|)) |v_#memory_int_773|) (= v_~x$r_buff0_thd2~0_347 v_~x$r_buff1_thd2~0_354) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_147| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_151|) (let ((.cse4 (= (mod v_~__unbuffered_p1_EAX$read_delayed~0_220 256) 0)) (.cse5 (= |v_ULTIMATE.start_main_#t~mem38#1_446| |v_ULTIMATE.start_main_#t~mem38#1_444|))) (or (and (= v_~__unbuffered_p1_EAX~0_377 v_~__unbuffered_p1_EAX~0_376) .cse4 (= |v_ULTIMATE.start_main_#t~ite39#1_447| |v_ULTIMATE.start_main_#t~ite39#1_445|) .cse5) (and (not .cse4) (= v_~__unbuffered_p1_EAX~0_376 |v_ULTIMATE.start_main_#t~ite39#1_445|) (let ((.cse6 (= (mod v_~weak$$choice1~0_265 256) 0))) (or (and (= v_~__unbuffered_p1_EAX~0_377 |v_ULTIMATE.start_main_#t~ite39#1_445|) .cse5 .cse6) (and (= |v_ULTIMATE.start_main_#t~mem38#1_444| (select (select |v_#memory_int_773| v_~__unbuffered_p1_EAX$read_delayed_var~0.base_213) v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_213)) (not .cse6) (= |v_ULTIMATE.start_main_#t~ite39#1_445| |v_ULTIMATE.start_main_#t~mem38#1_444|))))))) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_77| 0)) (= v_~x$r_buff1_thd0~0_235 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_695 256) 0))) (and .cse7 (not (= (mod v_~x$r_buff0_thd0~0_215 256) 0)))) 0 v_~x$r_buff0_thd0~0_216)) (= v_~x$r_buff0_thd1~0_324 v_~x$r_buff1_thd1~0_254) (= v_~x$w_buff1_used~0_695 (ite (or (and .cse2 (not .cse3)) .cse8) 0 v_~x$w_buff0_used~0_775)) (= (ite .cse2 0 1) v_~x$w_buff0_used~0_774) (= v_~x$w_buff0~0_465 v_~x$w_buff1~0_411) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_151| 0) (= (ite .cse8 0 v_~x$r_buff0_thd0~0_216) v_~x$r_buff0_thd0~0_215) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_77| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_77|) (= v_~weak$$choice1~0_265 |v_ULTIMATE.start_main_#t~nondet37#1_289|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_465, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_216, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_324, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_220, ~#x~0.offset=|v_~#x~0.offset_371|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_213, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_174, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_220|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_347, ULTIMATE.start_main_#t~ite39#1=|v_ULTIMATE.start_main_#t~ite39#1_447|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_446|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_775, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_217|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_377, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_213, #memory_int=|v_#memory_int_774|, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_289|, ~#x~0.base=|v_~#x~0.base_371|, ~y~0=v_~y~0_197} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_464, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_151|, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_166|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_323, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_220, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_77|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_177, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_178, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_254, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_174, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_265, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_77|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_376, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_213, ~y~0=v_~y~0_197, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_180|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_215, ~#x~0.offset=|v_~#x~0.offset_371|, ~x$w_buff1~0=v_~x$w_buff1~0_411, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_213, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_695, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_354, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_235, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_347, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_774, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_147|, #memory_int=|v_#memory_int_773|, ~#x~0.base=|v_~#x~0.base_371|} AuxVars[|v_ULTIMATE.start_main_#t~mem38#1_444|, |v_ULTIMATE.start_main_#t~ite35#1_215|, |v_ULTIMATE.start_main_#t~ite39#1_445|, |v_ULTIMATE.start_main_#t~mem34#1_218|, |v_ULTIMATE.start_main_#t~ite36#1_167|] AssignedVars[~x$w_buff0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~mem34#1, ULTIMATE.start_main_#t~ite35#1, ~weak$$choice1~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite40#1, ~x$r_buff0_thd0~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite39#1, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1] [2022-12-13 09:33:37,348 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:33:37,349 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1669 [2022-12-13 09:33:37,349 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 488 flow [2022-12-13 09:33:37,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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 09:33:37,349 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:33:37,349 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:33:37,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:33:37,350 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:33:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:37,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1785344507, now seen corresponding path program 1 times [2022-12-13 09:33:37,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:37,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297835465] [2022-12-13 09:33:37,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:37,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:37,548 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 09:33:37,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:37,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297835465] [2022-12-13 09:33:37,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297835465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:33:37,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:33:37,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:33:37,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175950340] [2022-12-13 09:33:37,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:33:37,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:33:37,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:37,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:33:37,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:33:37,550 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2022-12-13 09:33:37,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 488 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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 09:33:37,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:33:37,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2022-12-13 09:33:37,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:33:37,841 INFO L130 PetriNetUnfolder]: 769/1420 cut-off events. [2022-12-13 09:33:37,841 INFO L131 PetriNetUnfolder]: For 2596/2609 co-relation queries the response was YES. [2022-12-13 09:33:37,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6188 conditions, 1420 events. 769/1420 cut-off events. For 2596/2609 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7995 event pairs, 27 based on Foata normal form. 172/1113 useless extension candidates. Maximal degree in co-relation 6161. Up to 769 conditions per place. [2022-12-13 09:33:37,850 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 46 selfloop transitions, 28 changer transitions 12/91 dead transitions. [2022-12-13 09:33:37,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 771 flow [2022-12-13 09:33:37,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:33:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-13 09:33:37,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5421052631578948 [2022-12-13 09:33:37,851 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 488 flow. Second operand 5 states and 103 transitions. [2022-12-13 09:33:37,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 771 flow [2022-12-13 09:33:37,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 688 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-12-13 09:33:37,860 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 424 flow [2022-12-13 09:33:37,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=424, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2022-12-13 09:33:37,862 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2022-12-13 09:33:37,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:33:37,862 INFO L89 Accepts]: Start accepts. Operand has 63 places, 60 transitions, 424 flow [2022-12-13 09:33:37,865 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:33:37,865 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:33:37,865 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 60 transitions, 424 flow [2022-12-13 09:33:37,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 60 transitions, 424 flow [2022-12-13 09:33:37,900 INFO L130 PetriNetUnfolder]: 138/393 cut-off events. [2022-12-13 09:33:37,900 INFO L131 PetriNetUnfolder]: For 225/287 co-relation queries the response was YES. [2022-12-13 09:33:37,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 393 events. 138/393 cut-off events. For 225/287 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2485 event pairs, 2 based on Foata normal form. 1/213 useless extension candidates. Maximal degree in co-relation 1306. Up to 235 conditions per place. [2022-12-13 09:33:37,904 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 60 transitions, 424 flow [2022-12-13 09:33:37,904 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 09:33:37,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [833] L759-->L814: Formula: (let ((.cse5 (= 0 (mod v_~x$r_buff0_thd2~0_332 256)))) (let ((.cse2 (not .cse5)) (.cse3 (not (= 0 (mod v_~x$w_buff0_used~0_744 256))))) (let ((.cse0 (and .cse2 .cse3)) (.cse1 (= (mod v_~x$w_buff0_used~0_746 256) 0)) (.cse4 (select |v_#memory_int_748| |v_~#x~0.base_361|))) (and (= (ite .cse0 0 v_~x$r_buff0_thd2~0_332) v_~x$r_buff0_thd2~0_331) (= v_~x$r_buff0_thd0~0_207 v_~x$r_buff1_thd0~0_227) (= v_~x$r_buff0_thd3~0_166 v_~x$r_buff1_thd3~0_169) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_69| (ite .cse1 1 0)) (= v_~x$r_buff0_thd1~0_300 v_~x$r_buff1_thd1~0_238) (= v_~x$w_buff1_used~0_673 (ite (or .cse0 (and (not .cse1) .cse2)) 0 v_~x$w_buff0_used~0_746)) (= (ite .cse2 0 1) v_~x$w_buff0_used~0_744) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_331 256) 0)) .cse3) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_673 256) 0)))) 0 v_~x$r_buff0_thd2~0_332) v_~x$r_buff1_thd2~0_338) (= v_~x$r_buff0_thd1~0_299 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_69| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_69|) (= (store |v_#memory_int_748| |v_~#x~0.base_361| (store .cse4 |v_~#x~0.offset_361| |v_P1_#t~ite24_58|)) |v_#memory_int_747|) (= v_~x$w_buff0~0_444 1) (or (and (= |v_P1_#t~ite24_58| v_~x$w_buff0~0_444) .cse2 (= |v_P1_#t~ite23_62| |v_P1Thread1of1ForFork0_#t~ite23_66|) (= |v_P1Thread1of1ForFork0_#t~mem22_66| |v_P1_#t~mem22_65|)) (and .cse5 (= |v_P1_#t~ite23_62| |v_P1_#t~ite24_58|) (= |v_P1_#t~ite23_62| |v_P1_#t~mem22_65|) (= (select .cse4 |v_~#x~0.offset_361|) |v_P1_#t~mem22_65|))) (= v_~x$w_buff0~0_445 v_~x$w_buff1~0_399) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_69| 0)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_445, P1Thread1of1ForFork0_#t~mem22=|v_P1Thread1of1ForFork0_#t~mem22_66|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_207, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_300, ~#x~0.offset=|v_~#x~0.offset_361|, P1Thread1of1ForFork0_#t~ite23=|v_P1Thread1of1ForFork0_#t~ite23_66|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_166, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_332, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_746, #memory_int=|v_#memory_int_748|, ~#x~0.base=|v_~#x~0.base_361|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_444, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_207, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_299, ~#x~0.offset=|v_~#x~0.offset_361|, ~x$w_buff1~0=v_~x$w_buff1~0_399, P1Thread1of1ForFork0_#t~ite24=|v_P1Thread1of1ForFork0_#t~ite24_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_338, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_673, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_69|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_169, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_238, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_166, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_331, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_227, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_744, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_69|, #memory_int=|v_#memory_int_747|, ~#x~0.base=|v_~#x~0.base_361|} AuxVars[|v_P1_#t~ite24_58|, |v_P1_#t~ite23_62|, |v_P1_#t~mem22_65|] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~mem22, ~x$r_buff0_thd1~0, ~x$w_buff1~0, P1Thread1of1ForFork0_#t~ite24, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0_#t~ite23, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int] and [657] L771-->L778: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse7 (= (mod v_~x$r_buff1_thd1~0_37 256) 0)) (.cse0 (not .cse9)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_196 256) 0))) (.cse10 (= (mod v_~x$w_buff0_used~0_197 256) 0)) (.cse6 (= (mod v_~x$w_buff1_used~0_176 256) 0))) (let ((.cse3 (not .cse6)) (.cse1 (not .cse10)) (.cse2 (and .cse0 .cse11)) (.cse4 (not .cse7)) (.cse5 (select |v_#memory_int_188| |v_~#x~0.base_128|))) (and (= v_~x$w_buff0_used~0_196 (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_197)) (= (ite (or .cse2 (and .cse3 .cse4)) 0 v_~x$w_buff1_used~0_176) v_~x$w_buff1_used~0_175) (let ((.cse8 (= |v_P0_#t~mem3#1_36| |v_P0Thread1of1ForFork2_#t~mem3#1_1|))) (or (and (or (and (= |v_P0_#t~mem3#1_36| (select .cse5 |v_~#x~0.offset_128|)) (or .cse6 .cse7) (= |v_P0_#t~mem3#1_36| |v_P0_#t~ite4#1_33|)) (and .cse3 .cse8 .cse4 (= |v_P0_#t~ite4#1_33| v_~x$w_buff1~0_75))) (= |v_P0_#t~ite4#1_33| |v_P0_#t~ite5#1_31|) (or .cse9 .cse10)) (and .cse0 .cse1 (= |v_P0_#t~ite5#1_31| v_~x$w_buff0~0_74) (= |v_P0_#t~ite4#1_33| |v_P0Thread1of1ForFork2_#t~ite4#1_1|) .cse8))) (= (ite .cse2 0 v_~x$r_buff0_thd1~0_44) v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd1~0_36 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse11) (and (not (= (mod v_~x$w_buff1_used~0_175 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_37)) (= (store |v_#memory_int_188| |v_~#x~0.base_128| (store .cse5 |v_~#x~0.offset_128| |v_P0_#t~ite5#1_31|)) |v_#memory_int_187|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_74, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~#x~0.offset=|v_~#x~0.offset_128|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_188|, ~#x~0.base=|v_~#x~0.base_128|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_176, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_197} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_74, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~#x~0.offset=|v_~#x~0.offset_128|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_187|, ~#x~0.base=|v_~#x~0.base_128|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_36, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_196} AuxVars[|v_P0_#t~mem3#1_36|, |v_P0_#t~ite5#1_31|, |v_P0_#t~ite4#1_33|] AssignedVars[~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, P0Thread1of1ForFork2_#t~ite4#1, P0Thread1of1ForFork2_#t~ite5#1, ~x$w_buff0_used~0] [2022-12-13 09:33:38,849 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [830] L759-->L853-2: Formula: (and (= (select |v_#valid_260| |v_ULTIMATE.start_main_~#t1990~0#1.base_99|) 0) (= v_~x$r_buff0_thd1~0_287 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_663 256) 0)) (not (= (mod v_~x$w_buff0_used~0_728 256) 0)))) 1 0)) (= v_~x$r_buff0_thd3~0_158 v_~x$r_buff1_thd3~0_161) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_63| 0)) (< |v_#StackHeapBarrier_58| |v_ULTIMATE.start_main_~#t1990~0#1.base_99|) (= v_~x$w_buff0~0_432 1) (= v_~x$w_buff0_used~0_728 1) (= v_~x$r_buff0_thd1~0_288 v_~x$r_buff1_thd1~0_232) (= (store |v_#valid_260| |v_ULTIMATE.start_main_~#t1990~0#1.base_99| 1) |v_#valid_259|) (= v_~x$r_buff0_thd2~0_325 v_~x$r_buff1_thd2~0_332) (= (store |v_#memory_int_736| |v_ULTIMATE.start_main_~#t1990~0#1.base_99| (store (select |v_#memory_int_736| |v_ULTIMATE.start_main_~#t1990~0#1.base_99|) |v_ULTIMATE.start_main_~#t1990~0#1.offset_65| |v_ULTIMATE.start_main_#t~pre32#1_98|)) |v_#memory_int_735|) (not (= |v_ULTIMATE.start_main_~#t1990~0#1.base_99| 0)) (= v_~x$w_buff0_used~0_729 v_~x$w_buff1_used~0_663) (= (store |v_#length_115| |v_ULTIMATE.start_main_~#t1990~0#1.base_99| 4) |v_#length_114|) (= v_~x$r_buff0_thd0~0_199 v_~x$r_buff1_thd0~0_219) (= |v_#pthreadsForks_90| (+ |v_#pthreadsForks_91| 1)) (= v_~x$w_buff0~0_433 v_~x$w_buff1~0_393) (= |v_ULTIMATE.start_main_~#t1990~0#1.offset_65| 0) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|) (= |v_#pthreadsForks_91| |v_ULTIMATE.start_main_#t~pre32#1_98|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_433, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_199, #StackHeapBarrier=|v_#StackHeapBarrier_58|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_288, #pthreadsForks=|v_#pthreadsForks_91|, #valid=|v_#valid_260|, #memory_int=|v_#memory_int_736|, #length=|v_#length_115|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_158, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_325, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_729} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_199, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_287, ULTIMATE.start_main_~#t1990~0#1.offset=|v_ULTIMATE.start_main_~#t1990~0#1.offset_65|, ~x$w_buff1~0=v_~x$w_buff1~0_393, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_32|, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_63|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_161, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_332, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_663, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_158, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_325, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_219, ULTIMATE.start_main_#t~pre32#1=|v_ULTIMATE.start_main_#t~pre32#1_98|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_50|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_728, ULTIMATE.start_main_~#t1990~0#1.base=|v_ULTIMATE.start_main_~#t1990~0#1.base_99|, #StackHeapBarrier=|v_#StackHeapBarrier_58|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_63|, #pthreadsForks=|v_#pthreadsForks_90|, #valid=|v_#valid_259|, #memory_int=|v_#memory_int_735|, #length=|v_#length_114|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1990~0#1.offset, ~x$w_buff1~0, ULTIMATE.start_main_#t~nondet31#1, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~pre32#1, ULTIMATE.start_main_#t~pre30#1, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1990~0#1.base, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #pthreadsForks, #valid, #memory_int, #length] and [657] L771-->L778: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse7 (= (mod v_~x$r_buff1_thd1~0_37 256) 0)) (.cse0 (not .cse9)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_196 256) 0))) (.cse10 (= (mod v_~x$w_buff0_used~0_197 256) 0)) (.cse6 (= (mod v_~x$w_buff1_used~0_176 256) 0))) (let ((.cse3 (not .cse6)) (.cse1 (not .cse10)) (.cse2 (and .cse0 .cse11)) (.cse4 (not .cse7)) (.cse5 (select |v_#memory_int_188| |v_~#x~0.base_128|))) (and (= v_~x$w_buff0_used~0_196 (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_197)) (= (ite (or .cse2 (and .cse3 .cse4)) 0 v_~x$w_buff1_used~0_176) v_~x$w_buff1_used~0_175) (let ((.cse8 (= |v_P0_#t~mem3#1_36| |v_P0Thread1of1ForFork2_#t~mem3#1_1|))) (or (and (or (and (= |v_P0_#t~mem3#1_36| (select .cse5 |v_~#x~0.offset_128|)) (or .cse6 .cse7) (= |v_P0_#t~mem3#1_36| |v_P0_#t~ite4#1_33|)) (and .cse3 .cse8 .cse4 (= |v_P0_#t~ite4#1_33| v_~x$w_buff1~0_75))) (= |v_P0_#t~ite4#1_33| |v_P0_#t~ite5#1_31|) (or .cse9 .cse10)) (and .cse0 .cse1 (= |v_P0_#t~ite5#1_31| v_~x$w_buff0~0_74) (= |v_P0_#t~ite4#1_33| |v_P0Thread1of1ForFork2_#t~ite4#1_1|) .cse8))) (= (ite .cse2 0 v_~x$r_buff0_thd1~0_44) v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd1~0_36 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse11) (and (not (= (mod v_~x$w_buff1_used~0_175 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_37)) (= (store |v_#memory_int_188| |v_~#x~0.base_128| (store .cse5 |v_~#x~0.offset_128| |v_P0_#t~ite5#1_31|)) |v_#memory_int_187|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_74, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~#x~0.offset=|v_~#x~0.offset_128|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_188|, ~#x~0.base=|v_~#x~0.base_128|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_176, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_197} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_74, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~#x~0.offset=|v_~#x~0.offset_128|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_187|, ~#x~0.base=|v_~#x~0.base_128|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_36, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_196} AuxVars[|v_P0_#t~mem3#1_36|, |v_P0_#t~ite5#1_31|, |v_P0_#t~ite4#1_33|] AssignedVars[~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, P0Thread1of1ForFork2_#t~ite4#1, P0Thread1of1ForFork2_#t~ite5#1, ~x$w_buff0_used~0] [2022-12-13 09:33:39,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [831] L759-->L831: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd3~0_161 256) 0))) (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_732 256) 0))) (.cse1 (not .cse5))) (let ((.cse0 (select |v_#memory_int_740| |v_~#x~0.base_357|)) (.cse3 (= (mod v_~x$w_buff0_used~0_734 256) 0)) (.cse4 (and .cse2 .cse1))) (and (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_65| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_65|) (= (store |v_#memory_int_740| |v_~#x~0.base_357| (store .cse0 |v_~#x~0.offset_357| |v_P2_#t~ite27_60|)) |v_#memory_int_739|) (= v_~x$w_buff0~0_436 1) (= v_~x$w_buff0_used~0_732 (ite .cse1 0 1)) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_160 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_665 256) 0)) .cse1)) 0 v_~x$r_buff0_thd3~0_161) v_~x$r_buff1_thd3~0_163) (= v_~x$r_buff0_thd1~0_291 1) (= v_~x$r_buff0_thd1~0_292 v_~x$r_buff1_thd1~0_234) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_65| (ite .cse3 1 0)) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_65| 0)) (= v_~x$r_buff0_thd2~0_327 v_~x$r_buff1_thd2~0_334) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_161) v_~x$r_buff0_thd3~0_160) (or (and (= (select .cse0 |v_~#x~0.offset_357|) |v_P2_#t~mem25_57|) (= |v_P2_#t~ite26_60| |v_P2_#t~ite27_60|) .cse5 (= |v_P2_#t~ite26_60| |v_P2_#t~mem25_57|)) (and (= |v_P2Thread1of1ForFork1_#t~mem25_58| |v_P2_#t~mem25_57|) (= |v_P2_#t~ite26_60| |v_P2Thread1of1ForFork1_#t~ite26_58|) .cse1 (= |v_P2_#t~ite27_60| v_~x$w_buff0~0_436))) (= v_~x$r_buff0_thd0~0_201 v_~x$r_buff1_thd0~0_221) (= v_~x$w_buff0~0_437 v_~x$w_buff1~0_395) (= (ite (or (and .cse1 (not .cse3)) .cse4) 0 v_~x$w_buff0_used~0_734) v_~x$w_buff1_used~0_665))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_437, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_201, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_292, ~#x~0.offset=|v_~#x~0.offset_357|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_58|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_161, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_327, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_734, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_58|, #memory_int=|v_#memory_int_740|, ~#x~0.base=|v_~#x~0.base_357|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_436, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_201, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_291, ~#x~0.offset=|v_~#x~0.offset_357|, ~x$w_buff1~0=v_~x$w_buff1~0_395, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_163, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_665, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_65|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_334, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_234, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_160, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_327, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_221, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_732, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_31|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_65|, #memory_int=|v_#memory_int_739|, ~#x~0.base=|v_~#x~0.base_357|} AuxVars[|v_P2_#t~ite27_60|, |v_P2_#t~mem25_57|, |v_P2_#t~ite26_60|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_#t~mem25, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int] and [657] L771-->L778: Formula: (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_44 256) 0))) (let ((.cse7 (= (mod v_~x$r_buff1_thd1~0_37 256) 0)) (.cse0 (not .cse9)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_196 256) 0))) (.cse10 (= (mod v_~x$w_buff0_used~0_197 256) 0)) (.cse6 (= (mod v_~x$w_buff1_used~0_176 256) 0))) (let ((.cse3 (not .cse6)) (.cse1 (not .cse10)) (.cse2 (and .cse0 .cse11)) (.cse4 (not .cse7)) (.cse5 (select |v_#memory_int_188| |v_~#x~0.base_128|))) (and (= v_~x$w_buff0_used~0_196 (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_197)) (= (ite (or .cse2 (and .cse3 .cse4)) 0 v_~x$w_buff1_used~0_176) v_~x$w_buff1_used~0_175) (let ((.cse8 (= |v_P0_#t~mem3#1_36| |v_P0Thread1of1ForFork2_#t~mem3#1_1|))) (or (and (or (and (= |v_P0_#t~mem3#1_36| (select .cse5 |v_~#x~0.offset_128|)) (or .cse6 .cse7) (= |v_P0_#t~mem3#1_36| |v_P0_#t~ite4#1_33|)) (and .cse3 .cse8 .cse4 (= |v_P0_#t~ite4#1_33| v_~x$w_buff1~0_75))) (= |v_P0_#t~ite4#1_33| |v_P0_#t~ite5#1_31|) (or .cse9 .cse10)) (and .cse0 .cse1 (= |v_P0_#t~ite5#1_31| v_~x$w_buff0~0_74) (= |v_P0_#t~ite4#1_33| |v_P0Thread1of1ForFork2_#t~ite4#1_1|) .cse8))) (= (ite .cse2 0 v_~x$r_buff0_thd1~0_44) v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd1~0_36 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_43 256) 0)) .cse11) (and (not (= (mod v_~x$w_buff1_used~0_175 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_37)) (= (store |v_#memory_int_188| |v_~#x~0.base_128| (store .cse5 |v_~#x~0.offset_128| |v_P0_#t~ite5#1_31|)) |v_#memory_int_187|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_74, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~#x~0.offset=|v_~#x~0.offset_128|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_188|, ~#x~0.base=|v_~#x~0.base_128|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_176, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_1|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_37, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_197} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_74, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, ~#x~0.offset=|v_~#x~0.offset_128|, ~x$w_buff1~0=v_~x$w_buff1~0_75, #memory_int=|v_#memory_int_187|, ~#x~0.base=|v_~#x~0.base_128|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_36, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_196} AuxVars[|v_P0_#t~mem3#1_36|, |v_P0_#t~ite5#1_31|, |v_P0_#t~ite4#1_33|] AssignedVars[~x$r_buff0_thd1~0, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, P0Thread1of1ForFork2_#t~ite4#1, P0Thread1of1ForFork2_#t~ite5#1, ~x$w_buff0_used~0] [2022-12-13 09:33:42,968 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 09:33:42,969 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5107 [2022-12-13 09:33:42,969 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 424 flow [2022-12-13 09:33:42,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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 09:33:42,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:33:42,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:33:42,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:33:42,969 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:33:42,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash -438079370, now seen corresponding path program 1 times [2022-12-13 09:33:42,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:42,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6625930] [2022-12-13 09:33:42,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:42,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:33:43,159 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 09:33:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:33:43,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6625930] [2022-12-13 09:33:43,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6625930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:33:43,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:33:43,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:33:43,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115463078] [2022-12-13 09:33:43,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:33:43,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:33:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:33:43,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:33:43,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:33:43,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2022-12-13 09:33:43,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:43,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:33:43,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2022-12-13 09:33:43,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:33:43,383 INFO L130 PetriNetUnfolder]: 552/1001 cut-off events. [2022-12-13 09:33:43,383 INFO L131 PetriNetUnfolder]: For 1933/1991 co-relation queries the response was YES. [2022-12-13 09:33:43,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 1001 events. 552/1001 cut-off events. For 1933/1991 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 5423 event pairs, 30 based on Foata normal form. 68/852 useless extension candidates. Maximal degree in co-relation 4249. Up to 504 conditions per place. [2022-12-13 09:33:43,388 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 42 selfloop transitions, 2 changer transitions 54/109 dead transitions. [2022-12-13 09:33:43,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 109 transitions, 999 flow [2022-12-13 09:33:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:33:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:33:43,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-13 09:33:43,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2022-12-13 09:33:43,390 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 424 flow. Second operand 5 states and 95 transitions. [2022-12-13 09:33:43,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 109 transitions, 999 flow [2022-12-13 09:33:43,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 109 transitions, 819 flow, removed 35 selfloop flow, removed 10 redundant places. [2022-12-13 09:33:43,403 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 284 flow [2022-12-13 09:33:43,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=5, PETRI_FLOW=284, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-12-13 09:33:43,403 INFO L295 CegarLoopForPetriNet]: 74 programPoint places, -19 predicate places. [2022-12-13 09:33:43,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:33:43,404 INFO L89 Accepts]: Start accepts. Operand has 55 places, 50 transitions, 284 flow [2022-12-13 09:33:43,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:33:43,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:33:43,405 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 50 transitions, 284 flow [2022-12-13 09:33:43,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 284 flow [2022-12-13 09:33:43,436 INFO L130 PetriNetUnfolder]: 129/305 cut-off events. [2022-12-13 09:33:43,436 INFO L131 PetriNetUnfolder]: For 351/354 co-relation queries the response was YES. [2022-12-13 09:33:43,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 305 events. 129/305 cut-off events. For 351/354 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 1632 event pairs, 1 based on Foata normal form. 1/134 useless extension candidates. Maximal degree in co-relation 911. Up to 154 conditions per place. [2022-12-13 09:33:43,439 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 50 transitions, 284 flow [2022-12-13 09:33:43,439 INFO L226 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-13 09:33:45,481 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] $Ultimate##0-->L824: Formula: (and (= v_~y~0_49 2) (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_49} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~y~0] and [846] $Ultimate##0-->L778: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd3~0_189 256) 0))) (let ((.cse4 (not .cse5))) (let ((.cse8 (ite .cse4 0 1))) (let ((.cse10 (= (mod .cse8 256) 0))) (let ((.cse7 (not .cse10))) (let ((.cse9 (and .cse4 .cse7)) (.cse11 (= (mod v_~x$w_buff0_used~0_824 256) 0))) (let ((.cse3 (ite (or .cse9 (and (not .cse11) .cse4)) 0 v_~x$w_buff0_used~0_824))) (let ((.cse2 (not (= (mod .cse3 256) 0))) (.cse1 (not (= (mod v_~x$r_buff0_thd1~0_354 256) 0))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_823 256) 0))) (.cse6 (select |v_#memory_int_825| |v_~#x~0.base_393|))) (and (= (ite (or .cse0 (and .cse1 .cse2)) 0 .cse3) v_~x$w_buff1_used~0_731) (or (and (= |v_P2_#t~ite27_68| v_~x$w_buff0~0_502) .cse4 (= |v_P2Thread1of1ForFork1_#t~mem25_66| |v_P2_#t~mem25_65|) (= |v_P2_#t~ite26_68| |v_P2Thread1of1ForFork1_#t~ite26_66|)) (and (= |v_P2_#t~ite26_68| |v_P2_#t~mem25_65|) (= |v_P2_#t~ite26_68| |v_P2_#t~ite27_68|) .cse5 (= |v_P2_#t~mem25_65| (select .cse6 |v_~#x~0.offset_393|)))) (= v_~x$r_buff0_thd2~0_371 v_~x$r_buff1_thd2~0_376) (= v_~x$w_buff0_used~0_823 (ite .cse7 0 .cse8)) (= v_~x$w_buff0~0_503 v_~x$w_buff1~0_438) (= (ite (or (and .cse7 (not (= (mod v_~x$r_buff0_thd3~0_188 256) 0))) (and .cse4 .cse2)) 0 v_~x$r_buff0_thd3~0_189) v_~x$r_buff1_thd3~0_189) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_89| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_89|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_89| 0)) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_34| |v_P0Thread1of1ForFork2_~arg#1.offset_34|) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_34| |v_P0Thread1of1ForFork2_~arg#1.base_34|) (= v_~y~0_215 v_~__unbuffered_p0_EAX~0_197) (= v_~x$r_buff0_thd0~0_241 v_~x$r_buff1_thd0~0_257) (= v_~x$w_buff0~0_502 1) (= v_~x$r_buff0_thd1~0_353 (ite .cse0 0 1)) (= v_~x$r_buff1_thd1~0_272 (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_731 256) 0))) (and .cse0 (not (= 0 (mod v_~x$r_buff0_thd1~0_353 256))))) 0 v_~x$r_buff0_thd1~0_354)) (= (ite .cse9 0 v_~x$r_buff0_thd3~0_189) v_~x$r_buff0_thd3~0_188) (= (store |v_#memory_int_825| |v_~#x~0.base_393| (store .cse6 |v_~#x~0.offset_393| |v_P0_#t~ite5#1_105|)) |v_#memory_int_824|) (or (and (= |v_P0Thread1of1ForFork2_#t~ite4#1_144| |v_P0_#t~ite4#1_107|) .cse7 (= |v_P0_#t~ite5#1_105| v_~x$w_buff0~0_502) (= |v_P0_#t~mem3#1_110| |v_P0Thread1of1ForFork2_#t~mem3#1_144|)) (and (= |v_P0_#t~mem3#1_110| |v_P0_#t~ite4#1_107|) .cse10 (= |v_P0_#t~ite5#1_105| |v_P0_#t~ite4#1_107|) (= |v_P0_#t~mem3#1_110| |v_P2_#t~ite27_68|))) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_89| (ite .cse11 1 0))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_503, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_354, ~#x~0.offset=|v_~#x~0.offset_393|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_66|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_34|, P0Thread1of1ForFork2_#t~mem3#1=|v_P0Thread1of1ForFork2_#t~mem3#1_144|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_189, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_34|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_371, P0Thread1of1ForFork2_#t~ite4#1=|v_P0Thread1of1ForFork2_#t~ite4#1_144|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_824, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_66|, #memory_int=|v_#memory_int_825|, ~#x~0.base=|v_~#x~0.base_393|, ~y~0=v_~y~0_215} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_502, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_353, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_189, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_89|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_272, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_188, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_34|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_197, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_35|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_89|, ~y~0=v_~y~0_215, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_241, ~#x~0.offset=|v_~#x~0.offset_393|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_34|, ~x$w_buff1~0=v_~x$w_buff1~0_438, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_731, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_376, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_371, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_257, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_34|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_823, #memory_int=|v_#memory_int_824|, ~#x~0.base=|v_~#x~0.base_393|, P0Thread1of1ForFork2_#t~ite5#1=|v_P0Thread1of1ForFork2_#t~ite5#1_75|} AuxVars[|v_P2_#t~mem25_65|, |v_P2_#t~ite26_68|, |v_P0_#t~mem3#1_110|, |v_P0_#t~ite5#1_105|, |v_P2_#t~ite27_68|, |v_P0_#t~ite4#1_107|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_#t~mem25, ~x$w_buff1~0, ~x$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem3#1, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_#t~ite4#1, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int, P0Thread1of1ForFork2_#t~ite5#1] [2022-12-13 09:33:46,244 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [795] $Ultimate##0-->L824: Formula: (and (= v_~y~0_49 2) (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_49} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~y~0] and [850] $Ultimate##0-->L831: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd3~0_199 256) 0))) (let ((.cse1 (not .cse5)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_839 256) 0)))) (let ((.cse2 (and .cse1 .cse4)) (.cse3 (= (mod v_~x$w_buff0_used~0_840 256) 0)) (.cse0 (select |v_#memory_int_841| |v_~#x~0.base_401|))) (and (= v_~x$r_buff0_thd0~0_249 v_~x$r_buff1_thd0~0_265) (= v_~x$w_buff0~0_518 1) (= (store |v_#memory_int_841| |v_~#x~0.base_401| (store .cse0 |v_~#x~0.offset_401| |v_P2_#t~ite27_70|)) |v_#memory_int_840|) (= v_~x$r_buff0_thd1~0_370 v_~x$r_buff1_thd1~0_280) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_42| |v_P0Thread1of1ForFork2_~arg#1.base_42|) (= (ite .cse1 0 1) v_~x$w_buff0_used~0_839) (= v_~x$r_buff0_thd1~0_369 1) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_199) v_~x$r_buff0_thd3~0_198) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_97| (ite .cse3 1 0)) (= (ite (or .cse2 (and (not .cse3) .cse1)) 0 v_~x$w_buff0_used~0_840) v_~x$w_buff1_used~0_739) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_42| |v_P0Thread1of1ForFork2_~arg#1.offset_42|) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_198 256) 0)) .cse4) (and (not (= (mod v_~x$w_buff1_used~0_739 256) 0)) .cse1)) 0 v_~x$r_buff0_thd3~0_199) v_~x$r_buff1_thd3~0_197) (= v_~x$w_buff0~0_519 v_~x$w_buff1~0_446) (or (and (= |v_P2_#t~ite27_70| v_~x$w_buff0~0_518) (= |v_P2_#t~ite26_70| |v_P2Thread1of1ForFork1_#t~ite26_70|) .cse1 (= |v_P2Thread1of1ForFork1_#t~mem25_70| |v_P2_#t~mem25_67|)) (and (= |v_P2_#t~mem25_67| (select .cse0 |v_~#x~0.offset_401|)) (= |v_P2_#t~ite26_70| |v_P2_#t~ite27_70|) (= |v_P2_#t~ite26_70| |v_P2_#t~mem25_67|) .cse5)) (= v_~y~0_223 v_~__unbuffered_p0_EAX~0_205) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_97| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_97|) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_97| 0)) (= v_~x$r_buff0_thd2~0_383 v_~x$r_buff1_thd2~0_384))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_519, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_249, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_370, ~#x~0.offset=|v_~#x~0.offset_401|, P2Thread1of1ForFork1_#t~mem25=|v_P2Thread1of1ForFork1_#t~mem25_70|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_42|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_199, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_42|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_383, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_840, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_70|, #memory_int=|v_#memory_int_841|, ~#x~0.base=|v_~#x~0.base_401|, ~y~0=v_~y~0_223} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_518, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_369, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_197, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_97|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_280, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_198, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_42|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_42|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_205, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_37|, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_97|, ~y~0=v_~y~0_223, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_249, ~#x~0.offset=|v_~#x~0.offset_401|, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_42|, ~x$w_buff1~0=v_~x$w_buff1~0_446, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_739, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_384, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_383, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_265, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_839, #memory_int=|v_#memory_int_840|, ~#x~0.base=|v_~#x~0.base_401|} AuxVars[|v_P2_#t~ite27_70|, |v_P2_#t~mem25_67|, |v_P2_#t~ite26_70|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_#t~mem25, ~x$w_buff1~0, ~x$r_buff1_thd3~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, ~x$w_buff0_used~0, ~__unbuffered_p0_EAX~0, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, #memory_int] [2022-12-13 09:33:46,506 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:33:46,508 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3104 [2022-12-13 09:33:46,508 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 308 flow [2022-12-13 09:33:46,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:33:46,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:33:46,508 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:33:46,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:33:46,508 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:33:46,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:33:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1221644359, now seen corresponding path program 1 times [2022-12-13 09:33:46,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:33:46,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310709532] [2022-12-13 09:33:46,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:33:46,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:33:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:33:46,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:33:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:33:46,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:33:46,701 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:33:46,702 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 09:33:46,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 09:33:46,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 09:33:46,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 09:33:46,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 09:33:46,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 09:33:46,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:33:46,707 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:33:46,713 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:33:46,713 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:33:46,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:33:46 BasicIcfg [2022-12-13 09:33:46,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:33:46,805 INFO L158 Benchmark]: Toolchain (without parser) took 38869.62ms. Allocated memory was 192.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 151.8MB in the beginning and 1.0GB in the end (delta: -877.2MB). Peak memory consumption was 233.7MB. Max. memory is 8.0GB. [2022-12-13 09:33:46,805 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory was 169.3MB in the beginning and 169.2MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:33:46,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.22ms. Allocated memory is still 192.9MB. Free memory was 151.3MB in the beginning and 124.4MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 09:33:46,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.83ms. Allocated memory is still 192.9MB. Free memory was 124.4MB in the beginning and 122.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:33:46,805 INFO L158 Benchmark]: Boogie Preprocessor took 29.45ms. Allocated memory is still 192.9MB. Free memory was 122.0MB in the beginning and 119.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 09:33:46,806 INFO L158 Benchmark]: RCFGBuilder took 942.33ms. Allocated memory is still 192.9MB. Free memory was 119.3MB in the beginning and 149.6MB in the end (delta: -30.3MB). Peak memory consumption was 64.6MB. Max. memory is 8.0GB. [2022-12-13 09:33:46,806 INFO L158 Benchmark]: TraceAbstraction took 37285.30ms. Allocated memory was 192.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 148.5MB in the beginning and 1.0GB in the end (delta: -880.5MB). Peak memory consumption was 229.9MB. Max. memory is 8.0GB. [2022-12-13 09:33:46,807 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory was 169.3MB in the beginning and 169.2MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 561.22ms. Allocated memory is still 192.9MB. Free memory was 151.3MB in the beginning and 124.4MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.83ms. Allocated memory is still 192.9MB. Free memory was 124.4MB in the beginning and 122.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.45ms. Allocated memory is still 192.9MB. Free memory was 122.0MB in the beginning and 119.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 942.33ms. Allocated memory is still 192.9MB. Free memory was 119.3MB in the beginning and 149.6MB in the end (delta: -30.3MB). Peak memory consumption was 64.6MB. Max. memory is 8.0GB. * TraceAbstraction took 37285.30ms. Allocated memory was 192.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 148.5MB in the beginning and 1.0GB in the end (delta: -880.5MB). Peak memory consumption was 229.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.5s, 130 PlacesBefore, 74 PlacesAfterwards, 122 TransitionsBefore, 64 TransitionsAfterwards, 1832 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 56 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3325, independent: 3137, independent conditional: 3137, independent unconditional: 0, dependent: 188, dependent conditional: 188, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1927, independent: 1868, independent conditional: 0, independent unconditional: 1868, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1927, independent: 1868, independent conditional: 0, independent unconditional: 1868, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1927, independent: 1845, independent conditional: 0, independent unconditional: 1845, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 779, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 744, dependent conditional: 0, dependent unconditional: 744, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3325, independent: 1269, independent conditional: 1269, independent unconditional: 0, dependent: 129, dependent conditional: 129, dependent unconditional: 0, unknown: 1927, unknown conditional: 1927, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1936, Positive cache size: 1877, Positive conditional cache size: 1877, Positive unconditional cache size: 0, Negative cache size: 59, Negative conditional cache size: 59, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 176, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 136, independent conditional: 13, independent unconditional: 123, dependent: 23, dependent conditional: 8, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 159, independent: 136, independent conditional: 13, independent unconditional: 123, dependent: 23, dependent conditional: 8, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 159, independent: 118, independent conditional: 0, independent unconditional: 118, 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: 8, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 126, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 114, dependent conditional: 74, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 176, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 159, unknown conditional: 159, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 136, Positive conditional cache size: 136, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 167, independent: 137, independent conditional: 137, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 27, independent conditional: 14, independent unconditional: 13, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, independent: 27, independent conditional: 14, independent unconditional: 13, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 70, dependent conditional: 3, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 167, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 163, Positive conditional cache size: 163, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 144, independent: 116, independent conditional: 116, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 26, independent conditional: 9, independent unconditional: 17, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 26, independent conditional: 9, independent unconditional: 17, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 144, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 229, Positive cache size: 189, Positive conditional cache size: 189, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 45 PlacesBefore, 45 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 112, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, independent: 26, independent conditional: 11, independent unconditional: 15, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, independent: 26, independent conditional: 11, independent unconditional: 15, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 159, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 159, dependent conditional: 99, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 215, Positive conditional cache size: 215, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 113, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 24, independent conditional: 1, independent unconditional: 23, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 24, independent conditional: 1, independent unconditional: 23, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 146, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 239, Positive conditional cache size: 239, Positive unconditional cache size: 0, Negative cache size: 59, Negative conditional cache size: 59, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 52 PlacesBefore, 51 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 588 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 231, independent: 221, independent conditional: 221, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 29, independent conditional: 27, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 29, independent conditional: 27, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 231, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 268, Positive conditional cache size: 268, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 324, independent: 306, independent conditional: 306, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 14, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 14, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 324, independent: 291, independent conditional: 291, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 343, Positive cache size: 283, Positive conditional cache size: 283, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 60 PlacesBefore, 60 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 738 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 260, independent: 233, independent conditional: 233, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 11, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 11, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 260, independent: 214, independent conditional: 214, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 363, Positive cache size: 302, Positive conditional cache size: 302, Positive unconditional cache size: 0, Negative cache size: 61, Negative conditional cache size: 61, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 63 PlacesBefore, 63 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 710 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 331, independent: 300, independent conditional: 300, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 5, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 5, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 331, independent: 278, independent conditional: 278, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 385, Positive cache size: 324, Positive conditional cache size: 324, Positive unconditional cache size: 0, Negative cache size: 61, Negative conditional cache size: 61, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 62 PlacesBefore, 59 PlacesAfterwards, 60 TransitionsBefore, 57 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 427, independent: 397, independent conditional: 397, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 427, independent: 365, independent conditional: 365, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 418, Positive cache size: 356, Positive conditional cache size: 356, Positive unconditional cache size: 0, Negative cache size: 62, Negative conditional cache size: 62, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 50 PlacesBefore, 49 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 120, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 23, 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: 23, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 120, independent: 97, independent conditional: 97, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 441, Positive cache size: 379, Positive conditional cache size: 379, Positive unconditional cache size: 0, Negative cache size: 62, Negative conditional cache size: 62, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L752] 0 _Bool weak$$choice0; [L753] 0 _Bool weak$$choice1; [L754] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1988; [L849] FCALL, FORK 0 pthread_create(&t1988, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1988, ((void *)0), P0, ((void *)0))=8, t1988={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] 0 pthread_t t1989; [L851] FCALL, FORK 0 pthread_create(&t1989, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1989, ((void *)0), P1, ((void *)0))=9, t1988={6:0}, t1989={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] 0 pthread_t t1990; [L853] FCALL, FORK 0 pthread_create(&t1990, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1990, ((void *)0), P2, ((void *)0))=10, t1988={6:0}, t1989={7:0}, t1990={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L787] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 2 x$flush_delayed = weak$$choice2 [L790] EXPR 2 \read(x) [L790] 2 x$mem_tmp = x [L791] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L792] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L792] EXPR 2 \read(x) [L792] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L792] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L793] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L794] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L795] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L796] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L797] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L798] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L800] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L801] EXPR 2 \read(x) [L801] 2 __unbuffered_p1_EAX = x [L802] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L802] 2 x = x$flush_delayed ? x$mem_tmp : x [L803] 2 x$flush_delayed = (_Bool)0 [L806] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L809] EXPR 2 \read(x) [L809] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 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) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] 3 y = 2 [L758] 3 __unbuffered_p0_EAX = y [L761] 3 x$w_buff1 = x$w_buff0 [L762] 3 x$w_buff0 = 1 [L763] 3 x$w_buff1_used = x$w_buff0_used [L764] 3 x$w_buff0_used = (_Bool)1 [L765] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L765] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 3 x$r_buff0_thd1 = (_Bool)1 [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 \read(x) [L826] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L826] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 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) [L827] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 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 [L773] EXPR 3 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L773] 3 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L775] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L776] 3 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L777] 3 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 \read(x) [L859] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L859] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 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) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 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 [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 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 [L866] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L867] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L867] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L867] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L867] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L867] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L868] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 849]: 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: 853]: 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, 151 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: 37.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 325 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 325 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 812 IncrementalHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 2 mSDtfsCounter, 812 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=9, InterpolantAutomatonStates: 43, 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.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:33:46,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...