/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:21:14,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:21:14,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:21:14,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:21:14,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:21:14,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:21:14,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:21:14,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:21:14,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:21:14,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:21:14,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:21:14,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:21:14,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:21:14,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:21:14,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:21:15,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:21:15,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:21:15,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:21:15,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:21:15,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:21:15,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:21:15,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:21:15,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:21:15,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:21:15,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:21:15,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:21:15,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:21:15,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:21:15,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:21:15,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:21:15,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:21:15,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:21:15,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:21:15,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:21:15,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:21:15,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:21:15,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:21:15,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:21:15,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:21:15,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:21:15,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:21:15,033 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-SemanticLbe.epf [2022-12-05 20:21:15,063 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:21:15,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:21:15,065 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:21:15,065 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:21:15,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:21:15,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:21:15,066 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:21:15,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:21:15,067 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:21:15,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:21:15,068 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:21:15,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:21:15,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:21:15,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:21:15,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:21:15,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:21:15,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:21:15,069 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:21:15,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:21:15,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:21:15,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:21:15,069 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:21:15,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:21:15,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:21:15,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:21:15,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:21:15,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:21:15,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:21:15,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:21:15,070 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:21:15,070 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 20:21:15,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:21:15,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:21:15,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:21:15,451 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:21:15,452 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:21:15,453 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:21:16,437 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:21:16,696 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:21:16,697 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:21:16,711 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/271ccb798/2c1308e7653b4a6db0b3ea92ab7313f1/FLAG6e8dd3bbb [2022-12-05 20:21:16,726 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/271ccb798/2c1308e7653b4a6db0b3ea92ab7313f1 [2022-12-05 20:21:16,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:21:16,729 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:21:16,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:21:16,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:21:16,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:21:16,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:21:16" (1/1) ... [2022-12-05 20:21:16,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e9cd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:16, skipping insertion in model container [2022-12-05 20:21:16,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:21:16" (1/1) ... [2022-12-05 20:21:16,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:21:16,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:21:16,989 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/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 20:21:17,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:21:17,257 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:21:17,268 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/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-05 20:21:17,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:17,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:17,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:21:17,365 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:21:17,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:17 WrapperNode [2022-12-05 20:21:17,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:21:17,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:21:17,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:21:17,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:21:17,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:17" (1/1) ... [2022-12-05 20:21:17,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:17" (1/1) ... [2022-12-05 20:21:17,436 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-05 20:21:17,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:21:17,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:21:17,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:21:17,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:21:17,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:17" (1/1) ... [2022-12-05 20:21:17,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:17" (1/1) ... [2022-12-05 20:21:17,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:17" (1/1) ... [2022-12-05 20:21:17,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:17" (1/1) ... [2022-12-05 20:21:17,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:17" (1/1) ... [2022-12-05 20:21:17,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:17" (1/1) ... [2022-12-05 20:21:17,484 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:17" (1/1) ... [2022-12-05 20:21:17,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:17" (1/1) ... [2022-12-05 20:21:17,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:21:17,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:21:17,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:21:17,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:21:17,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:17" (1/1) ... [2022-12-05 20:21:17,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:21:17,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:21:17,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 20:21:17,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 20:21:17,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:21:17,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:21:17,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:21:17,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:21:17,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:21:17,576 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:21:17,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:21:17,576 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:21:17,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:21:17,576 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:21:17,578 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:21:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 20:21:17,578 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 20:21:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:21:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:21:17,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:21:17,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:21:17,580 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:21:17,793 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:21:17,795 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:21:18,140 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:21:18,234 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:21:18,235 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:21:18,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:21:18 BoogieIcfgContainer [2022-12-05 20:21:18,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:21:18,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:21:18,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:21:18,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:21:18,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:21:16" (1/3) ... [2022-12-05 20:21:18,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493b282b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:21:18, skipping insertion in model container [2022-12-05 20:21:18,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:17" (2/3) ... [2022-12-05 20:21:18,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493b282b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:21:18, skipping insertion in model container [2022-12-05 20:21:18,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:21:18" (3/3) ... [2022-12-05 20:21:18,244 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-05 20:21:18,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:21:18,262 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:21:18,262 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:21:18,309 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:21:18,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-05 20:21:18,384 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-05 20:21:18,384 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:21:18,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 20:21:18,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-05 20:21:18,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-05 20:21:18,397 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:21:18,415 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-05 20:21:18,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-05 20:21:18,479 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-05 20:21:18,479 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:21:18,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-05 20:21:18,487 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-05 20:21:18,487 INFO L188 LiptonReduction]: Number of co-enabled transitions 3300 [2022-12-05 20:21:24,011 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-05 20:21:24,025 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:21:24,031 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=PETRI_NET, 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;@566865b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:21:24,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 20:21:24,034 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2022-12-05 20:21:24,034 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:21:24,035 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:24,035 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 20:21:24,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:24,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:24,040 INFO L85 PathProgramCache]: Analyzing trace with hash 554300, now seen corresponding path program 1 times [2022-12-05 20:21:24,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:24,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258359161] [2022-12-05 20:21:24,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:24,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:21:24,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:24,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258359161] [2022-12-05 20:21:24,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258359161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:24,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:24,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:21:24,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130607352] [2022-12-05 20:21:24,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:24,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:21:24,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:24,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:21:24,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:21:24,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-05 20:21:24,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:24,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:24,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-05 20:21:24,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:25,565 INFO L130 PetriNetUnfolder]: 6050/8310 cut-off events. [2022-12-05 20:21:25,565 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-05 20:21:25,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16709 conditions, 8310 events. 6050/8310 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 42617 event pairs, 3098 based on Foata normal form. 0/7551 useless extension candidates. Maximal degree in co-relation 16697. Up to 6574 conditions per place. [2022-12-05 20:21:25,610 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 41 selfloop transitions, 2 changer transitions 10/58 dead transitions. [2022-12-05 20:21:25,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 243 flow [2022-12-05 20:21:25,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:21:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:21:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-05 20:21:25,621 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6576576576576577 [2022-12-05 20:21:25,622 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 3 states and 73 transitions. [2022-12-05 20:21:25,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 243 flow [2022-12-05 20:21:25,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 20:21:25,628 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 70 flow [2022-12-05 20:21:25,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-12-05 20:21:25,633 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2022-12-05 20:21:25,634 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 70 flow [2022-12-05 20:21:25,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:25,634 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:25,634 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:25,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:21:25,634 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:25,635 INFO L85 PathProgramCache]: Analyzing trace with hash 831268696, now seen corresponding path program 1 times [2022-12-05 20:21:25,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:25,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605296301] [2022-12-05 20:21:25,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:25,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:21:25,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:25,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605296301] [2022-12-05 20:21:25,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605296301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:25,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:25,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:21:25,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685865535] [2022-12-05 20:21:25,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:25,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:21:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:21:25,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:21:25,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:21:25,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 70 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:25,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:25,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:21:25,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:28,677 INFO L130 PetriNetUnfolder]: 20021/27147 cut-off events. [2022-12-05 20:21:28,678 INFO L131 PetriNetUnfolder]: For 1238/1238 co-relation queries the response was YES. [2022-12-05 20:21:28,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56149 conditions, 27147 events. 20021/27147 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 145613 event pairs, 6977 based on Foata normal form. 760/27907 useless extension candidates. Maximal degree in co-relation 56139. Up to 16658 conditions per place. [2022-12-05 20:21:28,963 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 44 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2022-12-05 20:21:28,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 230 flow [2022-12-05 20:21:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:21:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:21:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-05 20:21:28,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2022-12-05 20:21:28,966 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 70 flow. Second operand 3 states and 54 transitions. [2022-12-05 20:21:28,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 230 flow [2022-12-05 20:21:28,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:21:28,968 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 136 flow [2022-12-05 20:21:28,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-05 20:21:28,969 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2022-12-05 20:21:28,970 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 136 flow [2022-12-05 20:21:28,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:28,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:28,970 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:28,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:21:28,971 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:28,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:28,972 INFO L85 PathProgramCache]: Analyzing trace with hash -473243, now seen corresponding path program 1 times [2022-12-05 20:21:28,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:28,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742074892] [2022-12-05 20:21:28,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:28,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:21:29,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:29,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742074892] [2022-12-05 20:21:29,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742074892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:29,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:29,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:21:29,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646992554] [2022-12-05 20:21:29,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:29,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:21:29,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:29,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:21:29,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:21:29,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:21:29,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 136 flow. Second operand has 4 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-05 20:21:29,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:29,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:21:29,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:31,623 INFO L130 PetriNetUnfolder]: 18540/25160 cut-off events. [2022-12-05 20:21:31,624 INFO L131 PetriNetUnfolder]: For 11590/11590 co-relation queries the response was YES. [2022-12-05 20:21:31,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63998 conditions, 25160 events. 18540/25160 cut-off events. For 11590/11590 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 130361 event pairs, 4807 based on Foata normal form. 275/25435 useless extension candidates. Maximal degree in co-relation 63986. Up to 10821 conditions per place. [2022-12-05 20:21:31,824 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 60 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2022-12-05 20:21:31,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 368 flow [2022-12-05 20:21:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:21:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:21:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-05 20:21:31,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42567567567567566 [2022-12-05 20:21:31,828 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 136 flow. Second operand 4 states and 63 transitions. [2022-12-05 20:21:31,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 368 flow [2022-12-05 20:21:31,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:21:31,916 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 186 flow [2022-12-05 20:21:31,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-05 20:21:31,918 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2022-12-05 20:21:31,918 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 186 flow [2022-12-05 20:21:31,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-05 20:21:31,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:31,918 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:31,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:21:31,919 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:31,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:31,919 INFO L85 PathProgramCache]: Analyzing trace with hash -23155516, now seen corresponding path program 1 times [2022-12-05 20:21:31,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:31,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539972081] [2022-12-05 20:21:31,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:31,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:21:32,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:32,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539972081] [2022-12-05 20:21:32,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539972081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:32,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:32,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:21:32,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934120096] [2022-12-05 20:21:32,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:32,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:21:32,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:32,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:21:32,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:21:32,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:21:32,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 186 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:32,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:32,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:21:32,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:34,028 INFO L130 PetriNetUnfolder]: 17488/23740 cut-off events. [2022-12-05 20:21:34,029 INFO L131 PetriNetUnfolder]: For 18061/18061 co-relation queries the response was YES. [2022-12-05 20:21:34,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63553 conditions, 23740 events. 17488/23740 cut-off events. For 18061/18061 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 126023 event pairs, 3445 based on Foata normal form. 200/23940 useless extension candidates. Maximal degree in co-relation 63538. Up to 10661 conditions per place. [2022-12-05 20:21:34,196 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 71 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2022-12-05 20:21:34,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 494 flow [2022-12-05 20:21:34,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:21:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:21:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-05 20:21:34,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4797297297297297 [2022-12-05 20:21:34,200 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 186 flow. Second operand 4 states and 71 transitions. [2022-12-05 20:21:34,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 494 flow [2022-12-05 20:21:34,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:21:34,236 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 298 flow [2022-12-05 20:21:34,236 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2022-12-05 20:21:34,238 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2022-12-05 20:21:34,238 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 298 flow [2022-12-05 20:21:34,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:34,238 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:34,238 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:34,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:21:34,239 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:34,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1294698242, now seen corresponding path program 1 times [2022-12-05 20:21:34,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:34,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460868715] [2022-12-05 20:21:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:34,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:21:34,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:34,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460868715] [2022-12-05 20:21:34,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460868715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:34,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:34,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:21:34,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407913315] [2022-12-05 20:21:34,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:34,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:21:34,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:34,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:21:34,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:21:34,389 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-05 20:21:34,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:34,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:34,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-05 20:21:34,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:35,305 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([383] L766-->L773: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_105 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd1~0_27 256))))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_106 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_91 256) 0)) .cse0))) (and (= (ite (or (and (not (= (mod v_~a$w_buff1_used~0_90 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd1~0_26 256) 0)))) 0 v_~a$r_buff1_thd1~0_18) v_~a$r_buff1_thd1~0_17) (= (ite .cse2 0 v_~a$w_buff0_used~0_106) v_~a$w_buff0_used~0_105) (= v_~a$r_buff0_thd1~0_26 (ite .cse3 0 v_~a$r_buff0_thd1~0_27)) (= (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_35 v_~a~0_55)) v_~a~0_54) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_91) v_~a$w_buff1_used~0_90)))) InVars {~a~0=v_~a~0_55, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_106, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_91} OutVars{~a~0=v_~a~0_54, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_105, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_90} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][41], [Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 62#P2EXITtrue, P3Thread1of1ForFork1InUse, 108#L773true, Black: 166#true, P1Thread1of1ForFork2InUse, 173#true, Black: 168#(= ~__unbuffered_p1_EAX~0 0), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 5#L789true, 123#L887true, 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 103#L826true, Black: 154#true]) [2022-12-05 20:21:35,305 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:21:35,305 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:21:35,306 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:21:35,306 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:21:35,441 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([405] L829-->L845: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_50 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse4 .cse8)) (.cse12 (= 0 (mod v_~a$w_buff0_used~0_144 256))) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_125 256) 0)))) (let ((.cse10 (or .cse2 .cse12 .cse9)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse5 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (ite .cse10 v_~a~0_85 (ite .cse11 v_~a$w_buff0~0_61 v_~a$w_buff1~0_58))) (.cse3 (= (mod v_~a$w_buff0_used~0_143 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= .cse0 v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$flush_delayed~0_21 0) (= v_~a$r_buff0_thd4~0_57 (ite .cse1 v_~a$r_buff0_thd4~0_58 (ite (or .cse2 .cse3 (and .cse4 .cse5)) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse3) .cse6) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse1 v_~a$r_buff1_thd4~0_50 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse7 .cse8) .cse3 (and .cse7 .cse5))) v_~a$r_buff1_thd4~0_50 0)) v_~a$r_buff1_thd4~0_49) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= v_~a~0_84 (ite .cse1 v_~a$mem_tmp~0_14 .cse0)) (= (ite .cse1 v_~a$w_buff1_used~0_125 (ite (or .cse2 .cse3 .cse9) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse1 v_~a$w_buff0_used~0_144 (ite .cse10 v_~a$w_buff0_used~0_144 (ite .cse11 0 v_~a$w_buff0_used~0_144))) v_~a$w_buff0_used~0_143)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_50, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_144, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_49, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_143, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][71], [Black: 161#(= ~__unbuffered_p3_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 86#L845true, 166#true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 62#P2EXITtrue, 53#L766true, P3Thread1of1ForFork1InUse, 159#true, 173#true, Black: 168#(= ~__unbuffered_p1_EAX~0 0), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 5#L789true, P2Thread1of1ForFork3InUse, 123#L887true, Black: 156#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2022-12-05 20:21:35,441 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 20:21:35,441 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:35,441 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:35,442 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:35,442 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([383] L766-->L773: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_105 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd1~0_27 256))))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_106 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_91 256) 0)) .cse0))) (and (= (ite (or (and (not (= (mod v_~a$w_buff1_used~0_90 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd1~0_26 256) 0)))) 0 v_~a$r_buff1_thd1~0_18) v_~a$r_buff1_thd1~0_17) (= (ite .cse2 0 v_~a$w_buff0_used~0_106) v_~a$w_buff0_used~0_105) (= v_~a$r_buff0_thd1~0_26 (ite .cse3 0 v_~a$r_buff0_thd1~0_27)) (= (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_35 v_~a~0_55)) v_~a~0_54) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_91) v_~a$w_buff1_used~0_90)))) InVars {~a~0=v_~a~0_55, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_106, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_91} OutVars{~a~0=v_~a~0_54, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_105, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_90} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][41], [Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 62#P2EXITtrue, P3Thread1of1ForFork1InUse, 108#L773true, Black: 166#true, P1Thread1of1ForFork2InUse, 173#true, Black: 168#(= ~__unbuffered_p1_EAX~0 0), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 5#L789true, 51#L829true, 123#L887true, 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 154#true]) [2022-12-05 20:21:35,442 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 20:21:35,442 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:35,442 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:35,442 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:35,719 INFO L130 PetriNetUnfolder]: 7615/11408 cut-off events. [2022-12-05 20:21:35,719 INFO L131 PetriNetUnfolder]: For 10229/11230 co-relation queries the response was YES. [2022-12-05 20:21:35,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29661 conditions, 11408 events. 7615/11408 cut-off events. For 10229/11230 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 70716 event pairs, 1689 based on Foata normal form. 446/11359 useless extension candidates. Maximal degree in co-relation 29642. Up to 9168 conditions per place. [2022-12-05 20:21:35,807 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 50 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2022-12-05 20:21:35,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 508 flow [2022-12-05 20:21:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:21:35,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:21:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-05 20:21:35,809 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5315315315315315 [2022-12-05 20:21:35,809 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 298 flow. Second operand 3 states and 59 transitions. [2022-12-05 20:21:35,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 508 flow [2022-12-05 20:21:35,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:21:35,823 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 327 flow [2022-12-05 20:21:35,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2022-12-05 20:21:35,823 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2022-12-05 20:21:35,824 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 327 flow [2022-12-05 20:21:35,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:35,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:35,824 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:35,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:21:35,824 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:35,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:35,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2126847440, now seen corresponding path program 1 times [2022-12-05 20:21:35,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:35,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867765685] [2022-12-05 20:21:35,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:35,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:21:36,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:36,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867765685] [2022-12-05 20:21:36,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867765685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:36,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:36,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:21:36,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553096832] [2022-12-05 20:21:36,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:36,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:21:36,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:36,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:21:36,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:21:36,018 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-05 20:21:36,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:36,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:36,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-05 20:21:36,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:36,693 INFO L130 PetriNetUnfolder]: 4120/6536 cut-off events. [2022-12-05 20:21:36,693 INFO L131 PetriNetUnfolder]: For 5861/6145 co-relation queries the response was YES. [2022-12-05 20:21:36,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19713 conditions, 6536 events. 4120/6536 cut-off events. For 5861/6145 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 40331 event pairs, 961 based on Foata normal form. 536/6791 useless extension candidates. Maximal degree in co-relation 19692. Up to 2484 conditions per place. [2022-12-05 20:21:36,725 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 69 selfloop transitions, 9 changer transitions 0/97 dead transitions. [2022-12-05 20:21:36,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 97 transitions, 677 flow [2022-12-05 20:21:36,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:21:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:21:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-05 20:21:36,727 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5472972972972973 [2022-12-05 20:21:36,727 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 327 flow. Second operand 4 states and 81 transitions. [2022-12-05 20:21:36,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 97 transitions, 677 flow [2022-12-05 20:21:36,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 672 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:21:36,735 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 374 flow [2022-12-05 20:21:36,736 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=374, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2022-12-05 20:21:36,736 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2022-12-05 20:21:36,736 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 374 flow [2022-12-05 20:21:36,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:36,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:36,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:36,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:21:36,737 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:36,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash -377031090, now seen corresponding path program 1 times [2022-12-05 20:21:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:36,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667016142] [2022-12-05 20:21:36,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:36,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:21:36,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:36,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667016142] [2022-12-05 20:21:36,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667016142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:36,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:36,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:21:36,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794252720] [2022-12-05 20:21:36,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:36,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:21:36,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:36,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:21:36,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:21:36,927 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:21:36,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 374 flow. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:36,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:36,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:21:36,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:38,055 INFO L130 PetriNetUnfolder]: 8433/12515 cut-off events. [2022-12-05 20:21:38,055 INFO L131 PetriNetUnfolder]: For 27346/27346 co-relation queries the response was YES. [2022-12-05 20:21:38,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45137 conditions, 12515 events. 8433/12515 cut-off events. For 27346/27346 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 71031 event pairs, 661 based on Foata normal form. 66/12581 useless extension candidates. Maximal degree in co-relation 45114. Up to 4200 conditions per place. [2022-12-05 20:21:38,137 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 109 selfloop transitions, 39 changer transitions 24/172 dead transitions. [2022-12-05 20:21:38,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 172 transitions, 1390 flow [2022-12-05 20:21:38,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:21:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:21:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-05 20:21:38,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49099099099099097 [2022-12-05 20:21:38,139 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 374 flow. Second operand 6 states and 109 transitions. [2022-12-05 20:21:38,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 172 transitions, 1390 flow [2022-12-05 20:21:38,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 172 transitions, 1316 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-05 20:21:38,189 INFO L231 Difference]: Finished difference. Result has 61 places, 76 transitions, 636 flow [2022-12-05 20:21:38,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=636, PETRI_PLACES=61, PETRI_TRANSITIONS=76} [2022-12-05 20:21:38,190 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2022-12-05 20:21:38,190 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 76 transitions, 636 flow [2022-12-05 20:21:38,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:38,190 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:38,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:38,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:21:38,191 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:38,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:38,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2103249206, now seen corresponding path program 1 times [2022-12-05 20:21:38,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:38,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884478394] [2022-12-05 20:21:38,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:38,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:21:38,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:38,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884478394] [2022-12-05 20:21:38,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884478394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:38,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:38,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:21:38,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363200689] [2022-12-05 20:21:38,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:38,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:21:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:38,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:21:38,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:21:38,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-05 20:21:38,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 76 transitions, 636 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:38,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:38,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-05 20:21:38,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:39,143 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([405] L829-->L845: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_50 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse4 .cse8)) (.cse12 (= 0 (mod v_~a$w_buff0_used~0_144 256))) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_125 256) 0)))) (let ((.cse10 (or .cse2 .cse12 .cse9)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse5 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (ite .cse10 v_~a~0_85 (ite .cse11 v_~a$w_buff0~0_61 v_~a$w_buff1~0_58))) (.cse3 (= (mod v_~a$w_buff0_used~0_143 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= .cse0 v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$flush_delayed~0_21 0) (= v_~a$r_buff0_thd4~0_57 (ite .cse1 v_~a$r_buff0_thd4~0_58 (ite (or .cse2 .cse3 (and .cse4 .cse5)) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse3) .cse6) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse1 v_~a$r_buff1_thd4~0_50 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse7 .cse8) .cse3 (and .cse7 .cse5))) v_~a$r_buff1_thd4~0_50 0)) v_~a$r_buff1_thd4~0_49) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= v_~a~0_84 (ite .cse1 v_~a$mem_tmp~0_14 .cse0)) (= (ite .cse1 v_~a$w_buff1_used~0_125 (ite (or .cse2 .cse3 .cse9) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse1 v_~a$w_buff0_used~0_144 (ite .cse10 v_~a$w_buff0_used~0_144 (ite .cse11 0 v_~a$w_buff0_used~0_144))) v_~a$w_buff0_used~0_143)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_50, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_144, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_49, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_143, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][110], [Black: 184#(= ~y~0 1), Black: 161#(= ~__unbuffered_p3_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L876-3true, 86#L845true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 62#P2EXITtrue, P3Thread1of1ForFork1InUse, 166#true, 191#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), P1Thread1of1ForFork2InUse, 159#true, Black: 168#(= ~__unbuffered_p1_EAX~0 0), P0Thread1of1ForFork0InUse, 119#P0EXITtrue, Black: 175#(= ~__unbuffered_cnt~0 0), P2Thread1of1ForFork3InUse, 5#L789true, Black: 180#(<= ~__unbuffered_cnt~0 1), 199#(<= ~__unbuffered_cnt~0 2), Black: 156#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2022-12-05 20:21:39,144 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 20:21:39,144 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:39,144 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:39,144 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:39,310 INFO L130 PetriNetUnfolder]: 4228/6704 cut-off events. [2022-12-05 20:21:39,310 INFO L131 PetriNetUnfolder]: For 11824/12057 co-relation queries the response was YES. [2022-12-05 20:21:39,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21644 conditions, 6704 events. 4228/6704 cut-off events. For 11824/12057 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 42247 event pairs, 994 based on Foata normal form. 330/6715 useless extension candidates. Maximal degree in co-relation 21619. Up to 2568 conditions per place. [2022-12-05 20:21:39,334 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 100 selfloop transitions, 13 changer transitions 2/146 dead transitions. [2022-12-05 20:21:39,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 146 transitions, 1288 flow [2022-12-05 20:21:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:21:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:21:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-05 20:21:39,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5459459459459459 [2022-12-05 20:21:39,336 INFO L175 Difference]: Start difference. First operand has 61 places, 76 transitions, 636 flow. Second operand 5 states and 101 transitions. [2022-12-05 20:21:39,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 146 transitions, 1288 flow [2022-12-05 20:21:39,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 146 transitions, 1288 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:21:39,352 INFO L231 Difference]: Finished difference. Result has 66 places, 80 transitions, 704 flow [2022-12-05 20:21:39,352 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=704, PETRI_PLACES=66, PETRI_TRANSITIONS=80} [2022-12-05 20:21:39,353 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2022-12-05 20:21:39,353 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 80 transitions, 704 flow [2022-12-05 20:21:39,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:39,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:39,353 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:39,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:21:39,353 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:39,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:39,354 INFO L85 PathProgramCache]: Analyzing trace with hash 475068946, now seen corresponding path program 1 times [2022-12-05 20:21:39,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:39,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33865430] [2022-12-05 20:21:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:21:39,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:39,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33865430] [2022-12-05 20:21:39,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33865430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:39,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:39,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:21:39,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688194398] [2022-12-05 20:21:39,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:39,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:21:39,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:39,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:21:39,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:21:39,578 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:21:39,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 80 transitions, 704 flow. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:39,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:39,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:21:39,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:40,723 INFO L130 PetriNetUnfolder]: 8556/12875 cut-off events. [2022-12-05 20:21:40,723 INFO L131 PetriNetUnfolder]: For 41825/41825 co-relation queries the response was YES. [2022-12-05 20:21:40,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50659 conditions, 12875 events. 8556/12875 cut-off events. For 41825/41825 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 76461 event pairs, 1791 based on Foata normal form. 13/12888 useless extension candidates. Maximal degree in co-relation 50631. Up to 5785 conditions per place. [2022-12-05 20:21:40,786 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 99 selfloop transitions, 26 changer transitions 38/163 dead transitions. [2022-12-05 20:21:40,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 163 transitions, 1624 flow [2022-12-05 20:21:40,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:21:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:21:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-05 20:21:40,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2022-12-05 20:21:40,787 INFO L175 Difference]: Start difference. First operand has 66 places, 80 transitions, 704 flow. Second operand 4 states and 78 transitions. [2022-12-05 20:21:40,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 163 transitions, 1624 flow [2022-12-05 20:21:41,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 163 transitions, 1526 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-05 20:21:41,049 INFO L231 Difference]: Finished difference. Result has 69 places, 75 transitions, 699 flow [2022-12-05 20:21:41,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=699, PETRI_PLACES=69, PETRI_TRANSITIONS=75} [2022-12-05 20:21:41,050 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2022-12-05 20:21:41,050 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 699 flow [2022-12-05 20:21:41,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:41,050 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:41,050 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:41,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:21:41,050 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:41,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:41,051 INFO L85 PathProgramCache]: Analyzing trace with hash 503937636, now seen corresponding path program 1 times [2022-12-05 20:21:41,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:41,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858315175] [2022-12-05 20:21:41,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:41,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:21:42,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:42,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858315175] [2022-12-05 20:21:42,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858315175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:42,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:42,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:21:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782437305] [2022-12-05 20:21:42,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:42,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:21:42,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:42,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:21:42,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:21:42,003 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-05 20:21:42,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 699 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:42,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:42,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-05 20:21:42,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:43,279 INFO L130 PetriNetUnfolder]: 6536/11120 cut-off events. [2022-12-05 20:21:43,279 INFO L131 PetriNetUnfolder]: For 26086/26727 co-relation queries the response was YES. [2022-12-05 20:21:43,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38138 conditions, 11120 events. 6536/11120 cut-off events. For 26086/26727 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 82737 event pairs, 1219 based on Foata normal form. 88/10956 useless extension candidates. Maximal degree in co-relation 38107. Up to 5305 conditions per place. [2022-12-05 20:21:43,325 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 130 selfloop transitions, 9 changer transitions 27/189 dead transitions. [2022-12-05 20:21:43,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 189 transitions, 1830 flow [2022-12-05 20:21:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:21:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:21:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-05 20:21:43,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.509009009009009 [2022-12-05 20:21:43,328 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 699 flow. Second operand 6 states and 113 transitions. [2022-12-05 20:21:43,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 189 transitions, 1830 flow [2022-12-05 20:21:43,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 189 transitions, 1816 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-05 20:21:43,644 INFO L231 Difference]: Finished difference. Result has 78 places, 83 transitions, 765 flow [2022-12-05 20:21:43,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=765, PETRI_PLACES=78, PETRI_TRANSITIONS=83} [2022-12-05 20:21:43,645 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2022-12-05 20:21:43,645 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 83 transitions, 765 flow [2022-12-05 20:21:43,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:43,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:43,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:43,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:21:43,646 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:43,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:43,646 INFO L85 PathProgramCache]: Analyzing trace with hash -104268896, now seen corresponding path program 2 times [2022-12-05 20:21:43,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:43,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995527617] [2022-12-05 20:21:43,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:43,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:21:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:43,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995527617] [2022-12-05 20:21:43,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995527617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:43,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:43,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:21:43,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466642392] [2022-12-05 20:21:43,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:43,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:21:43,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:43,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:21:43,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:21:43,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-05 20:21:43,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 83 transitions, 765 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:43,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:43,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-05 20:21:43,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:44,916 INFO L130 PetriNetUnfolder]: 6263/10470 cut-off events. [2022-12-05 20:21:44,916 INFO L131 PetriNetUnfolder]: For 30711/31470 co-relation queries the response was YES. [2022-12-05 20:21:44,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41787 conditions, 10470 events. 6263/10470 cut-off events. For 30711/31470 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 77401 event pairs, 870 based on Foata normal form. 260/10462 useless extension candidates. Maximal degree in co-relation 41750. Up to 4141 conditions per place. [2022-12-05 20:21:44,974 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 66 selfloop transitions, 17 changer transitions 62/155 dead transitions. [2022-12-05 20:21:44,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 155 transitions, 1613 flow [2022-12-05 20:21:44,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:21:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:21:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-05 20:21:44,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2022-12-05 20:21:44,975 INFO L175 Difference]: Start difference. First operand has 78 places, 83 transitions, 765 flow. Second operand 6 states and 106 transitions. [2022-12-05 20:21:44,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 155 transitions, 1613 flow [2022-12-05 20:21:45,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 155 transitions, 1591 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 20:21:45,437 INFO L231 Difference]: Finished difference. Result has 81 places, 55 transitions, 460 flow [2022-12-05 20:21:45,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=460, PETRI_PLACES=81, PETRI_TRANSITIONS=55} [2022-12-05 20:21:45,438 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places. [2022-12-05 20:21:45,438 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 55 transitions, 460 flow [2022-12-05 20:21:45,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:45,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:45,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:45,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:21:45,439 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:45,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:45,439 INFO L85 PathProgramCache]: Analyzing trace with hash -516450344, now seen corresponding path program 1 times [2022-12-05 20:21:45,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:45,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020792732] [2022-12-05 20:21:45,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:45,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:21:45,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:45,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020792732] [2022-12-05 20:21:45,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020792732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:45,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:45,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:21:45,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092133314] [2022-12-05 20:21:45,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:45,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:21:45,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:45,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:21:45,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:21:45,655 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:21:45,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 55 transitions, 460 flow. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:45,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:45,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:21:45,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:46,096 INFO L130 PetriNetUnfolder]: 2225/3630 cut-off events. [2022-12-05 20:21:46,096 INFO L131 PetriNetUnfolder]: For 16218/16218 co-relation queries the response was YES. [2022-12-05 20:21:46,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16584 conditions, 3630 events. 2225/3630 cut-off events. For 16218/16218 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 19448 event pairs, 704 based on Foata normal form. 2/3632 useless extension candidates. Maximal degree in co-relation 16550. Up to 1782 conditions per place. [2022-12-05 20:21:46,110 INFO L137 encePairwiseOnDemand]: 30/37 looper letters, 60 selfloop transitions, 4 changer transitions 30/94 dead transitions. [2022-12-05 20:21:46,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 94 transitions, 902 flow [2022-12-05 20:21:46,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:21:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:21:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-05 20:21:46,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3918918918918919 [2022-12-05 20:21:46,111 INFO L175 Difference]: Start difference. First operand has 81 places, 55 transitions, 460 flow. Second operand 4 states and 58 transitions. [2022-12-05 20:21:46,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 94 transitions, 902 flow [2022-12-05 20:21:46,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 94 transitions, 740 flow, removed 30 selfloop flow, removed 13 redundant places. [2022-12-05 20:21:46,145 INFO L231 Difference]: Finished difference. Result has 70 places, 44 transitions, 256 flow [2022-12-05 20:21:46,146 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=70, PETRI_TRANSITIONS=44} [2022-12-05 20:21:46,146 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2022-12-05 20:21:46,146 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 256 flow [2022-12-05 20:21:46,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:46,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:46,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:46,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:21:46,147 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:46,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:46,147 INFO L85 PathProgramCache]: Analyzing trace with hash -477811828, now seen corresponding path program 2 times [2022-12-05 20:21:46,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:46,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384294816] [2022-12-05 20:21:46,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:46,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:21:46,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:21:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:21:46,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:21:46,340 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:21:46,341 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 20:21:46,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 20:21:46,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 20:21:46,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 20:21:46,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 20:21:46,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 20:21:46,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 20:21:46,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:21:46,344 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:46,351 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:21:46,351 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:21:46,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:21:46 BasicIcfg [2022-12-05 20:21:46,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:21:46,456 INFO L158 Benchmark]: Toolchain (without parser) took 29726.11ms. Allocated memory was 197.1MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 172.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 620.9MB. Max. memory is 8.0GB. [2022-12-05 20:21:46,456 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 197.1MB. Free memory was 174.0MB in the beginning and 173.9MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:21:46,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.44ms. Allocated memory is still 197.1MB. Free memory was 171.9MB in the beginning and 143.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 20:21:46,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.58ms. Allocated memory is still 197.1MB. Free memory was 143.6MB in the beginning and 141.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:21:46,456 INFO L158 Benchmark]: Boogie Preprocessor took 51.92ms. Allocated memory is still 197.1MB. Free memory was 141.0MB in the beginning and 138.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:21:46,457 INFO L158 Benchmark]: RCFGBuilder took 747.87ms. Allocated memory is still 197.1MB. Free memory was 138.9MB in the beginning and 101.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-05 20:21:46,457 INFO L158 Benchmark]: TraceAbstraction took 28216.17ms. Allocated memory was 197.1MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 100.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 548.5MB. Max. memory is 8.0GB. [2022-12-05 20:21:46,458 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.14ms. Allocated memory is still 197.1MB. Free memory was 174.0MB in the beginning and 173.9MB in the end (delta: 63.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 636.44ms. Allocated memory is still 197.1MB. Free memory was 171.9MB in the beginning and 143.6MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.58ms. Allocated memory is still 197.1MB. Free memory was 143.6MB in the beginning and 141.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.92ms. Allocated memory is still 197.1MB. Free memory was 141.0MB in the beginning and 138.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 747.87ms. Allocated memory is still 197.1MB. Free memory was 138.9MB in the beginning and 101.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 28216.17ms. Allocated memory was 197.1MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 100.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 548.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 139 PlacesBefore, 49 PlacesAfterwards, 128 TransitionsBefore, 37 TransitionsAfterwards, 3300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2340, independent: 2263, independent conditional: 2263, independent unconditional: 0, dependent: 77, dependent conditional: 77, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2340, independent: 2263, independent conditional: 0, independent unconditional: 2263, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2340, independent: 2263, independent conditional: 0, independent unconditional: 2263, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2340, independent: 2263, independent conditional: 0, independent unconditional: 2263, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1809, independent: 1763, independent conditional: 0, independent unconditional: 1763, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1809, independent: 1748, independent conditional: 0, independent unconditional: 1748, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 287, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2340, independent: 500, independent conditional: 0, independent unconditional: 500, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 1809, unknown conditional: 0, unknown unconditional: 1809] , Statistics on independence cache: Total cache size (in pairs): 2677, Positive cache size: 2631, Positive conditional cache size: 0, Positive unconditional cache size: 2631, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: 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_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t601, ((void *)0), P0, ((void *)0))=-3, t601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t602; [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t602, ((void *)0), P1, ((void *)0))=-2, t601={5:0}, t602={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t603, ((void *)0), P2, ((void *)0))=-1, t601={5:0}, t602={6:0}, t603={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t604, ((void *)0), P3, ((void *)0))=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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=49, weak$$choice2=255, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 872]: 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: 870]: 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: 874]: 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 9 procedures, 170 locations, 7 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: 28.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 474 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1180 IncrementalHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 42 mSDtfsCounter, 1180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=765occurred in iteration=10, InterpolantAutomatonStates: 52, 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.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 1449 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 20:21:46,478 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...