/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe028_power.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:33:18,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:33:18,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:33:18,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:33:18,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:33:18,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:33:18,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:33:18,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:33:18,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:33:19,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:33:19,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:33:19,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:33:19,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:33:19,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:33:19,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:33:19,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:33:19,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:33:19,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:33:19,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:33:19,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:33:19,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:33:19,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:33:19,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:33:19,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:33:19,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:33:19,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:33:19,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:33:19,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:33:19,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:33:19,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:33:19,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:33:19,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:33:19,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:33:19,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:33:19,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:33:19,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:33:19,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:33:19,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:33:19,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:33:19,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:33:19,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:33:19,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:33:19,076 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:33:19,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:33:19,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:33:19,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:33:19,079 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:33:19,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:33:19,080 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:33:19,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:33:19,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:33:19,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:33:19,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:33:19,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:33:19,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:33:19,081 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:33:19,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:33:19,081 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:33:19,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:33:19,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:33:19,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:33:19,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:33:19,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:33:19,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:33:19,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:33:19,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:33:19,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:33:19,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:33:19,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:33:19,084 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:33:19,084 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-06 04:33:19,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:33:19,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:33:19,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:33:19,426 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:33:19,426 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:33:19,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe028_power.i [2022-12-06 04:33:20,574 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:33:20,857 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:33:20,857 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_power.i [2022-12-06 04:33:20,871 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2373a6fb0/47123ae39eb24c9887d915516ce52f94/FLAG3bbfd7eee [2022-12-06 04:33:20,884 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2373a6fb0/47123ae39eb24c9887d915516ce52f94 [2022-12-06 04:33:20,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:33:20,888 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:33:20,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:33:20,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:33:20,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:33:20,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:33:20" (1/1) ... [2022-12-06 04:33:20,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5abd68e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:20, skipping insertion in model container [2022-12-06 04:33:20,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:33:20" (1/1) ... [2022-12-06 04:33:20,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:33:20,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:33:21,088 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/safe028_power.i[990,1003] [2022-12-06 04:33:21,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:33:21,362 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:33:21,374 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/safe028_power.i[990,1003] [2022-12-06 04:33:21,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:33:21,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:33:21,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:33:21,490 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:33:21,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:21 WrapperNode [2022-12-06 04:33:21,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:33:21,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:33:21,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:33:21,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:33:21,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:21" (1/1) ... [2022-12-06 04:33:21,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:21" (1/1) ... [2022-12-06 04:33:21,556 INFO L138 Inliner]: procedures = 176, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-12-06 04:33:21,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:33:21,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:33:21,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:33:21,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:33:21,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:21" (1/1) ... [2022-12-06 04:33:21,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:21" (1/1) ... [2022-12-06 04:33:21,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:21" (1/1) ... [2022-12-06 04:33:21,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:21" (1/1) ... [2022-12-06 04:33:21,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:21" (1/1) ... [2022-12-06 04:33:21,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:21" (1/1) ... [2022-12-06 04:33:21,600 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:21" (1/1) ... [2022-12-06 04:33:21,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:21" (1/1) ... [2022-12-06 04:33:21,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:33:21,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:33:21,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:33:21,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:33:21,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:21" (1/1) ... [2022-12-06 04:33:21,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:33:21,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:33:21,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:33:21,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:33:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:33:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:33:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:33:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:33:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:33:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:33:21,693 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:33:21,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:33:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:33:21,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:33:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:33:21,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:33:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:33:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:33:21,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:33:21,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:33:21,696 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:33:21,831 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:33:21,832 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:33:22,298 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:33:22,686 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:33:22,687 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:33:22,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:33:22 BoogieIcfgContainer [2022-12-06 04:33:22,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:33:22,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:33:22,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:33:22,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:33:22,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:33:20" (1/3) ... [2022-12-06 04:33:22,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b67f2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:33:22, skipping insertion in model container [2022-12-06 04:33:22,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:33:21" (2/3) ... [2022-12-06 04:33:22,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b67f2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:33:22, skipping insertion in model container [2022-12-06 04:33:22,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:33:22" (3/3) ... [2022-12-06 04:33:22,707 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_power.i [2022-12-06 04:33:22,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:33:22,724 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:33:22,724 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:33:22,804 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:33:22,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:33:22,911 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 04:33:22,912 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:33:22,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:33:22,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-06 04:33:22,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2022-12-06 04:33:22,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:33:22,956 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-06 04:33:22,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2022-12-06 04:33:23,008 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-06 04:33:23,009 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:33:23,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-06 04:33:23,014 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-06 04:33:23,014 INFO L188 LiptonReduction]: Number of co-enabled transitions 1692 [2022-12-06 04:34:14,362 INFO L203 LiptonReduction]: Total number of compositions: 101 [2022-12-06 04:34:14,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:34:14,382 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;@206da0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:34:14,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:34:14,386 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 04:34:14,386 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:34:14,386 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:14,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:34:14,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:34:14,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:14,391 INFO L85 PathProgramCache]: Analyzing trace with hash 815331272, now seen corresponding path program 1 times [2022-12-06 04:34:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:14,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952054492] [2022-12-06 04:34:14,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:14,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:14,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:14,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952054492] [2022-12-06 04:34:14,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952054492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:14,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:14,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:34:14,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784569662] [2022-12-06 04:34:14,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:14,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:34:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:14,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:34:14,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:34:14,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 04:34:14,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 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-06 04:34:14,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:14,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 04:34:14,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:15,246 INFO L130 PetriNetUnfolder]: 879/1332 cut-off events. [2022-12-06 04:34:15,247 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 04:34:15,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2699 conditions, 1332 events. 879/1332 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5720 event pairs, 240 based on Foata normal form. 0/1184 useless extension candidates. Maximal degree in co-relation 2688. Up to 1060 conditions per place. [2022-12-06 04:34:15,275 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 27 selfloop transitions, 2 changer transitions 6/36 dead transitions. [2022-12-06 04:34:15,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 154 flow [2022-12-06 04:34:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:34:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:34:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 04:34:15,285 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-06 04:34:15,287 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 43 transitions. [2022-12-06 04:34:15,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 154 flow [2022-12-06 04:34:15,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:34:15,291 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 48 flow [2022-12-06 04:34:15,293 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2022-12-06 04:34:15,298 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 04:34:15,298 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:15,299 INFO L89 Accepts]: Start accepts. Operand has 31 places, 19 transitions, 48 flow [2022-12-06 04:34:15,301 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:15,301 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:15,301 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 19 transitions, 48 flow [2022-12-06 04:34:15,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 19 transitions, 48 flow [2022-12-06 04:34:15,317 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:34:15,317 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:34:15,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:34:15,318 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 48 flow [2022-12-06 04:34:15,318 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 04:34:15,513 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:34:15,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 04:34:15,516 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 48 flow [2022-12-06 04:34:15,516 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-06 04:34:15,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:15,516 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:15,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:34:15,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:34:15,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:15,517 INFO L85 PathProgramCache]: Analyzing trace with hash -870385484, now seen corresponding path program 1 times [2022-12-06 04:34:15,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:15,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934100150] [2022-12-06 04:34:15,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:15,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:15,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:15,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934100150] [2022-12-06 04:34:15,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934100150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:15,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:15,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:34:15,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727938586] [2022-12-06 04:34:15,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:15,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:34:15,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:15,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:34:15,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:34:15,898 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:34:15,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:15,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:15,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:34:15,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:16,093 INFO L130 PetriNetUnfolder]: 527/856 cut-off events. [2022-12-06 04:34:16,093 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-06 04:34:16,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 856 events. 527/856 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3467 event pairs, 143 based on Foata normal form. 16/872 useless extension candidates. Maximal degree in co-relation 1768. Up to 609 conditions per place. [2022-12-06 04:34:16,098 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2022-12-06 04:34:16,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 118 flow [2022-12-06 04:34:16,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:34:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:34:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 04:34:16,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 04:34:16,100 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 48 flow. Second operand 3 states and 30 transitions. [2022-12-06 04:34:16,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 118 flow [2022-12-06 04:34:16,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:34:16,102 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-12-06 04:34:16,102 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-06 04:34:16,103 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2022-12-06 04:34:16,104 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:16,104 INFO L89 Accepts]: Start accepts. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:34:16,104 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:16,105 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:16,105 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:34:16,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 04:34:16,111 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 04:34:16,111 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:34:16,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:34:16,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 04:34:16,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 04:34:16,188 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:34:16,189 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 04:34:16,189 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2022-12-06 04:34:16,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:16,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:16,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:16,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:34:16,190 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:34:16,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1212144358, now seen corresponding path program 1 times [2022-12-06 04:34:16,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:16,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669068015] [2022-12-06 04:34:16,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:16,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:17,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:17,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:17,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669068015] [2022-12-06 04:34:17,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669068015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:17,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:17,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:34:17,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720883023] [2022-12-06 04:34:17,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:17,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:34:17,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:17,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:34:17,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:34:17,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:34:17,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-06 04:34:17,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:17,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:34:17,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:17,756 INFO L130 PetriNetUnfolder]: 573/926 cut-off events. [2022-12-06 04:34:17,757 INFO L131 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2022-12-06 04:34:17,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1983 conditions, 926 events. 573/926 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3933 event pairs, 138 based on Foata normal form. 24/950 useless extension candidates. Maximal degree in co-relation 1972. Up to 667 conditions per place. [2022-12-06 04:34:17,764 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 34 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2022-12-06 04:34:17,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 189 flow [2022-12-06 04:34:17,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:34:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:34:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 04:34:17,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5157894736842106 [2022-12-06 04:34:17,766 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 5 states and 49 transitions. [2022-12-06 04:34:17,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 189 flow [2022-12-06 04:34:17,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:34:17,767 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 101 flow [2022-12-06 04:34:17,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-06 04:34:17,769 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2022-12-06 04:34:17,769 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:17,769 INFO L89 Accepts]: Start accepts. Operand has 34 places, 25 transitions, 101 flow [2022-12-06 04:34:17,770 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:17,770 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:17,770 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 101 flow [2022-12-06 04:34:17,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 101 flow [2022-12-06 04:34:17,804 INFO L130 PetriNetUnfolder]: 66/136 cut-off events. [2022-12-06 04:34:17,804 INFO L131 PetriNetUnfolder]: For 27/29 co-relation queries the response was YES. [2022-12-06 04:34:17,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 136 events. 66/136 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 529 event pairs, 32 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 305. Up to 101 conditions per place. [2022-12-06 04:34:17,806 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 101 flow [2022-12-06 04:34:17,806 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 04:34:17,974 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [769] $Ultimate##0-->L801: Formula: (and (= v_~x$w_buff0_used~0_313 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$r_buff1_thd2~0_66 v_~x$r_buff0_thd2~0_88) (= v_~x$r_buff1_thd1~0_89 v_~x$r_buff0_thd1~0_83) (= v_~x$w_buff0~0_190 1) (= v_~x$w_buff0~0_191 v_~x$w_buff1~0_179) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_289 256) 0)) (not (= (mod v_~x$w_buff0_used~0_313 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$r_buff0_thd2~0_87 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$w_buff0_used~0_314 v_~x$w_buff1_used~0_289) (= v_~x$r_buff1_thd0~0_46 v_~x$r_buff0_thd0~0_50) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~x$r_buff0_thd3~0_127 v_~x$r_buff1_thd3~0_125)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_191, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_83, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_88, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_314} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_190, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_83, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_179, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_125, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_66, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_289, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_89, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_87, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_313, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [754] L3-1-->L877: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd0~0_47 256) 0))) (let ((.cse7 (= (mod v_~x$w_buff1_used~0_284 256) 0)) (.cse6 (= (mod v_~x$r_buff1_thd0~0_43 256) 0)) (.cse2 (not .cse10)) (.cse1 (not (= (mod v_~x$w_buff0_used~0_305 256) 0))) (.cse9 (= (mod v_~x$w_buff0_used~0_306 256) 0))) (let ((.cse4 (not .cse9)) (.cse5 (select |v_#memory_int_325| |v_~#x~0.base_206|)) (.cse11 (and .cse2 .cse1)) (.cse0 (not .cse6)) (.cse8 (not .cse7))) (and (= v_~x$r_buff1_thd0~0_42 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_283 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_46 256) 0)))) 0 v_~x$r_buff1_thd0~0_43)) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~mem39#1_34| |v_ULTIMATE.start_main_#t~mem39#1_36|))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite41#1_40| v_~x$w_buff0~0_184) .cse4 (= |v_ULTIMATE.start_main_#t~ite40#1_35| |v_ULTIMATE.start_main_#t~ite40#1_33|)) (and (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_34| (select .cse5 |v_~#x~0.offset_206|)) (= |v_ULTIMATE.start_main_#t~ite40#1_33| |v_ULTIMATE.start_main_#t~mem39#1_34|) (or .cse6 .cse7)) (and .cse3 .cse0 (= |v_ULTIMATE.start_main_#t~ite40#1_33| v_~x$w_buff1~0_175) .cse8)) (= |v_ULTIMATE.start_main_#t~ite40#1_33| |v_ULTIMATE.start_main_#t~ite41#1_40|) (or .cse9 .cse10)))) (= (ite (and .cse2 .cse4) 0 v_~x$w_buff0_used~0_306) v_~x$w_buff0_used~0_305) (= |v_#memory_int_324| (store |v_#memory_int_325| |v_~#x~0.base_206| (store .cse5 |v_~#x~0.offset_206| |v_ULTIMATE.start_main_#t~ite41#1_40|))) (= v_~x$r_buff0_thd0~0_46 (ite .cse11 0 v_~x$r_buff0_thd0~0_47)) (= (ite (or .cse11 (and .cse0 .cse8)) 0 v_~x$w_buff1_used~0_284) v_~x$w_buff1_used~0_283))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_184, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_47, ~#x~0.offset=|v_~#x~0.offset_206|, ~x$w_buff1~0=v_~x$w_buff1~0_175, #memory_int=|v_#memory_int_325|, ~#x~0.base=|v_~#x~0.base_206|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_284, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_43, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_36|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_306} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_184, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_46, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_39|, ~#x~0.offset=|v_~#x~0.offset_206|, ~x$w_buff1~0=v_~x$w_buff1~0_175, #memory_int=|v_#memory_int_324|, ~#x~0.base=|v_~#x~0.base_206|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_283, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_42, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_305} AuxVars[|v_ULTIMATE.start_main_#t~mem39#1_34|, |v_ULTIMATE.start_main_#t~ite41#1_40|, |v_ULTIMATE.start_main_#t~ite40#1_33|] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41#1, #memory_int, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ~x$w_buff0_used~0] [2022-12-06 04:34:18,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [769] $Ultimate##0-->L801: Formula: (and (= v_~x$w_buff0_used~0_313 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$r_buff1_thd2~0_66 v_~x$r_buff0_thd2~0_88) (= v_~x$r_buff1_thd1~0_89 v_~x$r_buff0_thd1~0_83) (= v_~x$w_buff0~0_190 1) (= v_~x$w_buff0~0_191 v_~x$w_buff1~0_179) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_289 256) 0)) (not (= (mod v_~x$w_buff0_used~0_313 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$r_buff0_thd2~0_87 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$w_buff0_used~0_314 v_~x$w_buff1_used~0_289) (= v_~x$r_buff1_thd0~0_46 v_~x$r_buff0_thd0~0_50) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~x$r_buff0_thd3~0_127 v_~x$r_buff1_thd3~0_125)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_191, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_83, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_88, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_314} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_190, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_83, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_179, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_125, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_66, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_289, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_89, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_87, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_313, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [689] L762-->L780: Formula: (let ((.cse8 (= (mod v_~x$w_buff1_used~0_212 256) 0)) (.cse11 (= (mod v_~x$r_buff1_thd1~0_59 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_236 256) 0)) (.cse2 (= (mod v_~x$r_buff0_thd1~0_56 256) 0))) (let ((.cse12 (= (mod v_~weak$$choice2~0_82 256) 0)) (.cse5 (not .cse2)) (.cse9 (not .cse16)) (.cse4 (and .cse2 .cse11)) (.cse15 (and .cse8 .cse2)) (.cse14 (select |v_#memory_int_242| |v_~#x~0.base_164|))) (let ((.cse6 (select .cse14 |v_~#x~0.offset_164|)) (.cse7 (or .cse4 .cse15 .cse16)) (.cse10 (and .cse5 .cse9)) (.cse1 (= (mod v_~x$w_buff1_used~0_211 256) 0)) (.cse0 (not .cse12)) (.cse3 (= (mod v_~x$w_buff0_used~0_235 256) 0))) (and (= v_~x$w_buff1~0_116 v_~x$w_buff1~0_115) (= v_~x$r_buff0_thd1~0_55 (ite .cse0 v_~x$r_buff0_thd1~0_56 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~x$r_buff0_thd1~0_56 (ite (and .cse5 (not .cse3)) 0 v_~x$r_buff0_thd1~0_56)))) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_72) (or (and (= .cse6 |v_P0_#t~mem6_44|) .cse7 (= v_~__unbuffered_p0_EAX~0_22 |v_P0_#t~mem6_44|)) (and (or .cse5 (not .cse8)) .cse9 (= (ite .cse10 v_~x$w_buff0~0_131 v_~x$w_buff1~0_116) v_~__unbuffered_p0_EAX~0_22) (= |v_P0Thread1of1ForFork2_#t~mem6_1| |v_P0_#t~mem6_44|) (or .cse5 (not .cse11)))) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_82) (= v_~x$w_buff0~0_131 v_~x$w_buff0~0_130) (= v_~x$flush_delayed~0_58 0) (= v_~x$mem_tmp~0_30 .cse6) (= (ite .cse0 v_~x$w_buff0_used~0_236 (ite .cse7 v_~x$w_buff0_used~0_236 (ite .cse10 0 v_~x$w_buff0_used~0_236))) v_~x$w_buff0_used~0_235) (or (and (= v_~__unbuffered_p0_EAX~0_22 |v_P0_#t~mem9_24|) .cse12 (= |v_P0_#t~ite10_25| |v_P0_#t~mem9_24|)) (and .cse0 (= |v_P0_#t~ite10_25| v_~x$mem_tmp~0_30) (= |v_P0Thread1of1ForFork2_#t~mem9_1| |v_P0_#t~mem9_24|))) (= v_~x$r_buff1_thd1~0_58 (ite .cse0 v_~x$r_buff1_thd1~0_59 (ite (let ((.cse13 (= (mod v_~x$r_buff0_thd1~0_55 256) 0))) (or (and .cse13 .cse1) .cse3 (and .cse13 .cse11))) v_~x$r_buff1_thd1~0_59 0))) (= (store |v_#memory_int_242| |v_~#x~0.base_164| (store .cse14 |v_~#x~0.offset_164| |v_P0_#t~ite10_25|)) |v_#memory_int_240|) (= v_~x$w_buff1_used~0_211 (ite .cse0 v_~x$w_buff1_used~0_212 (ite (or .cse3 .cse4 .cse15) v_~x$w_buff1_used~0_212 0))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_131, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_56, ~#x~0.offset=|v_~#x~0.offset_164|, ~x$w_buff1~0=v_~x$w_buff1~0_116, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_212, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_59, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_1|, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_236, #memory_int=|v_#memory_int_242|, ~#x~0.base=|v_~#x~0.base_164|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_130, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, ~#x~0.offset=|v_~#x~0.offset_164|, ~x$w_buff1~0=v_~x$w_buff1~0_115, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_211, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_58, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_1|, ~x$mem_tmp~0=v_~x$mem_tmp~0_30, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_72, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_1|, #memory_int=|v_#memory_int_240|, ~#x~0.base=|v_~#x~0.base_164|, ~weak$$choice2~0=v_~weak$$choice2~0_82, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_1|} AuxVars[|v_P0_#t~mem6_44|, |v_P0_#t~mem9_24|, |v_P0_#t~ite10_25|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$mem_tmp~0, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P0Thread1of1ForFork2_#t~mem5, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3, P0Thread1of1ForFork2_#t~ite10] [2022-12-06 04:34:19,243 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [769] $Ultimate##0-->L801: Formula: (and (= v_~x$w_buff0_used~0_313 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$r_buff1_thd2~0_66 v_~x$r_buff0_thd2~0_88) (= v_~x$r_buff1_thd1~0_89 v_~x$r_buff0_thd1~0_83) (= v_~x$w_buff0~0_190 1) (= v_~x$w_buff0~0_191 v_~x$w_buff1~0_179) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_289 256) 0)) (not (= (mod v_~x$w_buff0_used~0_313 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$r_buff0_thd2~0_87 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$w_buff0_used~0_314 v_~x$w_buff1_used~0_289) (= v_~x$r_buff1_thd0~0_46 v_~x$r_buff0_thd0~0_50) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~x$r_buff0_thd3~0_127 v_~x$r_buff1_thd3~0_125)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_191, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_83, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_88, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_314} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_190, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_50, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_83, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_179, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_125, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_66, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_289, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_89, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_127, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_87, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_313, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [703] L837-->L844: Formula: (let ((.cse5 (= (mod v_~x$r_buff0_thd3~0_90 256) 0))) (let ((.cse8 (= (mod v_~x$r_buff1_thd3~0_90 256) 0)) (.cse9 (= (mod v_~x$w_buff1_used~0_192 256) 0)) (.cse3 (not (= (mod v_~x$w_buff0_used~0_215 256) 0))) (.cse10 (not .cse5)) (.cse4 (= (mod v_~x$w_buff0_used~0_216 256) 0))) (let ((.cse1 (select |v_#memory_int_221| |v_~#x~0.base_152|)) (.cse11 (not .cse4)) (.cse0 (and .cse3 .cse10)) (.cse6 (not .cse9)) (.cse2 (not .cse8))) (and (= v_~x$r_buff0_thd3~0_89 (ite .cse0 0 v_~x$r_buff0_thd3~0_90)) (= |v_#memory_int_220| (store |v_#memory_int_221| |v_~#x~0.base_152| (store .cse1 |v_~#x~0.offset_152| |v_P2_#t~ite32_33|))) (= v_~x$r_buff1_thd3~0_89 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_191 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_89 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_90)) (let ((.cse7 (= |v_P2_#t~mem30_32| |v_P2Thread1of1ForFork1_#t~mem30_1|))) (or (and (or .cse4 .cse5) (or (and .cse6 .cse7 (= |v_P2_#t~ite31_29| v_~x$w_buff1~0_97) .cse2) (and (= |v_P2_#t~ite31_29| |v_P2_#t~mem30_32|) (or .cse8 .cse9) (= (select .cse1 |v_~#x~0.offset_152|) |v_P2_#t~mem30_32|))) (= |v_P2_#t~ite31_29| |v_P2_#t~ite32_33|)) (and (= |v_P2_#t~ite32_33| v_~x$w_buff0~0_112) .cse10 .cse7 (= |v_P2_#t~ite31_29| |v_P2Thread1of1ForFork1_#t~ite31_1|) .cse11))) (= v_~x$w_buff0_used~0_215 (ite (and .cse10 .cse11) 0 v_~x$w_buff0_used~0_216)) (= (ite (or .cse0 (and .cse6 .cse2)) 0 v_~x$w_buff1_used~0_192) v_~x$w_buff1_used~0_191))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_112, ~#x~0.offset=|v_~#x~0.offset_152|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_1|, ~x$w_buff1~0=v_~x$w_buff1~0_97, #memory_int=|v_#memory_int_221|, ~#x~0.base=|v_~#x~0.base_152|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_90, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_192, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_90, P2Thread1of1ForFork1_#t~mem30=|v_P2Thread1of1ForFork1_#t~mem30_1|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_112, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~#x~0.offset=|v_~#x~0.offset_152|, ~x$w_buff1~0=v_~x$w_buff1~0_97, #memory_int=|v_#memory_int_220|, ~#x~0.base=|v_~#x~0.base_152|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_89, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_191, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_89, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_215} AuxVars[|v_P2_#t~ite32_33|, |v_P2_#t~ite31_29|, |v_P2_#t~mem30_32|] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~mem30, ~x$w_buff0_used~0] [2022-12-06 04:34:20,096 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:34:20,097 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2328 [2022-12-06 04:34:20,097 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 109 flow [2022-12-06 04:34:20,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-06 04:34:20,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:20,098 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:20,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:34:20,098 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:34:20,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1078183425, now seen corresponding path program 1 times [2022-12-06 04:34:20,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:20,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127796417] [2022-12-06 04:34:20,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:20,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:20,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127796417] [2022-12-06 04:34:20,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127796417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:20,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:20,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:34:20,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157714108] [2022-12-06 04:34:20,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:20,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:34:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:20,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:34:20,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:34:20,329 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:34:20,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:20,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:20,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:34:20,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:20,491 INFO L130 PetriNetUnfolder]: 317/525 cut-off events. [2022-12-06 04:34:20,491 INFO L131 PetriNetUnfolder]: For 296/310 co-relation queries the response was YES. [2022-12-06 04:34:20,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1563 conditions, 525 events. 317/525 cut-off events. For 296/310 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1972 event pairs, 78 based on Foata normal form. 27/549 useless extension candidates. Maximal degree in co-relation 1549. Up to 408 conditions per place. [2022-12-06 04:34:20,495 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 36 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2022-12-06 04:34:20,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 263 flow [2022-12-06 04:34:20,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:34:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:34:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-06 04:34:20,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2022-12-06 04:34:20,498 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 109 flow. Second operand 3 states and 42 transitions. [2022-12-06 04:34:20,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 263 flow [2022-12-06 04:34:20,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:34:20,504 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 129 flow [2022-12-06 04:34:20,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2022-12-06 04:34:20,505 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-06 04:34:20,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:20,505 INFO L89 Accepts]: Start accepts. Operand has 35 places, 27 transitions, 129 flow [2022-12-06 04:34:20,507 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:20,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:20,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 129 flow [2022-12-06 04:34:20,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 129 flow [2022-12-06 04:34:20,543 INFO L130 PetriNetUnfolder]: 96/202 cut-off events. [2022-12-06 04:34:20,543 INFO L131 PetriNetUnfolder]: For 65/69 co-relation queries the response was YES. [2022-12-06 04:34:20,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 202 events. 96/202 cut-off events. For 65/69 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 919 event pairs, 38 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 474. Up to 112 conditions per place. [2022-12-06 04:34:20,545 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 129 flow [2022-12-06 04:34:20,545 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 04:34:20,547 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:34:20,555 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 04:34:20,555 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 129 flow [2022-12-06 04:34:20,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:20,555 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:20,555 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:20,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:34:20,556 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:34:20,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash -432658466, now seen corresponding path program 1 times [2022-12-06 04:34:20,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:20,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595142495] [2022-12-06 04:34:20,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:20,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:20,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:20,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595142495] [2022-12-06 04:34:20,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595142495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:20,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:20,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:34:20,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338472799] [2022-12-06 04:34:20,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:20,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:34:20,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:34:20,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:34:20,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:34:20,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-06 04:34:20,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:20,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:34:20,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:20,978 INFO L130 PetriNetUnfolder]: 168/306 cut-off events. [2022-12-06 04:34:20,979 INFO L131 PetriNetUnfolder]: For 183/197 co-relation queries the response was YES. [2022-12-06 04:34:20,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 306 events. 168/306 cut-off events. For 183/197 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1050 event pairs, 49 based on Foata normal form. 27/330 useless extension candidates. Maximal degree in co-relation 982. Up to 116 conditions per place. [2022-12-06 04:34:20,981 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 44 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2022-12-06 04:34:20,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 52 transitions, 338 flow [2022-12-06 04:34:20,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:34:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:34:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-12-06 04:34:20,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5869565217391305 [2022-12-06 04:34:20,986 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 129 flow. Second operand 4 states and 54 transitions. [2022-12-06 04:34:20,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 52 transitions, 338 flow [2022-12-06 04:34:20,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 52 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:34:20,990 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 165 flow [2022-12-06 04:34:20,990 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-06 04:34:20,992 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-06 04:34:20,992 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:20,992 INFO L89 Accepts]: Start accepts. Operand has 38 places, 30 transitions, 165 flow [2022-12-06 04:34:20,993 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:20,993 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:20,993 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 165 flow [2022-12-06 04:34:20,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 165 flow [2022-12-06 04:34:21,015 INFO L130 PetriNetUnfolder]: 39/106 cut-off events. [2022-12-06 04:34:21,015 INFO L131 PetriNetUnfolder]: For 71/82 co-relation queries the response was YES. [2022-12-06 04:34:21,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 106 events. 39/106 cut-off events. For 71/82 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 382 event pairs, 10 based on Foata normal form. 6/102 useless extension candidates. Maximal degree in co-relation 292. Up to 54 conditions per place. [2022-12-06 04:34:21,016 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 165 flow [2022-12-06 04:34:21,016 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 04:34:21,018 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [805] L866-3-->L3-1: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|) (= (mod v_~main$tmp_guard0~0_46 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_43| 0)) (= v_~main$tmp_guard0~0_46 (ite (= (ite (= v_~__unbuffered_cnt~0_103 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103} OutVars{ULTIMATE.start_main_#t~pre37#1=|v_ULTIMATE.start_main_#t~pre37#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_43|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_46, ULTIMATE.start_main_#t~nondet38#1=|v_ULTIMATE.start_main_#t~nondet38#1_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre37#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet38#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [830] $Ultimate##0-->L877: Formula: (let ((.cse2 (= 0 (mod v_~x$r_buff0_thd0~0_96 256)))) (let ((.cse5 (not (= (mod v_~x$w_buff0_used~0_477 256) 0))) (.cse0 (not .cse2))) (let ((.cse1 (select |v_#memory_int_546| |v_~#x~0.base_285|)) (.cse4 (= (mod v_~x$w_buff0_used~0_479 256) 0)) (.cse3 (and .cse5 .cse0))) (and (= v_~x$r_buff0_thd3~0_221 v_~x$r_buff1_thd3~0_210) (or (and (= |v_ULTIMATE.start_main_#t~ite41#1_86| v_~x$w_buff0~0_302) (= |v_ULTIMATE.start_main_#t~mem39#1_94| |v_ULTIMATE.start_main_#t~mem39#1_92|) (= |v_ULTIMATE.start_main_#t~ite40#1_93| |v_ULTIMATE.start_main_#t~ite40#1_91|) .cse0) (and (= |v_ULTIMATE.start_main_#t~mem39#1_92| (select .cse1 |v_~#x~0.offset_285|)) .cse2 (= |v_ULTIMATE.start_main_#t~ite40#1_91| |v_ULTIMATE.start_main_#t~mem39#1_92|) (= |v_ULTIMATE.start_main_#t~ite40#1_91| |v_ULTIMATE.start_main_#t~ite41#1_86|))) (= v_~x$r_buff0_thd1~0_146 v_~x$r_buff1_thd1~0_151) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_16| |v_P1Thread1of1ForFork0_~arg#1.offset_16|) (= (ite .cse3 0 v_~x$r_buff0_thd0~0_96) v_~x$r_buff0_thd0~0_95) (= (ite .cse4 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_22|) (= (ite .cse0 0 1) v_~x$w_buff0_used~0_477) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_22| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_22|) (= |v_P1Thread1of1ForFork0_~arg#1.base_16| |v_P1Thread1of1ForFork0_#in~arg#1.base_16|) (= v_~x$r_buff0_thd2~0_142 v_~x$r_buff1_thd2~0_109) (= v_~x$w_buff0~0_303 v_~x$w_buff1~0_289) (= v_~x$r_buff1_thd0~0_95 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_446 256) 0)) .cse0) (and .cse5 (not (= (mod v_~x$r_buff0_thd0~0_95 256) 0)))) 0 v_~x$r_buff0_thd0~0_96)) (= v_~x$w_buff0~0_302 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_22| 0)) (= (store |v_#memory_int_546| |v_~#x~0.base_285| (store .cse1 |v_~#x~0.offset_285| |v_ULTIMATE.start_main_#t~ite41#1_86|)) |v_#memory_int_545|) (= v_~x$w_buff1_used~0_446 (ite (or (and (not .cse4) .cse0) .cse3) 0 v_~x$w_buff0_used~0_479)) (= v_~x$r_buff0_thd2~0_141 1))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_303, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_96, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_146, ~#x~0.offset=|v_~#x~0.offset_285|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_221, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_142, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_16|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_479, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_16|, #memory_int=|v_#memory_int_546|, ~#x~0.base=|v_~#x~0.base_285|, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_94|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_93|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_302, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_95, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_22|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_146, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_16|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_16|, ~#x~0.offset=|v_~#x~0.offset_285|, ~x$w_buff1~0=v_~x$w_buff1~0_289, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_446, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_210, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_109, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_151, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_22|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_221, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_95, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_141, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_16|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_477, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_16|, ULTIMATE.start_main_#t~ite41#1=|v_ULTIMATE.start_main_#t~ite41#1_85|, #memory_int=|v_#memory_int_545|, ~#x~0.base=|v_~#x~0.base_285|} AuxVars[|v_ULTIMATE.start_main_#t~mem39#1_92|, |v_ULTIMATE.start_main_#t~ite40#1_91|, |v_ULTIMATE.start_main_#t~ite41#1_86|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41#1, #memory_int, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1] [2022-12-06 04:34:21,362 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:34:21,363 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 371 [2022-12-06 04:34:21,363 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 169 flow [2022-12-06 04:34:21,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-06 04:34:21,363 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:21,363 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:21,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:34:21,363 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:34:21,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:21,364 INFO L85 PathProgramCache]: Analyzing trace with hash 889523475, now seen corresponding path program 1 times [2022-12-06 04:34:21,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:21,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794849808] [2022-12-06 04:34:21,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:21,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:21,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:21,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794849808] [2022-12-06 04:34:21,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794849808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:21,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:21,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:34:21,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998761489] [2022-12-06 04:34:21,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:21,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:34:21,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:21,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:34:21,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:34:21,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 04:34:21,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:21,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:21,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 04:34:21,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:21,826 INFO L130 PetriNetUnfolder]: 142/255 cut-off events. [2022-12-06 04:34:21,827 INFO L131 PetriNetUnfolder]: For 322/336 co-relation queries the response was YES. [2022-12-06 04:34:21,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 255 events. 142/255 cut-off events. For 322/336 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 854 event pairs, 46 based on Foata normal form. 10/262 useless extension candidates. Maximal degree in co-relation 860. Up to 113 conditions per place. [2022-12-06 04:34:21,829 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 40 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2022-12-06 04:34:21,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 352 flow [2022-12-06 04:34:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:34:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:34:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-06 04:34:21,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-06 04:34:21,833 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 169 flow. Second operand 5 states and 55 transitions. [2022-12-06 04:34:21,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 352 flow [2022-12-06 04:34:21,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 315 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 04:34:21,838 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 156 flow [2022-12-06 04:34:21,838 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-06 04:34:21,841 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-06 04:34:21,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:21,841 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 156 flow [2022-12-06 04:34:21,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:21,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:21,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 156 flow [2022-12-06 04:34:21,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 156 flow [2022-12-06 04:34:21,858 INFO L130 PetriNetUnfolder]: 25/72 cut-off events. [2022-12-06 04:34:21,858 INFO L131 PetriNetUnfolder]: For 84/89 co-relation queries the response was YES. [2022-12-06 04:34:21,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 72 events. 25/72 cut-off events. For 84/89 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 215 event pairs, 6 based on Foata normal form. 1/64 useless extension candidates. Maximal degree in co-relation 189. Up to 29 conditions per place. [2022-12-06 04:34:21,859 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 156 flow [2022-12-06 04:34:21,859 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 04:34:23,117 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:34:23,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1277 [2022-12-06 04:34:23,119 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 152 flow [2022-12-06 04:34:23,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:23,119 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:23,119 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:23,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:34:23,119 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:34:23,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:23,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1485005476, now seen corresponding path program 1 times [2022-12-06 04:34:23,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:23,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171521593] [2022-12-06 04:34:23,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:23,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:23,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:23,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171521593] [2022-12-06 04:34:23,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171521593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:23,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:23,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:34:23,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565553808] [2022-12-06 04:34:23,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:23,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:34:23,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:23,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:34:23,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:34:23,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:34:23,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 152 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-06 04:34:23,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:23,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:34:23,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:23,523 INFO L130 PetriNetUnfolder]: 212/370 cut-off events. [2022-12-06 04:34:23,523 INFO L131 PetriNetUnfolder]: For 574/574 co-relation queries the response was YES. [2022-12-06 04:34:23,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 370 events. 212/370 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1475 event pairs, 10 based on Foata normal form. 1/371 useless extension candidates. Maximal degree in co-relation 1260. Up to 227 conditions per place. [2022-12-06 04:34:23,526 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 34 selfloop transitions, 1 changer transitions 23/58 dead transitions. [2022-12-06 04:34:23,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 58 transitions, 448 flow [2022-12-06 04:34:23,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:34:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:34:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 04:34:23,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-06 04:34:23,527 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 152 flow. Second operand 4 states and 43 transitions. [2022-12-06 04:34:23,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 58 transitions, 448 flow [2022-12-06 04:34:23,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 392 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 04:34:23,530 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 133 flow [2022-12-06 04:34:23,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-12-06 04:34:23,530 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-06 04:34:23,530 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:23,531 INFO L89 Accepts]: Start accepts. Operand has 39 places, 27 transitions, 133 flow [2022-12-06 04:34:23,531 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:23,531 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:23,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 27 transitions, 133 flow [2022-12-06 04:34:23,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 133 flow [2022-12-06 04:34:23,546 INFO L130 PetriNetUnfolder]: 28/82 cut-off events. [2022-12-06 04:34:23,547 INFO L131 PetriNetUnfolder]: For 64/68 co-relation queries the response was YES. [2022-12-06 04:34:23,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 82 events. 28/82 cut-off events. For 64/68 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 278 event pairs, 7 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 201. Up to 34 conditions per place. [2022-12-06 04:34:23,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 133 flow [2022-12-06 04:34:23,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 04:34:23,734 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [737] $Ultimate##0-->L762: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~y~0_9 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_9, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] and [831] $Ultimate##0-->L780: Formula: (let ((.cse0 (= (mod v_~weak$$choice2~0_144 256) 0)) (.cse8 (= (mod v_~x$w_buff0_used~0_485 256) 0)) (.cse9 (select |v_#memory_int_550| |v_~#x~0.base_287|)) (.cse2 (= (mod v_~x$r_buff0_thd1~0_149 256) 0))) (let ((.cse4 (not .cse2)) (.cse7 (select .cse9 |v_~#x~0.offset_287|)) (.cse3 (and .cse8 .cse2)) (.cse1 (not .cse0)) (.cse6 (= (mod v_~x$w_buff0_used~0_483 256) 0)) (.cse5 (= (mod v_~x$w_buff1_used~0_450 256) 0))) (and (or (and .cse0 (= |v_P0_#t~ite10_56| |v_P0_#t~mem9_55|) (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem9_55|)) (and (= |v_P0Thread1of1ForFork2_#t~mem9_62| |v_P0_#t~mem9_55|) .cse1 (= |v_P0_#t~ite10_56| v_~x$mem_tmp~0_88))) (= (ite .cse1 1 (ite (or .cse2 .cse3) 1 (ite .cse4 0 1))) v_~x$w_buff0_used~0_483) (= v_~x$r_buff0_thd2~0_145 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_24| 0)) (= v_~x$flush_delayed~0_122 0) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_24| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24|) (= v_~x$w_buff0~0_306 1) (= (ite .cse1 v_~x$r_buff0_thd1~0_149 (ite (or (and .cse5 .cse2) .cse6 .cse2) v_~x$r_buff0_thd1~0_149 (ite (and (not .cse6) .cse4) 0 v_~x$r_buff0_thd1~0_149))) v_~x$r_buff0_thd1~0_148) (or (and (= |v_P0Thread1of1ForFork2_#t~mem6_62| |v_P0_#t~mem6_75|) (= (ite .cse4 1 v_~x$w_buff0~0_308) v_~__unbuffered_p0_EAX~0_116) .cse4) (and (= .cse7 |v_P0_#t~mem6_75|) (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem6_75|) .cse2)) (= (ite .cse8 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24|) (= |v_P1Thread1of1ForFork0_~arg#1.base_18| |v_P1Thread1of1ForFork0_#in~arg#1.base_18|) (= |v_P0Thread1of1ForFork2_#t~nondet3_62| v_~weak$$choice0~0_136) (= v_~x$r_buff0_thd2~0_146 v_~x$r_buff1_thd2~0_111) (= (store |v_#memory_int_550| |v_~#x~0.base_287| (store .cse9 |v_~#x~0.offset_287| |v_P0_#t~ite10_56|)) |v_#memory_int_549|) (= v_~weak$$choice2~0_144 |v_P0Thread1of1ForFork2_#t~nondet4_62|) (= .cse7 v_~x$mem_tmp~0_88) (= v_~x$w_buff0~0_308 v_~x$w_buff1~0_291) (= v_~x$r_buff0_thd3~0_223 v_~x$r_buff1_thd3~0_212) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_18| |v_P1Thread1of1ForFork0_~arg#1.offset_18|) (= (ite .cse1 v_~x$w_buff0_used~0_485 (ite (or .cse6 .cse2 .cse3) v_~x$w_buff0_used~0_485 0)) v_~x$w_buff1_used~0_450) (= v_~x$r_buff1_thd0~0_99 v_~x$r_buff0_thd0~0_99) (= (ite .cse1 v_~x$r_buff0_thd1~0_149 (ite (let ((.cse10 (= (mod v_~x$r_buff0_thd1~0_148 256) 0))) (or (and .cse10 .cse2) .cse6 (and .cse5 .cse10))) v_~x$r_buff0_thd1~0_149 0)) v_~x$r_buff1_thd1~0_153)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_308, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_99, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_149, ~#x~0.offset=|v_~#x~0.offset_287|, P0Thread1of1ForFork2_#t~mem9=|v_P0Thread1of1ForFork2_#t~mem9_62|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_223, P0Thread1of1ForFork2_#t~mem6=|v_P0Thread1of1ForFork2_#t~mem6_62|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_146, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_18|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_485, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_18|, #memory_int=|v_#memory_int_550|, ~#x~0.base=|v_~#x~0.base_287|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_62|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_62|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_306, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_148, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_122, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_212, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_153, P0Thread1of1ForFork2_#t~mem8=|v_P0Thread1of1ForFork2_#t~mem8_33|, ~x$mem_tmp~0=v_~x$mem_tmp~0_88, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_24|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_223, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_18|, P0Thread1of1ForFork2_#t~mem5=|v_P0Thread1of1ForFork2_#t~mem5_33|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_18|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, P0Thread1of1ForFork2_#t~ite10=|v_P0Thread1of1ForFork2_#t~ite10_33|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_99, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_24|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_18|, ~#x~0.offset=|v_~#x~0.offset_287|, ~x$w_buff1~0=v_~x$w_buff1~0_291, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_450, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_111, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_145, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_99, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_483, ~weak$$choice0~0=v_~weak$$choice0~0_136, P0Thread1of1ForFork2_#t~ite7=|v_P0Thread1of1ForFork2_#t~ite7_33|, #memory_int=|v_#memory_int_549|, ~#x~0.base=|v_~#x~0.base_287|, ~weak$$choice2~0=v_~weak$$choice2~0_144} AuxVars[|v_P0_#t~mem6_75|, |v_P0_#t~ite10_56|, |v_P0_#t~mem9_55|] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, ~x$flush_delayed~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~mem8, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork2_#t~mem9, P0Thread1of1ForFork2_#t~mem6, P0Thread1of1ForFork2_#t~mem5, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_#t~ite10, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, P0Thread1of1ForFork2_#t~ite7, #memory_int, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, P0Thread1of1ForFork2_#t~nondet3] [2022-12-06 04:34:24,577 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:34:24,578 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1048 [2022-12-06 04:34:24,579 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 134 flow [2022-12-06 04:34:24,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 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-06 04:34:24,579 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:24,579 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:24,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:34:24,579 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:34:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:24,580 INFO L85 PathProgramCache]: Analyzing trace with hash 414112254, now seen corresponding path program 1 times [2022-12-06 04:34:24,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:24,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154897259] [2022-12-06 04:34:24,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:24,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:25,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:25,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154897259] [2022-12-06 04:34:25,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154897259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:25,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:25,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:34:25,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180520469] [2022-12-06 04:34:25,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:25,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:34:25,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:25,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:34:25,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:34:25,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 04:34:25,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:25,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:25,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 04:34:25,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:25,896 INFO L130 PetriNetUnfolder]: 193/383 cut-off events. [2022-12-06 04:34:25,897 INFO L131 PetriNetUnfolder]: For 685/693 co-relation queries the response was YES. [2022-12-06 04:34:25,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1386 conditions, 383 events. 193/383 cut-off events. For 685/693 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1683 event pairs, 13 based on Foata normal form. 4/386 useless extension candidates. Maximal degree in co-relation 1368. Up to 135 conditions per place. [2022-12-06 04:34:25,899 INFO L137 encePairwiseOnDemand]: 8/19 looper letters, 43 selfloop transitions, 13 changer transitions 25/82 dead transitions. [2022-12-06 04:34:25,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 82 transitions, 581 flow [2022-12-06 04:34:25,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:34:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:34:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-06 04:34:25,901 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46616541353383456 [2022-12-06 04:34:25,901 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 134 flow. Second operand 7 states and 62 transitions. [2022-12-06 04:34:25,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 82 transitions, 581 flow [2022-12-06 04:34:25,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 82 transitions, 572 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 04:34:25,905 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 221 flow [2022-12-06 04:34:25,905 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-06 04:34:25,906 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-06 04:34:25,906 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:25,906 INFO L89 Accepts]: Start accepts. Operand has 45 places, 34 transitions, 221 flow [2022-12-06 04:34:25,907 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:25,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:25,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 221 flow [2022-12-06 04:34:25,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 221 flow [2022-12-06 04:34:25,931 INFO L130 PetriNetUnfolder]: 43/130 cut-off events. [2022-12-06 04:34:25,932 INFO L131 PetriNetUnfolder]: For 366/394 co-relation queries the response was YES. [2022-12-06 04:34:25,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 130 events. 43/130 cut-off events. For 366/394 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 581 event pairs, 6 based on Foata normal form. 11/134 useless extension candidates. Maximal degree in co-relation 426. Up to 45 conditions per place. [2022-12-06 04:34:25,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 221 flow [2022-12-06 04:34:25,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 04:34:25,934 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:34:25,935 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 04:34:25,935 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 221 flow [2022-12-06 04:34:25,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:25,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:25,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:25,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:34:25,936 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:34:25,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash -364182000, now seen corresponding path program 1 times [2022-12-06 04:34:25,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:25,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284829773] [2022-12-06 04:34:25,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:34:26,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:34:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:34:26,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:34:26,194 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:34:26,195 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:34:26,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:34:26,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:34:26,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:34:26,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:34:26,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:34:26,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:34:26,197 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:26,203 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:34:26,203 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:34:26,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:34:26 BasicIcfg [2022-12-06 04:34:26,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:34:26,304 INFO L158 Benchmark]: Toolchain (without parser) took 65416.36ms. Allocated memory was 186.6MB in the beginning and 704.6MB in the end (delta: 518.0MB). Free memory was 160.5MB in the beginning and 539.8MB in the end (delta: -379.3MB). Peak memory consumption was 139.6MB. Max. memory is 8.0GB. [2022-12-06 04:34:26,304 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory was 163.0MB in the beginning and 162.9MB in the end (delta: 63.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:34:26,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.90ms. Allocated memory is still 186.6MB. Free memory was 160.5MB in the beginning and 132.0MB in the end (delta: 28.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 04:34:26,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.37ms. Allocated memory is still 186.6MB. Free memory was 132.0MB in the beginning and 129.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:34:26,305 INFO L158 Benchmark]: Boogie Preprocessor took 48.69ms. Allocated memory is still 186.6MB. Free memory was 129.4MB in the beginning and 126.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:34:26,305 INFO L158 Benchmark]: RCFGBuilder took 1082.99ms. Allocated memory was 186.6MB in the beginning and 226.5MB in the end (delta: 39.8MB). Free memory was 126.8MB in the beginning and 157.1MB in the end (delta: -30.3MB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. [2022-12-06 04:34:26,305 INFO L158 Benchmark]: TraceAbstraction took 63612.34ms. Allocated memory was 226.5MB in the beginning and 704.6MB in the end (delta: 478.2MB). Free memory was 156.1MB in the beginning and 539.8MB in the end (delta: -383.7MB). Peak memory consumption was 95.5MB. Max. memory is 8.0GB. [2022-12-06 04:34:26,306 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory was 163.0MB in the beginning and 162.9MB in the end (delta: 63.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 601.90ms. Allocated memory is still 186.6MB. Free memory was 160.5MB in the beginning and 132.0MB in the end (delta: 28.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.37ms. Allocated memory is still 186.6MB. Free memory was 132.0MB in the beginning and 129.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.69ms. Allocated memory is still 186.6MB. Free memory was 129.4MB in the beginning and 126.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1082.99ms. Allocated memory was 186.6MB in the beginning and 226.5MB in the end (delta: 39.8MB). Free memory was 126.8MB in the beginning and 157.1MB in the end (delta: -30.3MB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. * TraceAbstraction took 63612.34ms. Allocated memory was 226.5MB in the beginning and 704.6MB in the end (delta: 478.2MB). Free memory was 156.1MB in the beginning and 539.8MB in the end (delta: -383.7MB). Peak memory consumption was 95.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.3s, 130 PlacesBefore, 34 PlacesAfterwards, 122 TransitionsBefore, 25 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1275, independent: 1229, independent conditional: 1229, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1275, independent: 1229, independent conditional: 0, independent unconditional: 1229, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1275, independent: 1229, independent conditional: 0, independent unconditional: 1229, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1275, independent: 1229, independent conditional: 0, independent unconditional: 1229, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1014, independent: 978, independent conditional: 0, independent unconditional: 978, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1014, independent: 969, independent conditional: 0, independent unconditional: 969, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 344, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 328, dependent conditional: 0, dependent unconditional: 328, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1275, independent: 251, independent conditional: 0, independent unconditional: 251, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1014, unknown conditional: 0, unknown unconditional: 1014] , Statistics on independence cache: Total cache size (in pairs): 1620, Positive cache size: 1584, Positive conditional cache size: 0, Positive unconditional cache size: 1584, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, 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.2s, 28 PlacesBefore, 28 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, independent: 32, independent conditional: 4, independent unconditional: 28, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 187, dependent conditional: 12, dependent unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 48, unknown conditional: 5, unknown unconditional: 43] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 32, Positive conditional cache size: 4, Positive unconditional cache size: 28, Negative cache size: 16, Negative conditional cache size: 1, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 29 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 1, independent unconditional: 33, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 37, Positive conditional cache size: 4, Positive unconditional cache size: 33, Negative cache size: 19, Negative conditional cache size: 1, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 34 PlacesBefore, 33 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 101, independent: 84, independent conditional: 34, independent unconditional: 50, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 101, independent: 84, independent conditional: 34, independent unconditional: 50, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 101, independent: 84, independent conditional: 34, independent unconditional: 50, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 101, independent: 75, independent conditional: 29, independent unconditional: 46, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 11, unknown conditional: 5, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 52, Positive conditional cache size: 9, Positive unconditional cache size: 43, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 8, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 22, independent conditional: 8, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 8, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, 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: 28, independent: 22, independent conditional: 8, independent unconditional: 14, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 52, Positive conditional cache size: 9, Positive unconditional cache size: 43, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 55, independent conditional: 55, 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: 67, independent: 55, independent conditional: 25, independent unconditional: 30, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 55, independent conditional: 25, independent unconditional: 30, 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: 67, independent: 55, independent conditional: 25, independent unconditional: 30, 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: 6, independent: 6, independent conditional: 3, independent unconditional: 3, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 67, independent: 49, independent conditional: 22, independent unconditional: 27, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 59, Positive conditional cache size: 12, Positive unconditional cache size: 47, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 39 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 48, 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: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, 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: 60, independent: 48, independent conditional: 24, independent unconditional: 24, 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: 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: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 60, Positive conditional cache size: 12, Positive unconditional cache size: 48, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 38 PlacesBefore, 37 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 16, independent unconditional: 14, 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: 30, independent: 30, independent conditional: 16, independent unconditional: 14, 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: 30, independent: 30, independent conditional: 16, independent unconditional: 14, 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: 1, 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: 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: 30, independent: 28, independent conditional: 15, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 66, Positive conditional cache size: 13, Positive unconditional cache size: 53, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 66, Positive conditional cache size: 13, Positive unconditional cache size: 53, Negative cache size: 21, Negative conditional cache size: 1, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L861] 0 pthread_t t2449; [L862] FCALL, FORK 0 pthread_create(&t2449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2449, ((void *)0), P0, ((void *)0))=-2, t2449={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2450; [L864] FCALL, FORK 0 pthread_create(&t2450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2450, ((void *)0), P1, ((void *)0))=-1, t2449={7:0}, t2450={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L865] 0 pthread_t t2451; [L866] FCALL, FORK 0 pthread_create(&t2451, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2451, ((void *)0), P2, ((void *)0))=0, t2449={7:0}, t2450={8:0}, t2451={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 x$flush_delayed = weak$$choice2 [L820] EXPR 3 \read(x) [L820] 3 x$mem_tmp = x [L821] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L822] EXPR 3 \read(x) [L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L822] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L823] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L824] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L825] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L826] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L828] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L829] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L830] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L831] EXPR 3 \read(x) [L831] 3 __unbuffered_p2_EAX = x [L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L832] 3 x = x$flush_delayed ? x$mem_tmp : x [L833] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L836] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 1 y = 1 [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 x$w_buff1 = x$w_buff0 [L792] 2 x$w_buff0 = 1 [L793] 2 x$w_buff1_used = x$w_buff0_used [L794] 2 x$w_buff0_used = (_Bool)1 [L795] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L795] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L796] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L797] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L798] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L799] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L800] 2 x$r_buff0_thd2 = (_Bool)1 [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L839] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L839] EXPR 3 \read(x) [L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L839] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L839] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L840] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L841] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L842] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L843] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L846] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 3 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L872] EXPR 0 \read(x) [L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L873] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L874] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L875] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L876] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L879] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L880] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L880] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L881] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L883] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - 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: 862]: 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: 864]: 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: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 63.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 51.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 572 IncrementalHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 1 mSDtfsCounter, 572 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=8, InterpolantAutomatonStates: 34, 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.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:34:26,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...