/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:08:32,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:08:32,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:08:32,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:08:32,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:08:32,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:08:32,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:08:32,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:08:32,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:08:32,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:08:32,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:08:32,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:08:32,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:08:32,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:08:32,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:08:32,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:08:32,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:08:32,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:08:32,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:08:32,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:08:32,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:08:32,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:08:32,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:08:32,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:08:32,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:08:32,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:08:32,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:08:32,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:08:32,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:08:32,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:08:32,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:08:32,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:08:32,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:08:32,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:08:32,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:08:32,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:08:32,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:08:32,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:08:32,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:08:32,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:08:32,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:08:32,866 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-05 23:08:32,891 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:08:32,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:08:32,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:08:32,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:08:32,893 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:08:32,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:08:32,894 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:08:32,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:08:32,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:08:32,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:08:32,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:08:32,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:08:32,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:08:32,895 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:08:32,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:08:32,895 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:08:32,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:08:32,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:08:32,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:08:32,896 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:08:32,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:08:32,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:08:32,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:08:32,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:08:32,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:08:32,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:08:32,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:08:32,896 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:08:32,897 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 23:08:33,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:08:33,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:08:33,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:08:33,160 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:08:33,161 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:08:33,162 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004.i [2022-12-05 23:08:34,088 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:08:34,263 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:08:34,264 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004.i [2022-12-05 23:08:34,277 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60abbc898/4a61232d12944618be2e9e74983b5c35/FLAG039d11050 [2022-12-05 23:08:34,286 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60abbc898/4a61232d12944618be2e9e74983b5c35 [2022-12-05 23:08:34,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:08:34,288 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:08:34,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:08:34,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:08:34,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:08:34,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:08:34" (1/1) ... [2022-12-05 23:08:34,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd558d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34, skipping insertion in model container [2022-12-05 23:08:34,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:08:34" (1/1) ... [2022-12-05 23:08:34,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:08:34,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:08:34,435 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/rfi004.i[983,996] [2022-12-05 23:08:34,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:08:34,548 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:08:34,562 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/rfi004.i[983,996] [2022-12-05 23:08:34,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:08:34,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:08:34,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:08:34,665 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:08:34,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34 WrapperNode [2022-12-05 23:08:34,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:08:34,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:08:34,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:08:34,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:08:34,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34" (1/1) ... [2022-12-05 23:08:34,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34" (1/1) ... [2022-12-05 23:08:34,724 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2022-12-05 23:08:34,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:08:34,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:08:34,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:08:34,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:08:34,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34" (1/1) ... [2022-12-05 23:08:34,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34" (1/1) ... [2022-12-05 23:08:34,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34" (1/1) ... [2022-12-05 23:08:34,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34" (1/1) ... [2022-12-05 23:08:34,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34" (1/1) ... [2022-12-05 23:08:34,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34" (1/1) ... [2022-12-05 23:08:34,753 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34" (1/1) ... [2022-12-05 23:08:34,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34" (1/1) ... [2022-12-05 23:08:34,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:08:34,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:08:34,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:08:34,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:08:34,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34" (1/1) ... [2022-12-05 23:08:34,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:08:34,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:08:34,795 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-05 23:08:34,802 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-05 23:08:34,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:08:34,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:08:34,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:08:34,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:08:34,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:08:34,828 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:08:34,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:08:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:08:34,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:08:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:08:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:08:34,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:08:34,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:08:34,831 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:08:34,975 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:08:34,976 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:08:35,175 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:08:35,284 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:08:35,284 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:08:35,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:08:35 BoogieIcfgContainer [2022-12-05 23:08:35,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:08:35,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:08:35,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:08:35,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:08:35,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:08:34" (1/3) ... [2022-12-05 23:08:35,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e149a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:08:35, skipping insertion in model container [2022-12-05 23:08:35,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:08:34" (2/3) ... [2022-12-05 23:08:35,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e149a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:08:35, skipping insertion in model container [2022-12-05 23:08:35,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:08:35" (3/3) ... [2022-12-05 23:08:35,291 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i [2022-12-05 23:08:35,303 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:08:35,303 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:08:35,303 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:08:35,331 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:08:35,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-05 23:08:35,381 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-05 23:08:35,381 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:35,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-05 23:08:35,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-05 23:08:35,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-05 23:08:35,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:35,399 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-05 23:08:35,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-05 23:08:35,417 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-05 23:08:35,417 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:35,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-05 23:08:35,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-05 23:08:35,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 1068 [2022-12-05 23:08:39,384 INFO L203 LiptonReduction]: Total number of compositions: 72 [2022-12-05 23:08:39,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:08:39,412 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;@6bb43481, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:08:39,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:08:39,416 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-05 23:08:39,416 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:39,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:39,416 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:08:39,417 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:39,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:39,421 INFO L85 PathProgramCache]: Analyzing trace with hash 387666095, now seen corresponding path program 1 times [2022-12-05 23:08:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:39,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161402293] [2022-12-05 23:08:39,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:39,754 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-05 23:08:39,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:39,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161402293] [2022-12-05 23:08:39,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161402293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:39,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:39,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:08:39,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319016117] [2022-12-05 23:08:39,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:39,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:08:39,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:39,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:08:39,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:08:39,788 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 23:08:39,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-05 23:08:39,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:39,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 23:08:39,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:39,864 INFO L130 PetriNetUnfolder]: 173/326 cut-off events. [2022-12-05 23:08:39,864 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:08:39,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 326 events. 173/326 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1273 event pairs, 21 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 632. Up to 249 conditions per place. [2022-12-05 23:08:39,867 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 2 changer transitions 4/25 dead transitions. [2022-12-05 23:08:39,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 104 flow [2022-12-05 23:08:39,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:08:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:08:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-05 23:08:39,875 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-05 23:08:39,876 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-05 23:08:39,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 104 flow [2022-12-05 23:08:39,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:39,879 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2022-12-05 23:08:39,881 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2022-12-05 23:08:39,883 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2022-12-05 23:08:39,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:39,883 INFO L89 Accepts]: Start accepts. Operand has 24 places, 15 transitions, 38 flow [2022-12-05 23:08:39,885 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:39,885 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:39,885 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 15 transitions, 38 flow [2022-12-05 23:08:39,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 15 transitions, 38 flow [2022-12-05 23:08:39,889 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-05 23:08:39,889 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:39,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 15 events. 0/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:08:39,889 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 15 transitions, 38 flow [2022-12-05 23:08:39,889 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-05 23:08:40,030 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:08:40,032 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-05 23:08:40,032 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 36 flow [2022-12-05 23:08:40,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-05 23:08:40,032 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:40,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:40,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:08:40,033 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:40,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:40,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1114978531, now seen corresponding path program 1 times [2022-12-05 23:08:40,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:40,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216134030] [2022-12-05 23:08:40,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:40,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:40,148 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-05 23:08:40,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:40,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216134030] [2022-12-05 23:08:40,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216134030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:40,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:40,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:08:40,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836798735] [2022-12-05 23:08:40,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:40,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:08:40,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:40,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:08:40,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:08:40,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-05 23:08:40,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 36 flow. Second operand has 3 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-05 23:08:40,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:40,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-05 23:08:40,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:40,202 INFO L130 PetriNetUnfolder]: 80/161 cut-off events. [2022-12-05 23:08:40,202 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-05 23:08:40,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 161 events. 80/161 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 528 event pairs, 20 based on Foata normal form. 4/165 useless extension candidates. Maximal degree in co-relation 326. Up to 117 conditions per place. [2022-12-05 23:08:40,207 INFO L137 encePairwiseOnDemand]: 11/14 looper letters, 16 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2022-12-05 23:08:40,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 19 transitions, 82 flow [2022-12-05 23:08:40,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:08:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:08:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-12-05 23:08:40,208 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-05 23:08:40,208 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 36 flow. Second operand 3 states and 22 transitions. [2022-12-05 23:08:40,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 19 transitions, 82 flow [2022-12-05 23:08:40,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:40,210 INFO L231 Difference]: Finished difference. Result has 22 places, 14 transitions, 40 flow [2022-12-05 23:08:40,210 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=22, PETRI_TRANSITIONS=14} [2022-12-05 23:08:40,210 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -4 predicate places. [2022-12-05 23:08:40,210 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:40,210 INFO L89 Accepts]: Start accepts. Operand has 22 places, 14 transitions, 40 flow [2022-12-05 23:08:40,211 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:40,211 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:40,211 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 14 transitions, 40 flow [2022-12-05 23:08:40,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 14 transitions, 40 flow [2022-12-05 23:08:40,214 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-05 23:08:40,214 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:08:40,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 14 events. 0/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:08:40,215 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 14 transitions, 40 flow [2022-12-05 23:08:40,215 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-05 23:08:40,230 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:40,231 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-05 23:08:40,231 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 14 transitions, 40 flow [2022-12-05 23:08:40,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-05 23:08:40,232 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:40,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:40,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:08:40,232 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:40,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:40,232 INFO L85 PathProgramCache]: Analyzing trace with hash -204595292, now seen corresponding path program 1 times [2022-12-05 23:08:40,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:40,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360439103] [2022-12-05 23:08:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:40,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:40,406 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-05 23:08:40,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:40,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360439103] [2022-12-05 23:08:40,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360439103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:40,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:40,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:08:40,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728217394] [2022-12-05 23:08:40,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:40,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:08:40,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:40,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:08:40,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:08:40,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-05 23:08:40,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 14 transitions, 40 flow. Second operand has 4 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-05 23:08:40,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:40,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-05 23:08:40,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:40,471 INFO L130 PetriNetUnfolder]: 49/113 cut-off events. [2022-12-05 23:08:40,471 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-05 23:08:40,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 113 events. 49/113 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 355 event pairs, 11 based on Foata normal form. 16/129 useless extension candidates. Maximal degree in co-relation 253. Up to 54 conditions per place. [2022-12-05 23:08:40,496 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 18 selfloop transitions, 3 changer transitions 13/35 dead transitions. [2022-12-05 23:08:40,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 35 transitions, 161 flow [2022-12-05 23:08:40,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:08:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:08:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-05 23:08:40,499 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2022-12-05 23:08:40,499 INFO L175 Difference]: Start difference. First operand has 22 places, 14 transitions, 40 flow. Second operand 5 states and 41 transitions. [2022-12-05 23:08:40,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 35 transitions, 161 flow [2022-12-05 23:08:40,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 151 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:08:40,500 INFO L231 Difference]: Finished difference. Result has 27 places, 16 transitions, 63 flow [2022-12-05 23:08:40,500 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=27, PETRI_TRANSITIONS=16} [2022-12-05 23:08:40,500 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2022-12-05 23:08:40,500 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:40,500 INFO L89 Accepts]: Start accepts. Operand has 27 places, 16 transitions, 63 flow [2022-12-05 23:08:40,501 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:40,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:40,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 16 transitions, 63 flow [2022-12-05 23:08:40,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 16 transitions, 63 flow [2022-12-05 23:08:40,505 INFO L130 PetriNetUnfolder]: 5/26 cut-off events. [2022-12-05 23:08:40,505 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-05 23:08:40,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 26 events. 5/26 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 55. Up to 12 conditions per place. [2022-12-05 23:08:40,505 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 16 transitions, 63 flow [2022-12-05 23:08:40,505 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-05 23:08:40,506 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:08:40,506 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-05 23:08:40,507 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 63 flow [2022-12-05 23:08:40,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-05 23:08:40,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:40,507 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:40,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:08:40,507 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:40,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:40,507 INFO L85 PathProgramCache]: Analyzing trace with hash 735540977, now seen corresponding path program 1 times [2022-12-05 23:08:40,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:40,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522107371] [2022-12-05 23:08:40,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:40,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:40,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-05 23:08:40,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:40,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522107371] [2022-12-05 23:08:40,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522107371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:40,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:40,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:08:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133219875] [2022-12-05 23:08:40,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:40,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:08:40,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:40,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:08:40,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:08:40,614 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-05 23:08:40,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-05 23:08:40,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:40,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-05 23:08:40,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:40,667 INFO L130 PetriNetUnfolder]: 20/58 cut-off events. [2022-12-05 23:08:40,668 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 23:08:40,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 58 events. 20/58 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 126 event pairs, 8 based on Foata normal form. 7/65 useless extension candidates. Maximal degree in co-relation 156. Up to 24 conditions per place. [2022-12-05 23:08:40,668 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 16 selfloop transitions, 5 changer transitions 7/29 dead transitions. [2022-12-05 23:08:40,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 29 transitions, 159 flow [2022-12-05 23:08:40,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:08:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:08:40,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-12-05 23:08:40,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-05 23:08:40,669 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 63 flow. Second operand 6 states and 36 transitions. [2022-12-05 23:08:40,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 29 transitions, 159 flow [2022-12-05 23:08:40,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 29 transitions, 140 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-05 23:08:40,671 INFO L231 Difference]: Finished difference. Result has 30 places, 16 transitions, 70 flow [2022-12-05 23:08:40,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=16} [2022-12-05 23:08:40,671 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-05 23:08:40,672 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:40,672 INFO L89 Accepts]: Start accepts. Operand has 30 places, 16 transitions, 70 flow [2022-12-05 23:08:40,672 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:40,672 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:40,673 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 16 transitions, 70 flow [2022-12-05 23:08:40,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 16 transitions, 70 flow [2022-12-05 23:08:40,675 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2022-12-05 23:08:40,675 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-05 23:08:40,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 16 events. 1/16 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 8 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 32. Up to 6 conditions per place. [2022-12-05 23:08:40,676 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 16 transitions, 70 flow [2022-12-05 23:08:40,676 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-05 23:08:40,983 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:08:40,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 312 [2022-12-05 23:08:40,984 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 14 transitions, 66 flow [2022-12-05 23:08:40,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-05 23:08:40,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:40,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:40,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:08:40,984 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:40,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:40,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1240751865, now seen corresponding path program 1 times [2022-12-05 23:08:40,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:40,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889315144] [2022-12-05 23:08:40,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:40,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:41,279 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-05 23:08:41,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:41,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889315144] [2022-12-05 23:08:41,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889315144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:41,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:41,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:08:41,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633157433] [2022-12-05 23:08:41,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:41,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:08:41,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:41,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:08:41,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:08:41,282 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 12 [2022-12-05 23:08:41,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 14 transitions, 66 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-05 23:08:41,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:41,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 12 [2022-12-05 23:08:41,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:41,370 INFO L130 PetriNetUnfolder]: 25/70 cut-off events. [2022-12-05 23:08:41,370 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-05 23:08:41,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 70 events. 25/70 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 200 event pairs, 0 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 192. Up to 34 conditions per place. [2022-12-05 23:08:41,371 INFO L137 encePairwiseOnDemand]: 5/12 looper letters, 17 selfloop transitions, 10 changer transitions 9/36 dead transitions. [2022-12-05 23:08:41,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 36 transitions, 221 flow [2022-12-05 23:08:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:08:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:08:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-12-05 23:08:41,372 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-05 23:08:41,372 INFO L175 Difference]: Start difference. First operand has 26 places, 14 transitions, 66 flow. Second operand 7 states and 33 transitions. [2022-12-05 23:08:41,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 36 transitions, 221 flow [2022-12-05 23:08:41,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 36 transitions, 194 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-05 23:08:41,374 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 100 flow [2022-12-05 23:08:41,374 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=100, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-05 23:08:41,374 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2022-12-05 23:08:41,374 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:41,374 INFO L89 Accepts]: Start accepts. Operand has 29 places, 21 transitions, 100 flow [2022-12-05 23:08:41,375 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:41,375 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:41,375 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 100 flow [2022-12-05 23:08:41,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 21 transitions, 100 flow [2022-12-05 23:08:41,380 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-05 23:08:41,380 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-05 23:08:41,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 36 events. 6/36 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 82 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 83. Up to 9 conditions per place. [2022-12-05 23:08:41,380 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 21 transitions, 100 flow [2022-12-05 23:08:41,380 INFO L188 LiptonReduction]: Number of co-enabled transitions 28 [2022-12-05 23:08:41,691 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] $Ultimate##0-->L791: Formula: (and (= v_~__unbuffered_p1_EBX~0_72 v_~x~0_46) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.base_34| |v_P1Thread1of1ForFork0_#in~arg#1.base_34|) (= v_~z~0_47 v_~__unbuffered_p1_EAX~0_80) (= v_~y$r_buff0_thd1~0_155 v_~y$r_buff1_thd1~0_150) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_296 256) 0)) (not (= (mod v_~y$w_buff0_used~0_334 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|) (= v_~y$w_buff0_used~0_334 1) (= v_~y$r_buff0_thd2~0_146 1) (= v_~y$r_buff0_thd0~0_151 v_~y$r_buff1_thd0~0_146) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_34| |v_P1Thread1of1ForFork0_~arg#1.offset_34|) (= v_~y$w_buff0_used~0_335 v_~y$w_buff1_used~0_296) (= v_~z~0_47 1) (= v_~y$w_buff1~0_188 v_~y$w_buff0~0_214) (= v_~y$w_buff0~0_213 1) (= v_~y$r_buff0_thd2~0_147 v_~y$r_buff1_thd2~0_106)) InVars {P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_34|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_335, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_151, ~y$w_buff0~0=v_~y$w_buff0~0_214, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_147, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_155, ~x~0=v_~x~0_46, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_34|} OutVars{P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_36|, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_34|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_34|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_72, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_334, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_36|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_34|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_150, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_151, ~y$w_buff0~0=v_~y$w_buff0~0_213, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_146, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_155, ~z~0=v_~z~0_47, ~x~0=v_~x~0_46, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_296} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [274] L744-->L762: Formula: (let ((.cse9 (= (mod v_~y$r_buff1_thd1~0_44 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd1~0_46 256) 0))) (let ((.cse7 (not .cse6)) (.cse2 (and .cse6 .cse9)) (.cse3 (and (= (mod v_~y$w_buff1_used~0_89 256) 0) .cse6)) (.cse12 (= (mod v_~y$w_buff0_used~0_104 256) 0))) (let ((.cse10 (or .cse2 .cse3 .cse12)) (.cse11 (and (not .cse12) .cse7))) (let ((.cse1 (ite .cse10 v_~y~0_46 (ite .cse11 v_~y$w_buff0~0_50 v_~y$w_buff1~0_45))) (.cse5 (= (mod v_~y$w_buff1_used~0_88 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_103 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0)))) (and (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_34) (= v_~y~0_44 (ite .cse0 v_~y$mem_tmp~0_14 .cse1)) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_13) (= v_~__unbuffered_p0_EAX~0_6 .cse1) (= v_~y~0_46 v_~y$mem_tmp~0_14) (= v_~y$w_buff1_used~0_88 (ite .cse0 v_~y$w_buff1_used~0_89 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_89 0))) (= 0 v_~y$flush_delayed~0_19) (= v_~y$r_buff0_thd1~0_45 (ite .cse0 v_~y$r_buff0_thd1~0_46 (ite (or .cse2 (and .cse5 .cse6) .cse4) v_~y$r_buff0_thd1~0_46 (ite (and .cse7 (not .cse4)) 0 v_~y$r_buff0_thd1~0_46)))) (= (ite .cse0 v_~y$r_buff1_thd1~0_44 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd1~0_45 256) 0))) (or (and .cse5 .cse8) (and .cse8 .cse9) .cse4)) v_~y$r_buff1_thd1~0_44 0)) v_~y$r_buff1_thd1~0_43) (= v_~y$w_buff1~0_45 v_~y$w_buff1~0_44) (= v_~y$w_buff0~0_49 v_~y$w_buff0~0_50) (= (ite .cse0 v_~y$w_buff0_used~0_104 (ite .cse10 v_~y$w_buff0_used~0_104 (ite .cse11 0 v_~y$w_buff0_used~0_104))) v_~y$w_buff0_used~0_103)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_44, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_46, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~y$mem_tmp~0=v_~y$mem_tmp~0_14, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_45, ~y$flush_delayed~0=v_~y$flush_delayed~0_19, ~y~0=v_~y~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-05 23:08:42,180 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:08:42,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 807 [2022-12-05 23:08:42,181 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 94 flow [2022-12-05 23:08:42,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-05 23:08:42,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:42,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:42,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:08:42,182 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:42,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:42,182 INFO L85 PathProgramCache]: Analyzing trace with hash 935397233, now seen corresponding path program 1 times [2022-12-05 23:08:42,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:42,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89497720] [2022-12-05 23:08:42,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:42,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:42,404 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-05 23:08:42,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:42,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89497720] [2022-12-05 23:08:42,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89497720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:42,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:42,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:08:42,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721758613] [2022-12-05 23:08:42,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:42,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:08:42,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:42,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:08:42,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:08:42,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 23:08:42,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 94 flow. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-05 23:08:42,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:42,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 23:08:42,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:42,478 INFO L130 PetriNetUnfolder]: 22/73 cut-off events. [2022-12-05 23:08:42,478 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-05 23:08:42,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 73 events. 22/73 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 231 event pairs, 9 based on Foata normal form. 2/74 useless extension candidates. Maximal degree in co-relation 246. Up to 39 conditions per place. [2022-12-05 23:08:42,479 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 13 selfloop transitions, 3 changer transitions 19/35 dead transitions. [2022-12-05 23:08:42,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 236 flow [2022-12-05 23:08:42,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:08:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:08:42,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-12-05 23:08:42,480 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-05 23:08:42,480 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 94 flow. Second operand 7 states and 30 transitions. [2022-12-05 23:08:42,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 236 flow [2022-12-05 23:08:42,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 228 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 23:08:42,481 INFO L231 Difference]: Finished difference. Result has 35 places, 16 transitions, 84 flow [2022-12-05 23:08:42,481 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=16} [2022-12-05 23:08:42,482 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-05 23:08:42,482 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:42,482 INFO L89 Accepts]: Start accepts. Operand has 35 places, 16 transitions, 84 flow [2022-12-05 23:08:42,482 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:42,482 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:42,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 16 transitions, 84 flow [2022-12-05 23:08:42,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 16 transitions, 84 flow [2022-12-05 23:08:42,486 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-05 23:08:42,486 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-05 23:08:42,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 26 events. 3/26 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 61. Up to 7 conditions per place. [2022-12-05 23:08:42,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 16 transitions, 84 flow [2022-12-05 23:08:42,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-05 23:08:42,639 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:08:42,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-05 23:08:42,640 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 16 transitions, 84 flow [2022-12-05 23:08:42,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-05 23:08:42,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:42,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:42,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:08:42,641 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:42,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1759341397, now seen corresponding path program 1 times [2022-12-05 23:08:42,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:42,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038069778] [2022-12-05 23:08:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:08:42,827 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-05 23:08:42,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:08:42,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038069778] [2022-12-05 23:08:42,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038069778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:08:42,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:08:42,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:08:42,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356244924] [2022-12-05 23:08:42,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:08:42,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:08:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:08:42,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:08:42,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:08:42,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 14 [2022-12-05 23:08:42,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 16 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-05 23:08:42,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:08:42,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 14 [2022-12-05 23:08:42,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:08:42,917 INFO L130 PetriNetUnfolder]: 11/44 cut-off events. [2022-12-05 23:08:42,917 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-12-05 23:08:42,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 44 events. 11/44 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 2 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 142. Up to 23 conditions per place. [2022-12-05 23:08:42,918 INFO L137 encePairwiseOnDemand]: 8/14 looper letters, 11 selfloop transitions, 4 changer transitions 9/25 dead transitions. [2022-12-05 23:08:42,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 25 transitions, 175 flow [2022-12-05 23:08:42,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:08:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:08:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-12-05 23:08:42,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2022-12-05 23:08:42,919 INFO L175 Difference]: Start difference. First operand has 31 places, 16 transitions, 84 flow. Second operand 5 states and 26 transitions. [2022-12-05 23:08:42,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 25 transitions, 175 flow [2022-12-05 23:08:42,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 158 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-05 23:08:42,920 INFO L231 Difference]: Finished difference. Result has 31 places, 16 transitions, 85 flow [2022-12-05 23:08:42,920 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=31, PETRI_TRANSITIONS=16} [2022-12-05 23:08:42,920 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-12-05 23:08:42,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:08:42,921 INFO L89 Accepts]: Start accepts. Operand has 31 places, 16 transitions, 85 flow [2022-12-05 23:08:42,921 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:08:42,921 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:08:42,921 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 16 transitions, 85 flow [2022-12-05 23:08:42,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 16 transitions, 85 flow [2022-12-05 23:08:42,924 INFO L130 PetriNetUnfolder]: 3/24 cut-off events. [2022-12-05 23:08:42,925 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 23:08:42,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 24 events. 3/24 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2022-12-05 23:08:42,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 16 transitions, 85 flow [2022-12-05 23:08:42,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-05 23:08:43,002 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [283] L788-->L791: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{~x~0=v_~x~0_2, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0] and [274] L744-->L762: Formula: (let ((.cse9 (= (mod v_~y$r_buff1_thd1~0_44 256) 0)) (.cse6 (= (mod v_~y$r_buff0_thd1~0_46 256) 0))) (let ((.cse7 (not .cse6)) (.cse2 (and .cse6 .cse9)) (.cse3 (and (= (mod v_~y$w_buff1_used~0_89 256) 0) .cse6)) (.cse12 (= (mod v_~y$w_buff0_used~0_104 256) 0))) (let ((.cse10 (or .cse2 .cse3 .cse12)) (.cse11 (and (not .cse12) .cse7))) (let ((.cse1 (ite .cse10 v_~y~0_46 (ite .cse11 v_~y$w_buff0~0_50 v_~y$w_buff1~0_45))) (.cse5 (= (mod v_~y$w_buff1_used~0_88 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_103 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0)))) (and (= |v_P0Thread1of1ForFork1_#t~nondet4_1| v_~weak$$choice2~0_34) (= v_~y~0_44 (ite .cse0 v_~y$mem_tmp~0_14 .cse1)) (= |v_P0Thread1of1ForFork1_#t~nondet3_1| v_~weak$$choice0~0_13) (= v_~__unbuffered_p0_EAX~0_6 .cse1) (= v_~y~0_46 v_~y$mem_tmp~0_14) (= v_~y$w_buff1_used~0_88 (ite .cse0 v_~y$w_buff1_used~0_89 (ite (or .cse2 .cse3 .cse4) v_~y$w_buff1_used~0_89 0))) (= 0 v_~y$flush_delayed~0_19) (= v_~y$r_buff0_thd1~0_45 (ite .cse0 v_~y$r_buff0_thd1~0_46 (ite (or .cse2 (and .cse5 .cse6) .cse4) v_~y$r_buff0_thd1~0_46 (ite (and .cse7 (not .cse4)) 0 v_~y$r_buff0_thd1~0_46)))) (= (ite .cse0 v_~y$r_buff1_thd1~0_44 (ite (let ((.cse8 (= (mod v_~y$r_buff0_thd1~0_45 256) 0))) (or (and .cse5 .cse8) (and .cse8 .cse9) .cse4)) v_~y$r_buff1_thd1~0_44 0)) v_~y$r_buff1_thd1~0_43) (= v_~y$w_buff1~0_45 v_~y$w_buff1~0_44) (= v_~y$w_buff0~0_49 v_~y$w_buff0~0_50) (= (ite .cse0 v_~y$w_buff0_used~0_104 (ite .cse10 v_~y$w_buff0_used~0_104 (ite .cse11 0 v_~y$w_buff0_used~0_104))) v_~y$w_buff0_used~0_103)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_44, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_1|, ~y~0=v_~y~0_46, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~y$mem_tmp~0=v_~y$mem_tmp~0_14, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_45, ~y$flush_delayed~0=v_~y$flush_delayed~0_19, ~y~0=v_~y~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-05 23:08:43,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [355] $Ultimate##0-->L744: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_22 1) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_22, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [389] L788-->L762: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd1~0_173 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd1~0_178 256) 0))) (let ((.cse6 (not .cse4)) (.cse11 (and (= (mod v_~y$w_buff1_used~0_325 256) 0) .cse4)) (.cse5 (and .cse4 .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_371 256) 0))) (let ((.cse9 (or .cse11 .cse5 .cse12)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (ite .cse9 v_~y~0_259 (ite .cse10 v_~y$w_buff0~0_244 v_~y$w_buff1~0_211))) (.cse3 (= (mod v_~y$w_buff1_used~0_324 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_95 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_370 256) 0))) (and (= 0 v_~y$flush_delayed~0_84) (= v_~y$w_buff1~0_211 v_~y$w_buff1~0_210) (= v_~y$w_buff0~0_244 v_~y$w_buff0~0_243) (= v_~y~0_258 (ite .cse0 v_~y$mem_tmp~0_81 .cse1)) (= .cse1 v_~__unbuffered_p0_EAX~0_107) (= v_~y$r_buff0_thd1~0_177 (ite .cse0 v_~y$r_buff0_thd1~0_178 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~y$r_buff0_thd1~0_178 (ite (and (not .cse2) .cse6) 0 v_~y$r_buff0_thd1~0_178)))) (= |v_P0Thread1of1ForFork1_#t~nondet4_92| v_~weak$$choice2~0_95) (= |v_P0Thread1of1ForFork1_#t~nondet3_92| v_~weak$$choice0~0_76) (= v_~y~0_259 v_~y$mem_tmp~0_81) (= v_~y$r_buff1_thd1~0_172 (ite .cse0 v_~y$r_buff1_thd1~0_173 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd1~0_177 256) 0))) (or .cse2 (and .cse7 .cse8) (and .cse7 .cse3))) v_~y$r_buff1_thd1~0_173 0))) (= v_~y$w_buff0_used~0_370 (ite .cse0 v_~y$w_buff0_used~0_371 (ite .cse9 v_~y$w_buff0_used~0_371 (ite .cse10 0 v_~y$w_buff0_used~0_371)))) (= v_~__unbuffered_p1_EBX~0_80 v_~x~0_60) (= (ite .cse0 v_~y$w_buff1_used~0_325 (ite (or .cse11 .cse2 .cse5) v_~y$w_buff1_used~0_325 0)) v_~y$w_buff1_used~0_324)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_173, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_371, ~y$w_buff1~0=v_~y$w_buff1~0_211, ~y$w_buff0~0=v_~y$w_buff0~0_244, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_178, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_92|, ~y~0=v_~y~0_259, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_92|, ~x~0=v_~x~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_325} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_80, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_370, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_172, ~weak$$choice0~0=v_~weak$$choice0~0_76, ~y$mem_tmp~0=v_~y$mem_tmp~0_81, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_107, ~y$w_buff1~0=v_~y$w_buff1~0_210, ~y$w_buff0~0=v_~y$w_buff0~0_243, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_84, ~y~0=v_~y~0_258, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~x~0=v_~x~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_324} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-05 23:08:43,679 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [381] $Ultimate##0-->L788: Formula: (and (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_27| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_27|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_27| 0)) (= v_~z~0_38 v_~__unbuffered_p1_EAX~0_65) (= v_~y$w_buff1~0_150 v_~y$w_buff0~0_170) (= v_~z~0_38 1) (= v_~y$r_buff0_thd1~0_123 v_~y$r_buff1_thd1~0_116) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_25| |v_P1Thread1of1ForFork0_~arg#1.offset_25|) (= v_~y$r_buff0_thd2~0_125 v_~y$r_buff1_thd2~0_93) (= v_~y$r_buff0_thd2~0_124 1) (= v_~y$r_buff0_thd0~0_126 v_~y$r_buff1_thd0~0_121) (= v_~y$w_buff0_used~0_279 1) (= v_~y$w_buff0_used~0_280 v_~y$w_buff1_used~0_248) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_279 256) 0)) (not (= (mod v_~y$w_buff1_used~0_248 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_27|) (= v_~y$w_buff0~0_169 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_25| |v_P1Thread1of1ForFork0_#in~arg#1.base_25|)) InVars {P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_25|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_280, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_126, ~y$w_buff0~0=v_~y$w_buff0~0_170, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_123, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_25|} OutVars{P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_27|, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_25|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_25|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_279, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_27|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_93, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_116, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff1~0=v_~y$w_buff1~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_126, ~y$w_buff0~0=v_~y$w_buff0~0_169, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_123, ~z~0=v_~z~0_38, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_248} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [390] $Ultimate##0-->L762: Formula: (let ((.cse7 (= (mod v_~y$r_buff1_thd1~0_177 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd1~0_182 256) 0))) (let ((.cse5 (not .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_375 256) 0)) (.cse4 (and .cse7 .cse3)) (.cse11 (and (= (mod v_~y$w_buff1_used~0_329 256) 0) .cse3))) (let ((.cse9 (or .cse12 .cse4 .cse11)) (.cse10 (and (not .cse12) .cse5))) (let ((.cse2 (= (mod v_~y$w_buff1_used~0_328 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_97 256) 0))) (.cse1 (= 0 (mod v_~y$w_buff0_used~0_374 256))) (.cse8 (ite .cse9 v_~y~0_263 (ite .cse10 v_~y$w_buff0~0_248 v_~y$w_buff1~0_215)))) (and (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= (ite .cse0 v_~y$r_buff0_thd1~0_182 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~y$r_buff0_thd1~0_182 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd1~0_182))) v_~y$r_buff0_thd1~0_181) (= v_~y$r_buff1_thd1~0_176 (ite .cse0 v_~y$r_buff1_thd1~0_177 (ite (let ((.cse6 (= (mod v_~y$r_buff0_thd1~0_181 256) 0))) (or .cse1 (and .cse6 .cse7) (and .cse6 .cse2))) v_~y$r_buff1_thd1~0_177 0))) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~y~0_262 (ite .cse0 v_~y$mem_tmp~0_83 .cse8)) (= |v_P0Thread1of1ForFork1_#t~nondet3_96| v_~weak$$choice0~0_78) (= v_~__unbuffered_p1_EBX~0_82 v_~x~0_62) (= v_~y$w_buff1~0_215 v_~y$w_buff1~0_214) (= v_~x~0_62 1) (= v_~y$w_buff0~0_248 v_~y$w_buff0~0_247) (= 0 v_~y$flush_delayed~0_86) (= v_~y$w_buff0_used~0_374 (ite .cse0 v_~y$w_buff0_used~0_375 (ite .cse9 v_~y$w_buff0_used~0_375 (ite .cse10 0 v_~y$w_buff0_used~0_375)))) (= |v_P0Thread1of1ForFork1_#t~nondet4_96| v_~weak$$choice2~0_97) (= (ite .cse0 v_~y$w_buff1_used~0_329 (ite (or .cse1 .cse4 .cse11) v_~y$w_buff1_used~0_329 0)) v_~y$w_buff1_used~0_328) (= .cse8 v_~__unbuffered_p0_EAX~0_109) (= v_~y~0_263 v_~y$mem_tmp~0_83)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_177, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_375, ~y$w_buff1~0=v_~y$w_buff1~0_215, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_182, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_96|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_263, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_96|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_329} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_82, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_374, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_176, ~weak$$choice0~0=v_~weak$$choice0~0_78, ~y$mem_tmp~0=v_~y$mem_tmp~0_83, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_214, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~y$w_buff0~0=v_~y$w_buff0~0_247, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_181, ~y$flush_delayed~0=v_~y$flush_delayed~0_86, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~y~0=v_~y~0_262, ~weak$$choice2~0=v_~weak$$choice2~0_97, ~x~0=v_~x~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_328} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-05 23:08:44,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [387] $Ultimate##0-->L791: Formula: (and (= |v_P1Thread1of1ForFork0_~arg#1.base_40| |v_P1Thread1of1ForFork0_#in~arg#1.base_40|) (= v_~y$r_buff0_thd2~0_160 1) (= v_~y$r_buff0_thd1~0_163 v_~y$r_buff1_thd1~0_158) (= v_~y$w_buff0_used~0_350 1) (= v_~y$w_buff0~0_227 1) (= v_~y$w_buff1~0_196 v_~y$w_buff0~0_228) (= v_~z~0_53 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_42| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_42|) (= v_~z~0_53 v_~__unbuffered_p1_EAX~0_86) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_42| 0)) (= v_~y$r_buff0_thd0~0_157 v_~y$r_buff1_thd0~0_152) (= v_~y$r_buff0_thd2~0_161 v_~y$r_buff1_thd2~0_114) (= v_~__unbuffered_p1_EBX~0_78 v_~x~0_52) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_40| |v_P1Thread1of1ForFork0_~arg#1.offset_40|) (= v_~y$w_buff0_used~0_351 v_~y$w_buff1_used~0_306) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_42| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_350 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_306 256))))) 1 0))) InVars {P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_40|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_351, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_157, ~y$w_buff0~0=v_~y$w_buff0~0_228, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_161, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_163, ~x~0=v_~x~0_52, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_40|} OutVars{P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_42|, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_40|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_40|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_78, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_42|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_114, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_158, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_40|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_86, ~y$w_buff1~0=v_~y$w_buff1~0_196, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_157, ~y$w_buff0~0=v_~y$w_buff0~0_227, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_160, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_163, ~z~0=v_~z~0_53, ~x~0=v_~x~0_52, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_152, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_306} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [388] $Ultimate##0-->L762: Formula: (let ((.cse4 (= (mod v_~y$r_buff1_thd1~0_161 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd1~0_166 256) 0))) (let ((.cse11 (not .cse10)) (.cse8 (and .cse10 (= (mod v_~y$w_buff1_used~0_309 256) 0))) (.cse12 (= (mod v_~y$w_buff0_used~0_355 256) 0)) (.cse9 (and .cse4 .cse10))) (let ((.cse6 (or .cse8 .cse12 .cse9)) (.cse7 (and (not .cse12) .cse11))) (let ((.cse5 (= (mod v_~y$w_buff1_used~0_308 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_354 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_89 256) 0))) (.cse0 (ite .cse6 v_~y~0_243 (ite .cse7 v_~y$w_buff0~0_232 v_~y$w_buff1~0_199)))) (and (= v_~x~0_54 1) (= v_~y~0_243 v_~y$mem_tmp~0_75) (= v_~y$w_buff0~0_232 v_~y$w_buff0~0_231) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#t~nondet3_80| v_~weak$$choice0~0_70) (= .cse0 v_~__unbuffered_p0_EAX~0_101) (= v_~y$r_buff1_thd1~0_160 (ite .cse1 v_~y$r_buff1_thd1~0_161 (ite (let ((.cse3 (= (mod v_~y$r_buff0_thd1~0_165 256) 0))) (or .cse2 (and .cse3 .cse4) (and .cse3 .cse5))) v_~y$r_buff1_thd1~0_161 0))) (= (ite .cse1 v_~y$w_buff0_used~0_355 (ite .cse6 v_~y$w_buff0_used~0_355 (ite .cse7 0 v_~y$w_buff0_used~0_355))) v_~y$w_buff0_used~0_354) (= v_~y$w_buff1~0_199 v_~y$w_buff1~0_198) (= (ite .cse1 v_~y$w_buff1_used~0_309 (ite (or .cse8 .cse2 .cse9) v_~y$w_buff1_used~0_309 0)) v_~y$w_buff1_used~0_308) (= 0 v_~y$flush_delayed~0_78) (= v_~y$r_buff0_thd1~0_165 (ite .cse1 v_~y$r_buff0_thd1~0_166 (ite (or .cse2 .cse9 (and .cse10 .cse5)) v_~y$r_buff0_thd1~0_166 (ite (and (not .cse2) .cse11) 0 v_~y$r_buff0_thd1~0_166)))) (= |v_P0Thread1of1ForFork1_#t~nondet4_80| v_~weak$$choice2~0_89) (= v_~y~0_242 (ite .cse1 v_~y$mem_tmp~0_75 .cse0)) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_161, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_355, ~y$w_buff1~0=v_~y$w_buff1~0_199, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_232, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_166, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_80|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~y~0=v_~y~0_243, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_80|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_309} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_354, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_160, ~weak$$choice0~0=v_~weak$$choice0~0_70, ~y$mem_tmp~0=v_~y$mem_tmp~0_75, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_198, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~y$w_buff0~0=v_~y$w_buff0~0_231, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_165, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~y~0=v_~y~0_242, ~weak$$choice2~0=v_~weak$$choice2~0_89, ~x~0=v_~x~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_308} AuxVars[] AssignedVars[~y$w_buff0_used~0, P0Thread1of1ForFork1_~arg.base, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~y~0, ~weak$$choice2~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4, ~y$w_buff1_used~0] [2022-12-05 23:08:44,389 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-05 23:08:44,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1469 [2022-12-05 23:08:44,390 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 11 transitions, 69 flow [2022-12-05 23:08:44,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-05 23:08:44,390 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:08:44,390 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:44,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:08:44,390 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:08:44,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:08:44,390 INFO L85 PathProgramCache]: Analyzing trace with hash -203459033, now seen corresponding path program 1 times [2022-12-05 23:08:44,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:08:44,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942968402] [2022-12-05 23:08:44,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:08:44,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:08:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:08:44,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:08:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:08:44,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:08:44,440 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:08:44,440 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 23:08:44,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 23:08:44,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 23:08:44,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 23:08:44,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 23:08:44,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:08:44,442 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:08:44,445 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:08:44,446 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:08:44,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:08:44 BasicIcfg [2022-12-05 23:08:44,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:08:44,468 INFO L158 Benchmark]: Toolchain (without parser) took 10179.56ms. Allocated memory was 203.4MB in the beginning and 420.5MB in the end (delta: 217.1MB). Free memory was 159.4MB in the beginning and 294.3MB in the end (delta: -134.9MB). Peak memory consumption was 83.8MB. Max. memory is 8.0GB. [2022-12-05 23:08:44,468 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 179.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:08:44,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.03ms. Allocated memory is still 203.4MB. Free memory was 159.4MB in the beginning and 134.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 23:08:44,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.16ms. Allocated memory is still 203.4MB. Free memory was 134.3MB in the beginning and 132.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:08:44,469 INFO L158 Benchmark]: Boogie Preprocessor took 31.00ms. Allocated memory is still 203.4MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:08:44,469 INFO L158 Benchmark]: RCFGBuilder took 529.24ms. Allocated memory is still 203.4MB. Free memory was 130.1MB in the beginning and 101.3MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-05 23:08:44,469 INFO L158 Benchmark]: TraceAbstraction took 9180.32ms. Allocated memory was 203.4MB in the beginning and 420.5MB in the end (delta: 217.1MB). Free memory was 100.7MB in the beginning and 294.3MB in the end (delta: -193.6MB). Peak memory consumption was 25.0MB. Max. memory is 8.0GB. [2022-12-05 23:08:44,470 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 179.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 377.03ms. Allocated memory is still 203.4MB. Free memory was 159.4MB in the beginning and 134.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.16ms. Allocated memory is still 203.4MB. Free memory was 134.3MB in the beginning and 132.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.00ms. Allocated memory is still 203.4MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 529.24ms. Allocated memory is still 203.4MB. Free memory was 130.1MB in the beginning and 101.3MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 9180.32ms. Allocated memory was 203.4MB in the beginning and 420.5MB in the end (delta: 217.1MB). Free memory was 100.7MB in the beginning and 294.3MB in the end (delta: -193.6MB). Peak memory consumption was 25.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 94 PlacesBefore, 26 PlacesAfterwards, 89 TransitionsBefore, 20 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 33 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 917, independent: 877, independent conditional: 877, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 917, independent: 877, independent conditional: 0, independent unconditional: 877, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 917, independent: 877, independent conditional: 0, independent unconditional: 877, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 917, independent: 877, independent conditional: 0, independent unconditional: 877, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 709, independent: 682, independent conditional: 0, independent unconditional: 682, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 709, independent: 674, independent conditional: 0, independent unconditional: 674, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 161, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 917, independent: 195, independent conditional: 0, independent unconditional: 195, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 709, unknown conditional: 0, unknown unconditional: 709] , Statistics on independence cache: Total cache size (in pairs): 1158, Positive cache size: 1131, Positive conditional cache size: 0, Positive unconditional cache size: 1131, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 22 PlacesBefore, 21 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 53, independent conditional: 3, independent unconditional: 50, dependent: 29, dependent conditional: 4, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 53, independent conditional: 3, independent unconditional: 50, dependent: 29, dependent conditional: 4, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 53, independent conditional: 3, independent unconditional: 50, dependent: 29, dependent conditional: 4, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 27, independent conditional: 2, independent unconditional: 25, dependent: 12, dependent conditional: 3, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 12, dependent conditional: 3, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 58, dependent conditional: 17, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 82, independent: 26, independent conditional: 1, independent unconditional: 25, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 39, unknown conditional: 5, unknown unconditional: 34] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 27, Positive conditional cache size: 2, Positive unconditional cache size: 25, Negative cache size: 12, Negative conditional cache size: 3, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 22 PlacesBefore, 22 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 22, independent conditional: 2, independent unconditional: 20, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 29, Positive conditional cache size: 2, Positive unconditional cache size: 27, Negative cache size: 14, Negative conditional cache size: 3, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 25, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 29, Positive conditional cache size: 2, Positive unconditional cache size: 27, Negative cache size: 14, Negative conditional cache size: 3, Negative unconditional cache size: 11, 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.3s, 28 PlacesBefore, 26 PlacesAfterwards, 16 TransitionsBefore, 14 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 46, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 34, Positive conditional cache size: 2, Positive unconditional cache size: 32, Negative cache size: 14, Negative conditional cache size: 3, Negative unconditional cache size: 11, 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.8s, 29 PlacesBefore, 27 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, 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: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 34, Positive conditional cache size: 2, Positive unconditional cache size: 32, Negative cache size: 14, Negative conditional cache size: 3, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 31 PlacesBefore, 31 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 40, Positive conditional cache size: 2, Positive unconditional cache size: 38, Negative cache size: 16, Negative conditional cache size: 3, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 29 PlacesBefore, 24 PlacesAfterwards, 16 TransitionsBefore, 11 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 44, Positive conditional cache size: 4, Positive unconditional cache size: 40, Negative cache size: 16, Negative conditional cache size: 3, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1649; [L816] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1649, ((void *)0), P0, ((void *)0))=-1, t1649={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L817] 0 pthread_t t1650; [L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1650, ((void *)0), P1, ((void *)0))=0, t1649={5:0}, t1650={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 [L784] 2 z = 1 [L787] 2 __unbuffered_p1_EAX = z [L790] 2 __unbuffered_p1_EBX = x [L743] 2 x = 1 [L748] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 2 y$flush_delayed = weak$$choice2 [L751] 2 y$mem_tmp = y [L752] 2 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) [L753] 2 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)) [L754] 2 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)) [L755] 2 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)) [L756] 2 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)) [L757] 2 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)) [L758] 2 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)) [L759] 2 __unbuffered_p0_EAX = y [L760] 2 y = y$flush_delayed ? y$mem_tmp : y [L761] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L793] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 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 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 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 [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 816]: 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 5 procedures, 110 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 357 IncrementalHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 2 mSDtfsCounter, 357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-05 23:08:44,487 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...