/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 01:15:00,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 01:15:00,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 01:15:00,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 01:15:00,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 01:15:00,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 01:15:00,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 01:15:00,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 01:15:00,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 01:15:00,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 01:15:00,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 01:15:00,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 01:15:00,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 01:15:00,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 01:15:00,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 01:15:00,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 01:15:00,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 01:15:00,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 01:15:00,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 01:15:00,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 01:15:00,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 01:15:00,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 01:15:00,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 01:15:00,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 01:15:00,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 01:15:00,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 01:15:00,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 01:15:00,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 01:15:00,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 01:15:00,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 01:15:00,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 01:15:00,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 01:15:00,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 01:15:00,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 01:15:00,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 01:15:00,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 01:15:00,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 01:15:00,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 01:15:00,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 01:15:00,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 01:15:00,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 01:15:00,816 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 01:15:00,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 01:15:00,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 01:15:00,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 01:15:00,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 01:15:00,841 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 01:15:00,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 01:15:00,842 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 01:15:00,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 01:15:00,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 01:15:00,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 01:15:00,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 01:15:00,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 01:15:00,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 01:15:00,843 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 01:15:00,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 01:15:00,843 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 01:15:00,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 01:15:00,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 01:15:00,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 01:15:00,843 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 01:15:00,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 01:15:00,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:15:00,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 01:15:00,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 01:15:00,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 01:15:00,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 01:15:00,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 01:15:00,844 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 01:15:00,844 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 01:15:01,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 01:15:01,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 01:15:01,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 01:15:01,112 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 01:15:01,112 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 01:15:01,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2022-12-06 01:15:01,945 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 01:15:02,138 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 01:15:02,139 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.oepc.i [2022-12-06 01:15:02,151 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af573e95/718263a9b2594131aeaa244c608b5e3e/FLAG9cf7ec7f7 [2022-12-06 01:15:02,163 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af573e95/718263a9b2594131aeaa244c608b5e3e [2022-12-06 01:15:02,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 01:15:02,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 01:15:02,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 01:15:02,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 01:15:02,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 01:15:02,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:15:02" (1/1) ... [2022-12-06 01:15:02,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f76b7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02, skipping insertion in model container [2022-12-06 01:15:02,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:15:02" (1/1) ... [2022-12-06 01:15:02,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 01:15:02,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 01:15:02,307 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/safe018_rmo.oepc.i[993,1006] [2022-12-06 01:15:02,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:15:02,494 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 01:15:02,504 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/safe018_rmo.oepc.i[993,1006] [2022-12-06 01:15:02,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 01:15:02,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 01:15:02,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 01:15:02,587 INFO L208 MainTranslator]: Completed translation [2022-12-06 01:15:02,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02 WrapperNode [2022-12-06 01:15:02,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 01:15:02,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 01:15:02,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 01:15:02,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 01:15:02,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02" (1/1) ... [2022-12-06 01:15:02,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02" (1/1) ... [2022-12-06 01:15:02,631 INFO L138 Inliner]: procedures = 176, calls = 65, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-06 01:15:02,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 01:15:02,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 01:15:02,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 01:15:02,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 01:15:02,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02" (1/1) ... [2022-12-06 01:15:02,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02" (1/1) ... [2022-12-06 01:15:02,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02" (1/1) ... [2022-12-06 01:15:02,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02" (1/1) ... [2022-12-06 01:15:02,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02" (1/1) ... [2022-12-06 01:15:02,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02" (1/1) ... [2022-12-06 01:15:02,664 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02" (1/1) ... [2022-12-06 01:15:02,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02" (1/1) ... [2022-12-06 01:15:02,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 01:15:02,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 01:15:02,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 01:15:02,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 01:15:02,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02" (1/1) ... [2022-12-06 01:15:02,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 01:15:02,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 01:15:02,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 01:15:02,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 01:15:02,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 01:15:02,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 01:15:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 01:15:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 01:15:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 01:15:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 01:15:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 01:15:02,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 01:15:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 01:15:02,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 01:15:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 01:15:02,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 01:15:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 01:15:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 01:15:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 01:15:02,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 01:15:02,731 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 01:15:02,856 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 01:15:02,858 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 01:15:03,228 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 01:15:03,342 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 01:15:03,342 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 01:15:03,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:15:03 BoogieIcfgContainer [2022-12-06 01:15:03,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 01:15:03,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 01:15:03,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 01:15:03,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 01:15:03,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 01:15:02" (1/3) ... [2022-12-06 01:15:03,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72091624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:15:03, skipping insertion in model container [2022-12-06 01:15:03,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:15:02" (2/3) ... [2022-12-06 01:15:03,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72091624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 01:15:03, skipping insertion in model container [2022-12-06 01:15:03,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:15:03" (3/3) ... [2022-12-06 01:15:03,350 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2022-12-06 01:15:03,362 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 01:15:03,362 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 01:15:03,362 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 01:15:03,410 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 01:15:03,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2022-12-06 01:15:03,478 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2022-12-06 01:15:03,479 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:15:03,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2022-12-06 01:15:03,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2022-12-06 01:15:03,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 108 transitions, 225 flow [2022-12-06 01:15:03,517 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:15:03,551 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 108 transitions, 225 flow [2022-12-06 01:15:03,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 108 transitions, 225 flow [2022-12-06 01:15:03,575 INFO L130 PetriNetUnfolder]: 1/108 cut-off events. [2022-12-06 01:15:03,575 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:15:03,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 1/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-06 01:15:03,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 108 transitions, 225 flow [2022-12-06 01:15:03,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 1064 [2022-12-06 01:15:10,385 INFO L203 LiptonReduction]: Total number of compositions: 91 [2022-12-06 01:15:10,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 01:15:10,408 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;@534b67a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 01:15:10,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 01:15:10,412 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 01:15:10,412 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 01:15:10,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:15:10,413 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:10,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:15:10,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:15:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1729796226, now seen corresponding path program 1 times [2022-12-06 01:15:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:15:10,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679258757] [2022-12-06 01:15:10,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:15:10,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:15:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:15:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:15:10,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:15:10,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679258757] [2022-12-06 01:15:10,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679258757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:15:10,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:15:10,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:15:10,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990565938] [2022-12-06 01:15:10,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:15:10,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 01:15:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:15:10,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 01:15:10,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 01:15:10,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 01:15:10,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 47 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:10,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:15:10,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 01:15:10,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:15:10,757 INFO L130 PetriNetUnfolder]: 293/481 cut-off events. [2022-12-06 01:15:10,757 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 01:15:10,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 481 events. 293/481 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1896 event pairs, 293 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 963. Up to 463 conditions per place. [2022-12-06 01:15:10,763 INFO L137 encePairwiseOnDemand]: 18/19 looper letters, 16 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2022-12-06 01:15:10,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 18 transitions, 77 flow [2022-12-06 01:15:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 01:15:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 01:15:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2022-12-06 01:15:10,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-06 01:15:10,773 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2022-12-06 01:15:10,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:15:10,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 18 transitions, 77 flow [2022-12-06 01:15:10,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 18 transitions, 77 flow [2022-12-06 01:15:10,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-06 01:15:12,086 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 01:15:12,088 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1315 [2022-12-06 01:15:12,088 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 15 transitions, 69 flow [2022-12-06 01:15:12,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:12,088 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:15:12,088 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:12,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 01:15:12,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:15:12,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:15:12,089 INFO L85 PathProgramCache]: Analyzing trace with hash -181862396, now seen corresponding path program 1 times [2022-12-06 01:15:12,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:15:12,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520435527] [2022-12-06 01:15:12,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:15:12,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:15:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:15:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:15:12,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:15:12,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520435527] [2022-12-06 01:15:12,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520435527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:15:12,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:15:12,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:15:12,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110289733] [2022-12-06 01:15:12,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:15:12,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:15:12,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:15:12,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:15:12,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:15:12,306 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 01:15:12,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 15 transitions, 69 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:12,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:15:12,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 01:15:12,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:15:12,396 INFO L130 PetriNetUnfolder]: 164/271 cut-off events. [2022-12-06 01:15:12,396 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 01:15:12,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 271 events. 164/271 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 802 event pairs, 44 based on Foata normal form. 6/277 useless extension candidates. Maximal degree in co-relation 823. Up to 272 conditions per place. [2022-12-06 01:15:12,398 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 18 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2022-12-06 01:15:12,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 129 flow [2022-12-06 01:15:12,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:15:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:15:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-12-06 01:15:12,399 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 01:15:12,399 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 0 predicate places. [2022-12-06 01:15:12,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:15:12,400 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 129 flow [2022-12-06 01:15:12,403 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 20 transitions, 129 flow [2022-12-06 01:15:12,403 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:15:13,036 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:15:13,037 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 637 [2022-12-06 01:15:13,038 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 129 flow [2022-12-06 01:15:13,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:13,038 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:15:13,038 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:13,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 01:15:13,038 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:15:13,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:15:13,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1342766355, now seen corresponding path program 1 times [2022-12-06 01:15:13,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:15:13,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762714915] [2022-12-06 01:15:13,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:15:13,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:15:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:15:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:15:13,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:15:13,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762714915] [2022-12-06 01:15:13,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762714915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:15:13,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:15:13,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 01:15:13,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028805448] [2022-12-06 01:15:13,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:15:13,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:15:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:15:13,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:15:13,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:15:13,199 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 01:15:13,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 129 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:13,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:15:13,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 01:15:13,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:15:13,302 INFO L130 PetriNetUnfolder]: 181/318 cut-off events. [2022-12-06 01:15:13,302 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 01:15:13,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1297 conditions, 318 events. 181/318 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1200 event pairs, 14 based on Foata normal form. 36/354 useless extension candidates. Maximal degree in co-relation 1280. Up to 319 conditions per place. [2022-12-06 01:15:13,304 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 21 selfloop transitions, 3 changer transitions 11/35 dead transitions. [2022-12-06 01:15:13,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 292 flow [2022-12-06 01:15:13,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:15:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:15:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 01:15:13,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.515625 [2022-12-06 01:15:13,306 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2022-12-06 01:15:13,306 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:15:13,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 35 transitions, 292 flow [2022-12-06 01:15:13,308 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 35 transitions, 292 flow [2022-12-06 01:15:13,308 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:15:13,984 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:15:13,985 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 679 [2022-12-06 01:15:13,985 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 35 transitions, 296 flow [2022-12-06 01:15:13,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:13,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:15:13,985 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:13,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 01:15:13,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:15:13,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:15:13,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1323832973, now seen corresponding path program 1 times [2022-12-06 01:15:13,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:15:13,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198969722] [2022-12-06 01:15:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:15:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:15:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:15:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:15:14,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:15:14,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198969722] [2022-12-06 01:15:14,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198969722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:15:14,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:15:14,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 01:15:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778362794] [2022-12-06 01:15:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:15:14,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 01:15:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:15:14,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 01:15:14,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 01:15:14,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 01:15:14,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 35 transitions, 296 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:14,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:15:14,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 01:15:14,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:15:14,225 INFO L130 PetriNetUnfolder]: 158/289 cut-off events. [2022-12-06 01:15:14,225 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 01:15:14,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 289 events. 158/289 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1117 event pairs, 4 based on Foata normal form. 12/301 useless extension candidates. Maximal degree in co-relation 1451. Up to 290 conditions per place. [2022-12-06 01:15:14,227 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 35 selfloop transitions, 4 changer transitions 20/59 dead transitions. [2022-12-06 01:15:14,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 59 transitions, 611 flow [2022-12-06 01:15:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 01:15:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 01:15:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 01:15:14,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2022-12-06 01:15:14,229 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places. [2022-12-06 01:15:14,229 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:15:14,229 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 59 transitions, 611 flow [2022-12-06 01:15:14,231 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 59 transitions, 611 flow [2022-12-06 01:15:14,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:15:14,886 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:15:14,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 658 [2022-12-06 01:15:14,887 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 59 transitions, 615 flow [2022-12-06 01:15:14,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:14,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:15:14,888 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:14,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 01:15:14,888 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:15:14,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:15:14,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1908252589, now seen corresponding path program 1 times [2022-12-06 01:15:14,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:15:14,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490796555] [2022-12-06 01:15:14,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:15:14,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:15:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:15:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:15:15,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:15:15,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490796555] [2022-12-06 01:15:15,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490796555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:15:15,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:15:15,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:15:15,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374676167] [2022-12-06 01:15:15,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:15:15,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:15:15,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:15:15,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:15:15,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:15:15,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 01:15:15,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 59 transitions, 615 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:15,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:15:15,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 01:15:15,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:15:15,938 INFO L130 PetriNetUnfolder]: 177/331 cut-off events. [2022-12-06 01:15:15,938 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 01:15:15,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 331 events. 177/331 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1317 event pairs, 2 based on Foata normal form. 4/335 useless extension candidates. Maximal degree in co-relation 1998. Up to 332 conditions per place. [2022-12-06 01:15:15,941 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 47 selfloop transitions, 10 changer transitions 37/94 dead transitions. [2022-12-06 01:15:15,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 94 transitions, 1158 flow [2022-12-06 01:15:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:15:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:15:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 01:15:15,943 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 01:15:15,944 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 8 predicate places. [2022-12-06 01:15:15,944 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:15:15,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 94 transitions, 1158 flow [2022-12-06 01:15:15,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 94 transitions, 1158 flow [2022-12-06 01:15:15,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:15:15,950 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:15:15,951 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 01:15:15,951 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 94 transitions, 1158 flow [2022-12-06 01:15:15,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:15,951 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:15:15,951 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:15,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 01:15:15,951 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:15:15,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:15:15,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1486226069, now seen corresponding path program 1 times [2022-12-06 01:15:15,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:15:15,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651065701] [2022-12-06 01:15:15,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:15:15,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:15:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:15:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:15:16,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:15:16,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651065701] [2022-12-06 01:15:16,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651065701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:15:16,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:15:16,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:15:16,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101734054] [2022-12-06 01:15:16,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:15:16,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:15:16,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:15:16,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:15:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:15:16,527 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 01:15:16,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 94 transitions, 1158 flow. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:16,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:15:16,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 01:15:16,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:15:16,659 INFO L130 PetriNetUnfolder]: 174/326 cut-off events. [2022-12-06 01:15:16,659 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 01:15:16,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2318 conditions, 326 events. 174/326 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1276 event pairs, 2 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 2292. Up to 327 conditions per place. [2022-12-06 01:15:16,661 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 49 selfloop transitions, 7 changer transitions 37/93 dead transitions. [2022-12-06 01:15:16,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 93 transitions, 1332 flow [2022-12-06 01:15:16,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:15:16,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:15:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-06 01:15:16,676 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 01:15:16,676 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 11 predicate places. [2022-12-06 01:15:16,677 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:15:16,677 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 93 transitions, 1332 flow [2022-12-06 01:15:16,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 93 transitions, 1332 flow [2022-12-06 01:15:16,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:15:16,680 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:15:16,681 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 01:15:16,681 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 93 transitions, 1332 flow [2022-12-06 01:15:16,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:16,681 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:15:16,681 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:16,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 01:15:16,681 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:15:16,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:15:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash 973712634, now seen corresponding path program 1 times [2022-12-06 01:15:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:15:16,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715525467] [2022-12-06 01:15:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:15:16,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:15:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:15:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:15:16,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:15:16,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715525467] [2022-12-06 01:15:16,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715525467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:15:16,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:15:16,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:15:16,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303548385] [2022-12-06 01:15:16,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:15:16,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 01:15:16,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:15:16,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 01:15:16,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 01:15:16,848 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 01:15:16,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 93 transitions, 1332 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:16,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:15:16,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 01:15:16,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:15:16,953 INFO L130 PetriNetUnfolder]: 153/297 cut-off events. [2022-12-06 01:15:16,953 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 01:15:16,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2413 conditions, 297 events. 153/297 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1199 event pairs, 2 based on Foata normal form. 5/302 useless extension candidates. Maximal degree in co-relation 2384. Up to 298 conditions per place. [2022-12-06 01:15:16,955 INFO L137 encePairwiseOnDemand]: 9/16 looper letters, 62 selfloop transitions, 19 changer transitions 72/153 dead transitions. [2022-12-06 01:15:16,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 153 transitions, 2481 flow [2022-12-06 01:15:16,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 01:15:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 01:15:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 01:15:16,956 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.515625 [2022-12-06 01:15:16,957 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 13 predicate places. [2022-12-06 01:15:16,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:15:16,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 153 transitions, 2481 flow [2022-12-06 01:15:16,959 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 153 transitions, 2481 flow [2022-12-06 01:15:16,960 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:15:31,360 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:15:31,361 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14404 [2022-12-06 01:15:31,361 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 156 transitions, 2671 flow [2022-12-06 01:15:31,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:31,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:15:31,361 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:31,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 01:15:31,361 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:15:31,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:15:31,361 INFO L85 PathProgramCache]: Analyzing trace with hash -302308060, now seen corresponding path program 1 times [2022-12-06 01:15:31,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:15:31,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558120545] [2022-12-06 01:15:31,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:15:31,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:15:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:15:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:15:31,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:15:31,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558120545] [2022-12-06 01:15:31,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558120545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:15:31,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:15:31,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:15:31,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969010487] [2022-12-06 01:15:31,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:15:31,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:15:31,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:15:31,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:15:31,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:15:31,553 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 01:15:31,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 156 transitions, 2671 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:31,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:15:31,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 01:15:31,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:15:31,642 INFO L130 PetriNetUnfolder]: 93/217 cut-off events. [2022-12-06 01:15:31,642 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 01:15:31,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1991 conditions, 217 events. 93/217 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 930 event pairs, 0 based on Foata normal form. 5/222 useless extension candidates. Maximal degree in co-relation 1959. Up to 218 conditions per place. [2022-12-06 01:15:31,643 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 50 selfloop transitions, 25 changer transitions 93/168 dead transitions. [2022-12-06 01:15:31,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 168 transitions, 3063 flow [2022-12-06 01:15:31,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:15:31,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:15:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 01:15:31,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23333333333333334 [2022-12-06 01:15:31,646 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 18 predicate places. [2022-12-06 01:15:31,647 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:15:31,647 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 168 transitions, 3063 flow [2022-12-06 01:15:31,650 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 168 transitions, 3063 flow [2022-12-06 01:15:31,650 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:15:34,827 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:15:34,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3182 [2022-12-06 01:15:34,828 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 168 transitions, 3101 flow [2022-12-06 01:15:34,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:34,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:15:34,829 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:34,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 01:15:34,829 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:15:34,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:15:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash -302404141, now seen corresponding path program 1 times [2022-12-06 01:15:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:15:34,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733843584] [2022-12-06 01:15:34,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:15:34,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:15:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:15:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:15:34,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:15:34,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733843584] [2022-12-06 01:15:34,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733843584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:15:34,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:15:34,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 01:15:34,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069205956] [2022-12-06 01:15:34,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:15:34,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 01:15:34,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:15:34,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 01:15:34,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 01:15:34,974 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 01:15:34,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 168 transitions, 3101 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:34,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:15:34,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 01:15:34,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:15:35,061 INFO L130 PetriNetUnfolder]: 78/185 cut-off events. [2022-12-06 01:15:35,061 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 01:15:35,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 185 events. 78/185 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 743 event pairs, 0 based on Foata normal form. 2/187 useless extension candidates. Maximal degree in co-relation 1854. Up to 186 conditions per place. [2022-12-06 01:15:35,063 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 50 selfloop transitions, 25 changer transitions 87/162 dead transitions. [2022-12-06 01:15:35,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 162 transitions, 3279 flow [2022-12-06 01:15:35,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 01:15:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 01:15:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-06 01:15:35,067 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36 [2022-12-06 01:15:35,068 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 22 predicate places. [2022-12-06 01:15:35,068 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:15:35,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 162 transitions, 3279 flow [2022-12-06 01:15:35,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 162 transitions, 3279 flow [2022-12-06 01:15:35,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:15:35,071 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 01:15:35,073 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 01:15:35,073 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 162 transitions, 3279 flow [2022-12-06 01:15:35,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:35,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:15:35,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:35,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 01:15:35,073 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:15:35,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:15:35,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1396480875, now seen corresponding path program 1 times [2022-12-06 01:15:35,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:15:35,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143105567] [2022-12-06 01:15:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:15:35,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:15:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 01:15:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 01:15:35,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 01:15:35,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143105567] [2022-12-06 01:15:35,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143105567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 01:15:35,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 01:15:35,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 01:15:35,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394789649] [2022-12-06 01:15:35,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 01:15:35,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 01:15:35,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 01:15:35,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 01:15:35,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 01:15:35,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 01:15:35,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 162 transitions, 3279 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:35,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 01:15:35,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 01:15:35,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 01:15:35,338 INFO L130 PetriNetUnfolder]: 76/182 cut-off events. [2022-12-06 01:15:35,338 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 01:15:35,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2042 conditions, 182 events. 76/182 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 733 event pairs, 0 based on Foata normal form. 2/184 useless extension candidates. Maximal degree in co-relation 2004. Up to 183 conditions per place. [2022-12-06 01:15:35,343 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 39 selfloop transitions, 24 changer transitions 97/160 dead transitions. [2022-12-06 01:15:35,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 160 transitions, 3559 flow [2022-12-06 01:15:35,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 01:15:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 01:15:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-12-06 01:15:35,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 01:15:35,345 INFO L294 CegarLoopForPetriNet]: 28 programPoint places, 27 predicate places. [2022-12-06 01:15:35,345 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 01:15:35,345 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 160 transitions, 3559 flow [2022-12-06 01:15:35,348 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 160 transitions, 3559 flow [2022-12-06 01:15:35,348 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 01:15:35,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L814-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_82 1) v_~__unbuffered_cnt~0_81) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] and [589] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (= (mod v_~y$r_buff0_thd0~0_192 256) 0))) (let ((.cse13 (= (mod v_~y$w_buff0_used~0_357 256) 0)) (.cse11 (= (mod v_~y$w_buff1_used~0_360 256) 0)) (.cse10 (= (mod v_~y$r_buff1_thd0~0_198 256) 0)) (.cse9 (not (= (mod v_~y$w_buff0_used~0_356 256) 0))) (.cse0 (not .cse14))) (let ((.cse8 (and .cse9 .cse0)) (.cse5 (select |v_#memory_int_477| |v_~#y~0.base_215|)) (.cse6 (not .cse10)) (.cse7 (not .cse11)) (.cse1 (not .cse13))) (and (= (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_357) v_~y$w_buff0_used~0_356) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|) (= v_~weak$$choice1~0_135 |v_ULTIMATE.start_main_#t~nondet23#1_203|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem24#1_318| |v_ULTIMATE.start_main_#t~mem24#1_316|)) (.cse4 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_140 256) 0))) (or (and (let ((.cse2 (= (mod v_~weak$$choice1~0_135 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite25#1_313| v_~__unbuffered_p0_EAX~0_259)) (and (= |v_ULTIMATE.start_main_#t~mem24#1_316| (select (select |v_#memory_int_476| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139)) (= |v_ULTIMATE.start_main_#t~ite25#1_313| |v_ULTIMATE.start_main_#t~mem24#1_316|) (not .cse2)))) (= |v_ULTIMATE.start_main_#t~ite25#1_313| v_~__unbuffered_p0_EAX~0_258) (not .cse4)) (and .cse3 (= v_~__unbuffered_p0_EAX~0_259 v_~__unbuffered_p0_EAX~0_258) (= |v_ULTIMATE.start_main_#t~ite25#1_315| |v_ULTIMATE.start_main_#t~ite25#1_313|) .cse4))) (= (store |v_#memory_int_477| |v_~#y~0.base_215| (store .cse5 |v_~#y~0.offset_215| |v_ULTIMATE.start_main_#t~ite22#1_196|)) |v_#memory_int_476|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= v_~y$w_buff1_used~0_359 (ite (or (and .cse6 .cse7) .cse8) 0 v_~y$w_buff1_used~0_360)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_215 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_102) (= v_~y$r_buff0_thd0~0_191 (ite .cse8 0 v_~y$r_buff0_thd0~0_192)) (= v_~y$r_buff1_thd0~0_197 (ite (or (and .cse6 (not (= (mod v_~y$w_buff1_used~0_359 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_191 256) 0)) .cse9)) 0 v_~y$r_buff1_thd0~0_198)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem20#1_258| |v_ULTIMATE.start_main_#t~mem20#1_256|))) (or (and (or (and (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~ite21#1_251| |v_ULTIMATE.start_main_#t~mem20#1_256|) (= (select .cse5 |v_~#y~0.offset_215|) |v_ULTIMATE.start_main_#t~mem20#1_256|)) (and (= v_~y$w_buff1~0_187 |v_ULTIMATE.start_main_#t~ite21#1_251|) .cse6 .cse12 .cse7)) (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite21#1_251| |v_ULTIMATE.start_main_#t~ite22#1_196|)) (and (= |v_ULTIMATE.start_main_#t~ite21#1_253| |v_ULTIMATE.start_main_#t~ite21#1_251|) (= |v_ULTIMATE.start_main_#t~ite22#1_196| v_~y$w_buff0~0_173) .cse12 .cse0 .cse1))) (= (mod v_~main$tmp_guard0~0_102 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103| (mod v_~main$tmp_guard1~0_124 256)) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_109 1) (= v_~__unbuffered_p0_EAX~0_258 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_124))))) InVars {ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_203|, ~#y~0.offset=|v_~#y~0.offset_215|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_111, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_357, ~#y~0.base=|v_~#y~0.base_215|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_258|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_259, ~y$w_buff1~0=v_~y$w_buff1~0_187, ~y$w_buff0~0=v_~y$w_buff0~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_192, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139, #memory_int=|v_#memory_int_477|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite21#1=|v_ULTIMATE.start_main_#t~ite21#1_253|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_215, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_198, ULTIMATE.start_main_#t~ite25#1=|v_ULTIMATE.start_main_#t~ite25#1_315|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_360, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_318|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_99|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|, ~#y~0.offset=|v_~#y~0.offset_215|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_356, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_124, ~#y~0.base=|v_~#y~0.base_215|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_258, ~weak$$choice1~0=v_~weak$$choice1~0_135, ULTIMATE.start_main_#t~ite22#1=|v_ULTIMATE.start_main_#t~ite22#1_195|, ~y$w_buff0~0=v_~y$w_buff0~0_173, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_99|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_111, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_136|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_102, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103|, ~y$w_buff1~0=v_~y$w_buff1~0_187, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_191, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139, #memory_int=|v_#memory_int_476|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_215, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_83|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_197, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_359, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|} AuxVars[|v_ULTIMATE.start_main_#t~mem20#1_256|, |v_ULTIMATE.start_main_#t~ite21#1_251|, |v_ULTIMATE.start_main_#t~mem24#1_316|, |v_ULTIMATE.start_main_#t~ite25#1_313|, |v_ULTIMATE.start_main_#t~ite22#1_196|] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet23#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem20#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite22#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite21#1, ULTIMATE.start_main_#t~nondet19#1, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite25#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] [2022-12-06 01:15:36,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] L792-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_17| 0) (= |v_P1Thread1of1ForFork1_#res.offset_17| 0) (= v_~__unbuffered_cnt~0_153 (+ v_~__unbuffered_cnt~0_154 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_154} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_17|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [589] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (= (mod v_~y$r_buff0_thd0~0_192 256) 0))) (let ((.cse13 (= (mod v_~y$w_buff0_used~0_357 256) 0)) (.cse11 (= (mod v_~y$w_buff1_used~0_360 256) 0)) (.cse10 (= (mod v_~y$r_buff1_thd0~0_198 256) 0)) (.cse9 (not (= (mod v_~y$w_buff0_used~0_356 256) 0))) (.cse0 (not .cse14))) (let ((.cse8 (and .cse9 .cse0)) (.cse5 (select |v_#memory_int_477| |v_~#y~0.base_215|)) (.cse6 (not .cse10)) (.cse7 (not .cse11)) (.cse1 (not .cse13))) (and (= (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_357) v_~y$w_buff0_used~0_356) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|) (= v_~weak$$choice1~0_135 |v_ULTIMATE.start_main_#t~nondet23#1_203|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem24#1_318| |v_ULTIMATE.start_main_#t~mem24#1_316|)) (.cse4 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_140 256) 0))) (or (and (let ((.cse2 (= (mod v_~weak$$choice1~0_135 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite25#1_313| v_~__unbuffered_p0_EAX~0_259)) (and (= |v_ULTIMATE.start_main_#t~mem24#1_316| (select (select |v_#memory_int_476| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139)) (= |v_ULTIMATE.start_main_#t~ite25#1_313| |v_ULTIMATE.start_main_#t~mem24#1_316|) (not .cse2)))) (= |v_ULTIMATE.start_main_#t~ite25#1_313| v_~__unbuffered_p0_EAX~0_258) (not .cse4)) (and .cse3 (= v_~__unbuffered_p0_EAX~0_259 v_~__unbuffered_p0_EAX~0_258) (= |v_ULTIMATE.start_main_#t~ite25#1_315| |v_ULTIMATE.start_main_#t~ite25#1_313|) .cse4))) (= (store |v_#memory_int_477| |v_~#y~0.base_215| (store .cse5 |v_~#y~0.offset_215| |v_ULTIMATE.start_main_#t~ite22#1_196|)) |v_#memory_int_476|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= v_~y$w_buff1_used~0_359 (ite (or (and .cse6 .cse7) .cse8) 0 v_~y$w_buff1_used~0_360)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_215 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_102) (= v_~y$r_buff0_thd0~0_191 (ite .cse8 0 v_~y$r_buff0_thd0~0_192)) (= v_~y$r_buff1_thd0~0_197 (ite (or (and .cse6 (not (= (mod v_~y$w_buff1_used~0_359 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_191 256) 0)) .cse9)) 0 v_~y$r_buff1_thd0~0_198)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem20#1_258| |v_ULTIMATE.start_main_#t~mem20#1_256|))) (or (and (or (and (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~ite21#1_251| |v_ULTIMATE.start_main_#t~mem20#1_256|) (= (select .cse5 |v_~#y~0.offset_215|) |v_ULTIMATE.start_main_#t~mem20#1_256|)) (and (= v_~y$w_buff1~0_187 |v_ULTIMATE.start_main_#t~ite21#1_251|) .cse6 .cse12 .cse7)) (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite21#1_251| |v_ULTIMATE.start_main_#t~ite22#1_196|)) (and (= |v_ULTIMATE.start_main_#t~ite21#1_253| |v_ULTIMATE.start_main_#t~ite21#1_251|) (= |v_ULTIMATE.start_main_#t~ite22#1_196| v_~y$w_buff0~0_173) .cse12 .cse0 .cse1))) (= (mod v_~main$tmp_guard0~0_102 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103| (mod v_~main$tmp_guard1~0_124 256)) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_109 1) (= v_~__unbuffered_p0_EAX~0_258 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_124))))) InVars {ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_203|, ~#y~0.offset=|v_~#y~0.offset_215|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_111, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_357, ~#y~0.base=|v_~#y~0.base_215|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_258|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_259, ~y$w_buff1~0=v_~y$w_buff1~0_187, ~y$w_buff0~0=v_~y$w_buff0~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_192, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139, #memory_int=|v_#memory_int_477|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite21#1=|v_ULTIMATE.start_main_#t~ite21#1_253|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_215, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_198, ULTIMATE.start_main_#t~ite25#1=|v_ULTIMATE.start_main_#t~ite25#1_315|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_360, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_318|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_99|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|, ~#y~0.offset=|v_~#y~0.offset_215|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_356, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_124, ~#y~0.base=|v_~#y~0.base_215|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_258, ~weak$$choice1~0=v_~weak$$choice1~0_135, ULTIMATE.start_main_#t~ite22#1=|v_ULTIMATE.start_main_#t~ite22#1_195|, ~y$w_buff0~0=v_~y$w_buff0~0_173, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_99|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_111, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_136|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_102, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103|, ~y$w_buff1~0=v_~y$w_buff1~0_187, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_191, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139, #memory_int=|v_#memory_int_476|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_215, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_83|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_197, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_359, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|} AuxVars[|v_ULTIMATE.start_main_#t~mem20#1_256|, |v_ULTIMATE.start_main_#t~ite21#1_251|, |v_ULTIMATE.start_main_#t~mem24#1_316|, |v_ULTIMATE.start_main_#t~ite25#1_313|, |v_ULTIMATE.start_main_#t~ite22#1_196|] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet23#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem20#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite22#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite21#1, ULTIMATE.start_main_#t~nondet19#1, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite25#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] [2022-12-06 01:15:36,809 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L814-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_82 1) v_~__unbuffered_cnt~0_81) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] and [589] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (= (mod v_~y$r_buff0_thd0~0_192 256) 0))) (let ((.cse13 (= (mod v_~y$w_buff0_used~0_357 256) 0)) (.cse11 (= (mod v_~y$w_buff1_used~0_360 256) 0)) (.cse10 (= (mod v_~y$r_buff1_thd0~0_198 256) 0)) (.cse9 (not (= (mod v_~y$w_buff0_used~0_356 256) 0))) (.cse0 (not .cse14))) (let ((.cse8 (and .cse9 .cse0)) (.cse5 (select |v_#memory_int_477| |v_~#y~0.base_215|)) (.cse6 (not .cse10)) (.cse7 (not .cse11)) (.cse1 (not .cse13))) (and (= (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_357) v_~y$w_buff0_used~0_356) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|) (= v_~weak$$choice1~0_135 |v_ULTIMATE.start_main_#t~nondet23#1_203|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem24#1_318| |v_ULTIMATE.start_main_#t~mem24#1_316|)) (.cse4 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_140 256) 0))) (or (and (let ((.cse2 (= (mod v_~weak$$choice1~0_135 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite25#1_313| v_~__unbuffered_p0_EAX~0_259)) (and (= |v_ULTIMATE.start_main_#t~mem24#1_316| (select (select |v_#memory_int_476| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139)) (= |v_ULTIMATE.start_main_#t~ite25#1_313| |v_ULTIMATE.start_main_#t~mem24#1_316|) (not .cse2)))) (= |v_ULTIMATE.start_main_#t~ite25#1_313| v_~__unbuffered_p0_EAX~0_258) (not .cse4)) (and .cse3 (= v_~__unbuffered_p0_EAX~0_259 v_~__unbuffered_p0_EAX~0_258) (= |v_ULTIMATE.start_main_#t~ite25#1_315| |v_ULTIMATE.start_main_#t~ite25#1_313|) .cse4))) (= (store |v_#memory_int_477| |v_~#y~0.base_215| (store .cse5 |v_~#y~0.offset_215| |v_ULTIMATE.start_main_#t~ite22#1_196|)) |v_#memory_int_476|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= v_~y$w_buff1_used~0_359 (ite (or (and .cse6 .cse7) .cse8) 0 v_~y$w_buff1_used~0_360)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_215 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_102) (= v_~y$r_buff0_thd0~0_191 (ite .cse8 0 v_~y$r_buff0_thd0~0_192)) (= v_~y$r_buff1_thd0~0_197 (ite (or (and .cse6 (not (= (mod v_~y$w_buff1_used~0_359 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_191 256) 0)) .cse9)) 0 v_~y$r_buff1_thd0~0_198)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem20#1_258| |v_ULTIMATE.start_main_#t~mem20#1_256|))) (or (and (or (and (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~ite21#1_251| |v_ULTIMATE.start_main_#t~mem20#1_256|) (= (select .cse5 |v_~#y~0.offset_215|) |v_ULTIMATE.start_main_#t~mem20#1_256|)) (and (= v_~y$w_buff1~0_187 |v_ULTIMATE.start_main_#t~ite21#1_251|) .cse6 .cse12 .cse7)) (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite21#1_251| |v_ULTIMATE.start_main_#t~ite22#1_196|)) (and (= |v_ULTIMATE.start_main_#t~ite21#1_253| |v_ULTIMATE.start_main_#t~ite21#1_251|) (= |v_ULTIMATE.start_main_#t~ite22#1_196| v_~y$w_buff0~0_173) .cse12 .cse0 .cse1))) (= (mod v_~main$tmp_guard0~0_102 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103| (mod v_~main$tmp_guard1~0_124 256)) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_109 1) (= v_~__unbuffered_p0_EAX~0_258 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_124))))) InVars {ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_203|, ~#y~0.offset=|v_~#y~0.offset_215|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_111, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_357, ~#y~0.base=|v_~#y~0.base_215|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_258|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_259, ~y$w_buff1~0=v_~y$w_buff1~0_187, ~y$w_buff0~0=v_~y$w_buff0~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_192, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139, #memory_int=|v_#memory_int_477|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite21#1=|v_ULTIMATE.start_main_#t~ite21#1_253|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_215, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_198, ULTIMATE.start_main_#t~ite25#1=|v_ULTIMATE.start_main_#t~ite25#1_315|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_360, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_318|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_99|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|, ~#y~0.offset=|v_~#y~0.offset_215|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_356, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_124, ~#y~0.base=|v_~#y~0.base_215|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_258, ~weak$$choice1~0=v_~weak$$choice1~0_135, ULTIMATE.start_main_#t~ite22#1=|v_ULTIMATE.start_main_#t~ite22#1_195|, ~y$w_buff0~0=v_~y$w_buff0~0_173, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_99|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_111, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_136|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_102, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103|, ~y$w_buff1~0=v_~y$w_buff1~0_187, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_191, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139, #memory_int=|v_#memory_int_476|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_215, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_83|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_197, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_359, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|} AuxVars[|v_ULTIMATE.start_main_#t~mem20#1_256|, |v_ULTIMATE.start_main_#t~ite21#1_251|, |v_ULTIMATE.start_main_#t~mem24#1_316|, |v_ULTIMATE.start_main_#t~ite25#1_313|, |v_ULTIMATE.start_main_#t~ite22#1_196|] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet23#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem20#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite22#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite21#1, ULTIMATE.start_main_#t~nondet19#1, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite25#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] [2022-12-06 01:15:37,502 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] L792-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_17| 0) (= |v_P1Thread1of1ForFork1_#res.offset_17| 0) (= v_~__unbuffered_cnt~0_153 (+ v_~__unbuffered_cnt~0_154 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_154} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_17|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] and [589] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (= (mod v_~y$r_buff0_thd0~0_192 256) 0))) (let ((.cse13 (= (mod v_~y$w_buff0_used~0_357 256) 0)) (.cse11 (= (mod v_~y$w_buff1_used~0_360 256) 0)) (.cse10 (= (mod v_~y$r_buff1_thd0~0_198 256) 0)) (.cse9 (not (= (mod v_~y$w_buff0_used~0_356 256) 0))) (.cse0 (not .cse14))) (let ((.cse8 (and .cse9 .cse0)) (.cse5 (select |v_#memory_int_477| |v_~#y~0.base_215|)) (.cse6 (not .cse10)) (.cse7 (not .cse11)) (.cse1 (not .cse13))) (and (= (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_357) v_~y$w_buff0_used~0_356) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|) (= v_~weak$$choice1~0_135 |v_ULTIMATE.start_main_#t~nondet23#1_203|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem24#1_318| |v_ULTIMATE.start_main_#t~mem24#1_316|)) (.cse4 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_140 256) 0))) (or (and (let ((.cse2 (= (mod v_~weak$$choice1~0_135 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite25#1_313| v_~__unbuffered_p0_EAX~0_259)) (and (= |v_ULTIMATE.start_main_#t~mem24#1_316| (select (select |v_#memory_int_476| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139)) (= |v_ULTIMATE.start_main_#t~ite25#1_313| |v_ULTIMATE.start_main_#t~mem24#1_316|) (not .cse2)))) (= |v_ULTIMATE.start_main_#t~ite25#1_313| v_~__unbuffered_p0_EAX~0_258) (not .cse4)) (and .cse3 (= v_~__unbuffered_p0_EAX~0_259 v_~__unbuffered_p0_EAX~0_258) (= |v_ULTIMATE.start_main_#t~ite25#1_315| |v_ULTIMATE.start_main_#t~ite25#1_313|) .cse4))) (= (store |v_#memory_int_477| |v_~#y~0.base_215| (store .cse5 |v_~#y~0.offset_215| |v_ULTIMATE.start_main_#t~ite22#1_196|)) |v_#memory_int_476|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= v_~y$w_buff1_used~0_359 (ite (or (and .cse6 .cse7) .cse8) 0 v_~y$w_buff1_used~0_360)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_215 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_102) (= v_~y$r_buff0_thd0~0_191 (ite .cse8 0 v_~y$r_buff0_thd0~0_192)) (= v_~y$r_buff1_thd0~0_197 (ite (or (and .cse6 (not (= (mod v_~y$w_buff1_used~0_359 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_191 256) 0)) .cse9)) 0 v_~y$r_buff1_thd0~0_198)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem20#1_258| |v_ULTIMATE.start_main_#t~mem20#1_256|))) (or (and (or (and (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~ite21#1_251| |v_ULTIMATE.start_main_#t~mem20#1_256|) (= (select .cse5 |v_~#y~0.offset_215|) |v_ULTIMATE.start_main_#t~mem20#1_256|)) (and (= v_~y$w_buff1~0_187 |v_ULTIMATE.start_main_#t~ite21#1_251|) .cse6 .cse12 .cse7)) (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite21#1_251| |v_ULTIMATE.start_main_#t~ite22#1_196|)) (and (= |v_ULTIMATE.start_main_#t~ite21#1_253| |v_ULTIMATE.start_main_#t~ite21#1_251|) (= |v_ULTIMATE.start_main_#t~ite22#1_196| v_~y$w_buff0~0_173) .cse12 .cse0 .cse1))) (= (mod v_~main$tmp_guard0~0_102 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103| (mod v_~main$tmp_guard1~0_124 256)) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_109 1) (= v_~__unbuffered_p0_EAX~0_258 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_124))))) InVars {ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_203|, ~#y~0.offset=|v_~#y~0.offset_215|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_111, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_357, ~#y~0.base=|v_~#y~0.base_215|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_258|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_259, ~y$w_buff1~0=v_~y$w_buff1~0_187, ~y$w_buff0~0=v_~y$w_buff0~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_192, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139, #memory_int=|v_#memory_int_477|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite21#1=|v_ULTIMATE.start_main_#t~ite21#1_253|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_215, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_198, ULTIMATE.start_main_#t~ite25#1=|v_ULTIMATE.start_main_#t~ite25#1_315|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_360, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_318|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_99|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|, ~#y~0.offset=|v_~#y~0.offset_215|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_356, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_124, ~#y~0.base=|v_~#y~0.base_215|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_258, ~weak$$choice1~0=v_~weak$$choice1~0_135, ULTIMATE.start_main_#t~ite22#1=|v_ULTIMATE.start_main_#t~ite22#1_195|, ~y$w_buff0~0=v_~y$w_buff0~0_173, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_99|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_111, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_136|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_102, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103|, ~y$w_buff1~0=v_~y$w_buff1~0_187, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_191, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139, #memory_int=|v_#memory_int_476|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_215, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_83|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_197, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_359, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|} AuxVars[|v_ULTIMATE.start_main_#t~mem20#1_256|, |v_ULTIMATE.start_main_#t~ite21#1_251|, |v_ULTIMATE.start_main_#t~mem24#1_316|, |v_ULTIMATE.start_main_#t~ite25#1_313|, |v_ULTIMATE.start_main_#t~ite22#1_196|] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet23#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem20#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite22#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite21#1, ULTIMATE.start_main_#t~nondet19#1, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite25#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] [2022-12-06 01:15:38,215 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [568] $Ultimate##0-->P0EXIT: Formula: (let ((.cse13 (= (mod v_~y$w_buff1_used~0_276 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd1~0_118 256) 0)) (.cse14 (= (mod v_~y$r_buff0_thd1~0_119 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_273 256) 0))) (let ((.cse15 (= 0 (mod v_~weak$$choice2~0_78 256))) (.cse10 (not .cse16)) (.cse11 (not .cse14)) (.cse2 (and .cse5 .cse14)) (.cse3 (and .cse14 .cse13)) (.cse0 (select |v_#memory_int_391| |v_~#y~0.base_173|))) (let ((.cse8 (select .cse0 |v_~#y~0.offset_173|)) (.cse9 (or .cse2 .cse3 .cse16)) (.cse12 (and .cse10 .cse11)) (.cse7 (= (mod v_~y$w_buff1_used~0_275 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_272 256) 0)) (.cse1 (not .cse15))) (and (= (store |v_#memory_int_391| |v_~#y~0.base_173| (store .cse0 |v_~#y~0.offset_173| |v_P0_#t~ite10_52|)) |v_#memory_int_390|) (= v_~y$w_buff1_used~0_275 (ite .cse1 v_~y$w_buff1_used~0_276 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_276 0))) (= v_~y$w_buff1~0_144 v_~y$w_buff1~0_143) (= 0 |v_P0Thread1of1ForFork0_#res.offset_31|) (= |v_P0Thread1of1ForFork0_#t~nondet3_46| v_~weak$$choice0~0_49) (= v_~__unbuffered_p0_EBX~0_71 v_~x~0_49) (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_99 |v_~#y~0.offset_173|) (= (ite .cse1 v_~y$r_buff1_thd1~0_118 (ite (let ((.cse6 (= (mod v_~y$r_buff0_thd1~0_118 256) 0))) (or (and .cse5 .cse6) (and .cse6 .cse7) .cse4)) v_~y$r_buff1_thd1~0_118 0)) v_~y$r_buff1_thd1~0_117) (= v_~__unbuffered_p0_EAX$read_delayed~0_100 1) (= v_~y$mem_tmp~0_44 .cse8) (or (and (= v_~__unbuffered_p0_EAX~0_180 |v_P0_#t~mem6_65|) .cse9 (= .cse8 |v_P0_#t~mem6_65|)) (and (= |v_P0Thread1of1ForFork0_#t~mem6_46| |v_P0_#t~mem6_65|) .cse10 (or .cse11 (not .cse5)) (= (ite .cse12 v_~y$w_buff0~0_130 v_~y$w_buff1~0_144) v_~__unbuffered_p0_EAX~0_180) (or (not .cse13) .cse11))) (= v_~__unbuffered_cnt~0_179 (+ v_~__unbuffered_cnt~0_180 1)) (= |v_P0Thread1of1ForFork0_#res.base_31| 0) (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= |v_P0Thread1of1ForFork0_#t~nondet4_46| v_~weak$$choice2~0_78) (= (ite .cse1 v_~y$w_buff0_used~0_273 (ite .cse9 v_~y$w_buff0_used~0_273 (ite .cse12 0 v_~y$w_buff0_used~0_273))) v_~y$w_buff0_used~0_272) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= 0 v_~y$flush_delayed~0_60) (= v_~y$r_buff0_thd1~0_118 (ite .cse1 v_~y$r_buff0_thd1~0_119 (ite (or (and .cse14 .cse7) .cse2 .cse4) v_~y$r_buff0_thd1~0_119 (ite (and .cse11 (not .cse4)) 0 v_~y$r_buff0_thd1~0_119)))) (or (and (= |v_P0Thread1of1ForFork0_#t~mem9_46| |v_P0_#t~mem9_49|) .cse1 (= |v_P0_#t~ite10_52| v_~y$mem_tmp~0_44)) (and (= |v_P0_#t~ite10_52| |v_P0_#t~mem9_49|) .cse15 (= v_~__unbuffered_p0_EAX~0_180 |v_P0_#t~mem9_49|))) (= v_~y$w_buff0~0_129 v_~y$w_buff0~0_130) (= |v_~#y~0.base_173| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_99))))) InVars {~#y~0.offset=|v_~#y~0.offset_173|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_273, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~#y~0.base=|v_~#y~0.base_173|, P0Thread1of1ForFork0_#t~mem9=|v_P0Thread1of1ForFork0_#t~mem9_46|, P0Thread1of1ForFork0_#t~mem6=|v_P0Thread1of1ForFork0_#t~mem6_46|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_118, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~y$w_buff1~0=v_~y$w_buff1~0_144, ~y$w_buff0~0=v_~y$w_buff0~0_130, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_119, #memory_int=|v_#memory_int_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_180, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_46|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_46|, ~x~0=v_~x~0_49, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_276} OutVars{P0Thread1of1ForFork0_#t~ite10=|v_P0Thread1of1ForFork0_#t~ite10_25|, ~#y~0.offset=|v_~#y~0.offset_173|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_31|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_272, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_31|, ~#y~0.base=|v_~#y~0.base_173|, P0Thread1of1ForFork0_#t~mem8=|v_P0Thread1of1ForFork0_#t~mem8_25|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, P0Thread1of1ForFork0_#t~mem5=|v_P0Thread1of1ForFork0_#t~mem5_25|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_117, ~y$mem_tmp~0=v_~y$mem_tmp~0_44, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_180, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~y$w_buff0~0=v_~y$w_buff0~0_129, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_118, ~y$flush_delayed~0=v_~y$flush_delayed~0_60, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_100, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_71, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_99, ~weak$$choice0~0=v_~weak$$choice0~0_49, ~y$w_buff1~0=v_~y$w_buff1~0_143, P0Thread1of1ForFork0_#t~ite7=|v_P0Thread1of1ForFork0_#t~ite7_25|, #memory_int=|v_#memory_int_390|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_179, ~weak$$choice2~0=v_~weak$$choice2~0_78, ~x~0=v_~x~0_49, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_275} AuxVars[|v_P0_#t~mem6_65|, |v_P0_#t~ite10_52|, |v_P0_#t~mem9_49|] AssignedVars[P0Thread1of1ForFork0_#t~ite10, P0Thread1of1ForFork0_#res.offset, ~y$w_buff0_used~0, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_#t~mem8, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_#t~mem9, P0Thread1of1ForFork0_#t~mem6, P0Thread1of1ForFork0_#t~mem5, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p0_EAX$read_delayed~0, P0Thread1of1ForFork0_~arg.offset, ~__unbuffered_p0_EBX~0, ~__unbuffered_p0_EAX$read_delayed_var~0.base, ~weak$$choice0~0, ~y$w_buff1~0, P0Thread1of1ForFork0_#t~ite7, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~y$w_buff1_used~0] and [589] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (= (mod v_~y$r_buff0_thd0~0_192 256) 0))) (let ((.cse13 (= (mod v_~y$w_buff0_used~0_357 256) 0)) (.cse11 (= (mod v_~y$w_buff1_used~0_360 256) 0)) (.cse10 (= (mod v_~y$r_buff1_thd0~0_198 256) 0)) (.cse9 (not (= (mod v_~y$w_buff0_used~0_356 256) 0))) (.cse0 (not .cse14))) (let ((.cse8 (and .cse9 .cse0)) (.cse5 (select |v_#memory_int_477| |v_~#y~0.base_215|)) (.cse6 (not .cse10)) (.cse7 (not .cse11)) (.cse1 (not .cse13))) (and (= (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_357) v_~y$w_buff0_used~0_356) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|) (= v_~weak$$choice1~0_135 |v_ULTIMATE.start_main_#t~nondet23#1_203|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem24#1_318| |v_ULTIMATE.start_main_#t~mem24#1_316|)) (.cse4 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_140 256) 0))) (or (and (let ((.cse2 (= (mod v_~weak$$choice1~0_135 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite25#1_313| v_~__unbuffered_p0_EAX~0_259)) (and (= |v_ULTIMATE.start_main_#t~mem24#1_316| (select (select |v_#memory_int_476| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139)) (= |v_ULTIMATE.start_main_#t~ite25#1_313| |v_ULTIMATE.start_main_#t~mem24#1_316|) (not .cse2)))) (= |v_ULTIMATE.start_main_#t~ite25#1_313| v_~__unbuffered_p0_EAX~0_258) (not .cse4)) (and .cse3 (= v_~__unbuffered_p0_EAX~0_259 v_~__unbuffered_p0_EAX~0_258) (= |v_ULTIMATE.start_main_#t~ite25#1_315| |v_ULTIMATE.start_main_#t~ite25#1_313|) .cse4))) (= (store |v_#memory_int_477| |v_~#y~0.base_215| (store .cse5 |v_~#y~0.offset_215| |v_ULTIMATE.start_main_#t~ite22#1_196|)) |v_#memory_int_476|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= v_~y$w_buff1_used~0_359 (ite (or (and .cse6 .cse7) .cse8) 0 v_~y$w_buff1_used~0_360)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_215 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_102) (= v_~y$r_buff0_thd0~0_191 (ite .cse8 0 v_~y$r_buff0_thd0~0_192)) (= v_~y$r_buff1_thd0~0_197 (ite (or (and .cse6 (not (= (mod v_~y$w_buff1_used~0_359 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_191 256) 0)) .cse9)) 0 v_~y$r_buff1_thd0~0_198)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem20#1_258| |v_ULTIMATE.start_main_#t~mem20#1_256|))) (or (and (or (and (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~ite21#1_251| |v_ULTIMATE.start_main_#t~mem20#1_256|) (= (select .cse5 |v_~#y~0.offset_215|) |v_ULTIMATE.start_main_#t~mem20#1_256|)) (and (= v_~y$w_buff1~0_187 |v_ULTIMATE.start_main_#t~ite21#1_251|) .cse6 .cse12 .cse7)) (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite21#1_251| |v_ULTIMATE.start_main_#t~ite22#1_196|)) (and (= |v_ULTIMATE.start_main_#t~ite21#1_253| |v_ULTIMATE.start_main_#t~ite21#1_251|) (= |v_ULTIMATE.start_main_#t~ite22#1_196| v_~y$w_buff0~0_173) .cse12 .cse0 .cse1))) (= (mod v_~main$tmp_guard0~0_102 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103| (mod v_~main$tmp_guard1~0_124 256)) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_109 1) (= v_~__unbuffered_p0_EAX~0_258 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_124))))) InVars {ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_203|, ~#y~0.offset=|v_~#y~0.offset_215|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_111, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_357, ~#y~0.base=|v_~#y~0.base_215|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_258|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_259, ~y$w_buff1~0=v_~y$w_buff1~0_187, ~y$w_buff0~0=v_~y$w_buff0~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_192, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139, #memory_int=|v_#memory_int_477|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite21#1=|v_ULTIMATE.start_main_#t~ite21#1_253|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_215, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_198, ULTIMATE.start_main_#t~ite25#1=|v_ULTIMATE.start_main_#t~ite25#1_315|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_360, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_318|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_99|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|, ~#y~0.offset=|v_~#y~0.offset_215|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_356, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_124, ~#y~0.base=|v_~#y~0.base_215|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_258, ~weak$$choice1~0=v_~weak$$choice1~0_135, ULTIMATE.start_main_#t~ite22#1=|v_ULTIMATE.start_main_#t~ite22#1_195|, ~y$w_buff0~0=v_~y$w_buff0~0_173, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_99|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_111, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_136|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_102, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103|, ~y$w_buff1~0=v_~y$w_buff1~0_187, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_191, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139, #memory_int=|v_#memory_int_476|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_215, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_83|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_197, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_359, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|} AuxVars[|v_ULTIMATE.start_main_#t~mem20#1_256|, |v_ULTIMATE.start_main_#t~ite21#1_251|, |v_ULTIMATE.start_main_#t~mem24#1_316|, |v_ULTIMATE.start_main_#t~ite25#1_313|, |v_ULTIMATE.start_main_#t~ite22#1_196|] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet23#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem20#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite22#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite21#1, ULTIMATE.start_main_#t~nondet19#1, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite25#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] [2022-12-06 01:15:41,395 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [568] $Ultimate##0-->P0EXIT: Formula: (let ((.cse13 (= (mod v_~y$w_buff1_used~0_276 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd1~0_118 256) 0)) (.cse14 (= (mod v_~y$r_buff0_thd1~0_119 256) 0)) (.cse16 (= (mod v_~y$w_buff0_used~0_273 256) 0))) (let ((.cse15 (= 0 (mod v_~weak$$choice2~0_78 256))) (.cse10 (not .cse16)) (.cse11 (not .cse14)) (.cse2 (and .cse5 .cse14)) (.cse3 (and .cse14 .cse13)) (.cse0 (select |v_#memory_int_391| |v_~#y~0.base_173|))) (let ((.cse8 (select .cse0 |v_~#y~0.offset_173|)) (.cse9 (or .cse2 .cse3 .cse16)) (.cse12 (and .cse10 .cse11)) (.cse7 (= (mod v_~y$w_buff1_used~0_275 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_272 256) 0)) (.cse1 (not .cse15))) (and (= (store |v_#memory_int_391| |v_~#y~0.base_173| (store .cse0 |v_~#y~0.offset_173| |v_P0_#t~ite10_52|)) |v_#memory_int_390|) (= v_~y$w_buff1_used~0_275 (ite .cse1 v_~y$w_buff1_used~0_276 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_276 0))) (= v_~y$w_buff1~0_144 v_~y$w_buff1~0_143) (= 0 |v_P0Thread1of1ForFork0_#res.offset_31|) (= |v_P0Thread1of1ForFork0_#t~nondet3_46| v_~weak$$choice0~0_49) (= v_~__unbuffered_p0_EBX~0_71 v_~x~0_49) (= v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_99 |v_~#y~0.offset_173|) (= (ite .cse1 v_~y$r_buff1_thd1~0_118 (ite (let ((.cse6 (= (mod v_~y$r_buff0_thd1~0_118 256) 0))) (or (and .cse5 .cse6) (and .cse6 .cse7) .cse4)) v_~y$r_buff1_thd1~0_118 0)) v_~y$r_buff1_thd1~0_117) (= v_~__unbuffered_p0_EAX$read_delayed~0_100 1) (= v_~y$mem_tmp~0_44 .cse8) (or (and (= v_~__unbuffered_p0_EAX~0_180 |v_P0_#t~mem6_65|) .cse9 (= .cse8 |v_P0_#t~mem6_65|)) (and (= |v_P0Thread1of1ForFork0_#t~mem6_46| |v_P0_#t~mem6_65|) .cse10 (or .cse11 (not .cse5)) (= (ite .cse12 v_~y$w_buff0~0_130 v_~y$w_buff1~0_144) v_~__unbuffered_p0_EAX~0_180) (or (not .cse13) .cse11))) (= v_~__unbuffered_cnt~0_179 (+ v_~__unbuffered_cnt~0_180 1)) (= |v_P0Thread1of1ForFork0_#res.base_31| 0) (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= |v_P0Thread1of1ForFork0_#t~nondet4_46| v_~weak$$choice2~0_78) (= (ite .cse1 v_~y$w_buff0_used~0_273 (ite .cse9 v_~y$w_buff0_used~0_273 (ite .cse12 0 v_~y$w_buff0_used~0_273))) v_~y$w_buff0_used~0_272) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= 0 v_~y$flush_delayed~0_60) (= v_~y$r_buff0_thd1~0_118 (ite .cse1 v_~y$r_buff0_thd1~0_119 (ite (or (and .cse14 .cse7) .cse2 .cse4) v_~y$r_buff0_thd1~0_119 (ite (and .cse11 (not .cse4)) 0 v_~y$r_buff0_thd1~0_119)))) (or (and (= |v_P0Thread1of1ForFork0_#t~mem9_46| |v_P0_#t~mem9_49|) .cse1 (= |v_P0_#t~ite10_52| v_~y$mem_tmp~0_44)) (and (= |v_P0_#t~ite10_52| |v_P0_#t~mem9_49|) .cse15 (= v_~__unbuffered_p0_EAX~0_180 |v_P0_#t~mem9_49|))) (= v_~y$w_buff0~0_129 v_~y$w_buff0~0_130) (= |v_~#y~0.base_173| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_99))))) InVars {~#y~0.offset=|v_~#y~0.offset_173|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_273, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~#y~0.base=|v_~#y~0.base_173|, P0Thread1of1ForFork0_#t~mem9=|v_P0Thread1of1ForFork0_#t~mem9_46|, P0Thread1of1ForFork0_#t~mem6=|v_P0Thread1of1ForFork0_#t~mem6_46|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_118, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~y$w_buff1~0=v_~y$w_buff1~0_144, ~y$w_buff0~0=v_~y$w_buff0~0_130, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_119, #memory_int=|v_#memory_int_391|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_180, P0Thread1of1ForFork0_#t~nondet4=|v_P0Thread1of1ForFork0_#t~nondet4_46|, P0Thread1of1ForFork0_#t~nondet3=|v_P0Thread1of1ForFork0_#t~nondet3_46|, ~x~0=v_~x~0_49, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_276} OutVars{P0Thread1of1ForFork0_#t~ite10=|v_P0Thread1of1ForFork0_#t~ite10_25|, ~#y~0.offset=|v_~#y~0.offset_173|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_31|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_272, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_31|, ~#y~0.base=|v_~#y~0.base_173|, P0Thread1of1ForFork0_#t~mem8=|v_P0Thread1of1ForFork0_#t~mem8_25|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, P0Thread1of1ForFork0_#t~mem5=|v_P0Thread1of1ForFork0_#t~mem5_25|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_117, ~y$mem_tmp~0=v_~y$mem_tmp~0_44, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_180, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~y$w_buff0~0=v_~y$w_buff0~0_129, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_118, ~y$flush_delayed~0=v_~y$flush_delayed~0_60, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_100, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_71, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_99, ~weak$$choice0~0=v_~weak$$choice0~0_49, ~y$w_buff1~0=v_~y$w_buff1~0_143, P0Thread1of1ForFork0_#t~ite7=|v_P0Thread1of1ForFork0_#t~ite7_25|, #memory_int=|v_#memory_int_390|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_179, ~weak$$choice2~0=v_~weak$$choice2~0_78, ~x~0=v_~x~0_49, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_275} AuxVars[|v_P0_#t~mem6_65|, |v_P0_#t~ite10_52|, |v_P0_#t~mem9_49|] AssignedVars[P0Thread1of1ForFork0_#t~ite10, P0Thread1of1ForFork0_#res.offset, ~y$w_buff0_used~0, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_#t~mem8, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_#t~mem9, P0Thread1of1ForFork0_#t~mem6, P0Thread1of1ForFork0_#t~mem5, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p0_EAX$read_delayed~0, P0Thread1of1ForFork0_~arg.offset, ~__unbuffered_p0_EBX~0, ~__unbuffered_p0_EAX$read_delayed_var~0.base, ~weak$$choice0~0, ~y$w_buff1~0, P0Thread1of1ForFork0_#t~ite7, #memory_int, ~__unbuffered_p0_EAX$read_delayed_var~0.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_#t~nondet4, P0Thread1of1ForFork0_#t~nondet3, ~weak$$choice2~0, ~y$w_buff1_used~0] and [589] L836-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (= (mod v_~y$r_buff0_thd0~0_192 256) 0))) (let ((.cse13 (= (mod v_~y$w_buff0_used~0_357 256) 0)) (.cse11 (= (mod v_~y$w_buff1_used~0_360 256) 0)) (.cse10 (= (mod v_~y$r_buff1_thd0~0_198 256) 0)) (.cse9 (not (= (mod v_~y$w_buff0_used~0_356 256) 0))) (.cse0 (not .cse14))) (let ((.cse8 (and .cse9 .cse0)) (.cse5 (select |v_#memory_int_477| |v_~#y~0.base_215|)) (.cse6 (not .cse10)) (.cse7 (not .cse11)) (.cse1 (not .cse13))) (and (= (ite (and .cse0 .cse1) 0 v_~y$w_buff0_used~0_357) v_~y$w_buff0_used~0_356) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|) (= v_~weak$$choice1~0_135 |v_ULTIMATE.start_main_#t~nondet23#1_203|) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem24#1_318| |v_ULTIMATE.start_main_#t~mem24#1_316|)) (.cse4 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_140 256) 0))) (or (and (let ((.cse2 (= (mod v_~weak$$choice1~0_135 256) 0))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite25#1_313| v_~__unbuffered_p0_EAX~0_259)) (and (= |v_ULTIMATE.start_main_#t~mem24#1_316| (select (select |v_#memory_int_476| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139)) (= |v_ULTIMATE.start_main_#t~ite25#1_313| |v_ULTIMATE.start_main_#t~mem24#1_316|) (not .cse2)))) (= |v_ULTIMATE.start_main_#t~ite25#1_313| v_~__unbuffered_p0_EAX~0_258) (not .cse4)) (and .cse3 (= v_~__unbuffered_p0_EAX~0_259 v_~__unbuffered_p0_EAX~0_258) (= |v_ULTIMATE.start_main_#t~ite25#1_315| |v_ULTIMATE.start_main_#t~ite25#1_313|) .cse4))) (= (store |v_#memory_int_477| |v_~#y~0.base_215| (store .cse5 |v_~#y~0.offset_215| |v_ULTIMATE.start_main_#t~ite22#1_196|)) |v_#memory_int_476|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_99| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= v_~y$w_buff1_used~0_359 (ite (or (and .cse6 .cse7) .cse8) 0 v_~y$w_buff1_used~0_360)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_105| 0) (= (ite (= (ite (= v_~__unbuffered_cnt~0_215 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_102) (= v_~y$r_buff0_thd0~0_191 (ite .cse8 0 v_~y$r_buff0_thd0~0_192)) (= v_~y$r_buff1_thd0~0_197 (ite (or (and .cse6 (not (= (mod v_~y$w_buff1_used~0_359 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_191 256) 0)) .cse9)) 0 v_~y$r_buff1_thd0~0_198)) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~mem20#1_258| |v_ULTIMATE.start_main_#t~mem20#1_256|))) (or (and (or (and (or .cse10 .cse11) (= |v_ULTIMATE.start_main_#t~ite21#1_251| |v_ULTIMATE.start_main_#t~mem20#1_256|) (= (select .cse5 |v_~#y~0.offset_215|) |v_ULTIMATE.start_main_#t~mem20#1_256|)) (and (= v_~y$w_buff1~0_187 |v_ULTIMATE.start_main_#t~ite21#1_251|) .cse6 .cse12 .cse7)) (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite21#1_251| |v_ULTIMATE.start_main_#t~ite22#1_196|)) (and (= |v_ULTIMATE.start_main_#t~ite21#1_253| |v_ULTIMATE.start_main_#t~ite21#1_251|) (= |v_ULTIMATE.start_main_#t~ite22#1_196| v_~y$w_buff0~0_173) .cse12 .cse0 .cse1))) (= (mod v_~main$tmp_guard0~0_102 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103| (mod v_~main$tmp_guard1~0_124 256)) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_111 0) (= v_~__unbuffered_p2_EAX~0_109 1) (= v_~__unbuffered_p0_EAX~0_258 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_124))))) InVars {ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_203|, ~#y~0.offset=|v_~#y~0.offset_215|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_111, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_357, ~#y~0.base=|v_~#y~0.base_215|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_258|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_259, ~y$w_buff1~0=v_~y$w_buff1~0_187, ~y$w_buff0~0=v_~y$w_buff0~0_173, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_192, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139, #memory_int=|v_#memory_int_477|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ULTIMATE.start_main_#t~ite21#1=|v_ULTIMATE.start_main_#t~ite21#1_253|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_215, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_198, ULTIMATE.start_main_#t~ite25#1=|v_ULTIMATE.start_main_#t~ite25#1_315|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_360, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_318|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_99|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_105|, ~#y~0.offset=|v_~#y~0.offset_215|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_356, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_124, ~#y~0.base=|v_~#y~0.base_215|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_258, ~weak$$choice1~0=v_~weak$$choice1~0_135, ULTIMATE.start_main_#t~ite22#1=|v_ULTIMATE.start_main_#t~ite22#1_195|, ~y$w_buff0~0=v_~y$w_buff0~0_173, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_99|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_109, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_140, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_111, ULTIMATE.start_main_#t~ite26#1=|v_ULTIMATE.start_main_#t~ite26#1_136|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_102, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_139, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_103|, ~y$w_buff1~0=v_~y$w_buff1~0_187, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_191, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_139, #memory_int=|v_#memory_int_476|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_215, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_83|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_197, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_359, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_89|} AuxVars[|v_ULTIMATE.start_main_#t~mem20#1_256|, |v_ULTIMATE.start_main_#t~ite21#1_251|, |v_ULTIMATE.start_main_#t~mem24#1_316|, |v_ULTIMATE.start_main_#t~ite25#1_313|, |v_ULTIMATE.start_main_#t~ite22#1_196|] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet23#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite26#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~mem20#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite22#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y$r_buff0_thd0~0, #memory_int, ULTIMATE.start_main_#t~ite21#1, ULTIMATE.start_main_#t~nondet19#1, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite25#1, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] [2022-12-06 01:15:44,464 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 01:15:44,465 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9120 [2022-12-06 01:15:44,465 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 152 transitions, 3401 flow [2022-12-06 01:15:44,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 01:15:44,465 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 01:15:44,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:44,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 01:15:44,465 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 01:15:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 01:15:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash -302404130, now seen corresponding path program 1 times [2022-12-06 01:15:44,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 01:15:44,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18340933] [2022-12-06 01:15:44,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 01:15:44,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 01:15:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 01:15:44,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 01:15:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 01:15:44,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 01:15:44,569 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 01:15:44,569 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 01:15:44,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 01:15:44,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 01:15:44,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 01:15:44,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 01:15:44,571 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 01:15:44,574 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 01:15:44,574 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 01:15:44,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 01:15:44 BasicIcfg [2022-12-06 01:15:44,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 01:15:44,638 INFO L158 Benchmark]: Toolchain (without parser) took 42473.07ms. Allocated memory was 181.4MB in the beginning and 350.2MB in the end (delta: 168.8MB). Free memory was 156.2MB in the beginning and 137.8MB in the end (delta: 18.5MB). Peak memory consumption was 188.3MB. Max. memory is 8.0GB. [2022-12-06 01:15:44,639 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 181.4MB. Free memory was 158.5MB in the beginning and 158.5MB in the end (delta: 69.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 01:15:44,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.79ms. Allocated memory is still 181.4MB. Free memory was 156.2MB in the beginning and 130.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 01:15:44,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.06ms. Allocated memory is still 181.4MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:15:44,639 INFO L158 Benchmark]: Boogie Preprocessor took 34.85ms. Allocated memory is still 181.4MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 01:15:44,639 INFO L158 Benchmark]: RCFGBuilder took 676.51ms. Allocated memory is still 181.4MB. Free memory was 126.3MB in the beginning and 80.7MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2022-12-06 01:15:44,639 INFO L158 Benchmark]: TraceAbstraction took 41292.27ms. Allocated memory was 181.4MB in the beginning and 350.2MB in the end (delta: 168.8MB). Free memory was 80.2MB in the beginning and 137.8MB in the end (delta: -57.6MB). Peak memory consumption was 112.8MB. Max. memory is 8.0GB. [2022-12-06 01:15:44,640 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.08ms. Allocated memory is still 181.4MB. Free memory was 158.5MB in the beginning and 158.5MB in the end (delta: 69.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 421.79ms. Allocated memory is still 181.4MB. Free memory was 156.2MB in the beginning and 130.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.06ms. Allocated memory is still 181.4MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.85ms. Allocated memory is still 181.4MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 676.51ms. Allocated memory is still 181.4MB. Free memory was 126.3MB in the beginning and 80.7MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 41292.27ms. Allocated memory was 181.4MB in the beginning and 350.2MB in the end (delta: 168.8MB). Free memory was 80.2MB in the beginning and 137.8MB in the end (delta: -57.6MB). Peak memory consumption was 112.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 117 PlacesBefore, 28 PlacesAfterwards, 108 TransitionsBefore, 19 TransitionsAfterwards, 1064 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 806, independent: 765, independent conditional: 765, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 806, independent: 765, independent conditional: 0, independent unconditional: 765, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 806, independent: 765, independent conditional: 0, independent unconditional: 765, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 806, independent: 765, independent conditional: 0, independent unconditional: 765, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 690, independent: 657, independent conditional: 0, independent unconditional: 657, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 690, independent: 628, independent conditional: 0, independent unconditional: 628, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 238, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 806, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 690, unknown conditional: 0, unknown unconditional: 690] , Statistics on independence cache: Total cache size (in pairs): 1010, Positive cache size: 977, Positive conditional cache size: 0, Positive unconditional cache size: 977, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 29 PlacesBefore, 26 PlacesAfterwards, 18 TransitionsBefore, 15 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 28 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 31 PlacesBefore, 31 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 33 PlacesBefore, 33 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.4s, 41 PlacesBefore, 42 PlacesAfterwards, 153 TransitionsBefore, 156 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 46 PlacesBefore, 46 PlacesAfterwards, 168 TransitionsBefore, 168 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 162 TransitionsBefore, 162 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.1s, 55 PlacesBefore, 54 PlacesAfterwards, 160 TransitionsBefore, 152 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2213; [L832] FCALL, FORK 0 pthread_create(&t2213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2213, ((void *)0), P0, ((void *)0))=-1, t2213={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 pthread_t t2214; [L834] FCALL, FORK 0 pthread_create(&t2214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2214, ((void *)0), P1, ((void *)0))=0, t2213={7:0}, t2214={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 pthread_t t2215; [L836] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2215, ((void *)0), P2, ((void *)0))=1, t2213={7:0}, t2214={8:0}, t2215={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 [L779] 1 __unbuffered_p0_EBX = x [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L803] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 y = 1 [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 \read(y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 3 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 3 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 3 !(!cond) [L840] RET 3 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 3 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] EXPR 3 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 3 \read(y) [L842] EXPR 3 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 3 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] 3 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 3 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 3 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L849] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L850] EXPR 3 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] EXPR 3 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 3 \read(*__unbuffered_p0_EAX$read_delayed_var) [L850] EXPR 3 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 3 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] 3 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 3 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L853] CALL 3 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 3 !expression [L19] 3 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 832]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 locations, 4 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: 41.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 385 IncrementalHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 0 mSDtfsCounter, 385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3559occurred in iteration=10, InterpolantAutomatonStates: 40, 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, 2.4s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 858 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 01:15:44,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...